Evaluation of A+B=K Conditions Without Carry Propagation

Authors:
Jordi Cortadella;José M. Llabería
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 6
Cited 9

Reduced instruction set computer architectures for VLSI

Reduced instruction set computer architectures for VLSI
Reducing the cost of branches

ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Area-Time Optimal Adder Design

IEEE Transactions on Computers
MC68020 32-BIT microprocessor user's manual

MC68020 32-BIT microprocessor user's manual
Computer Arithmetic: Principles, Architecture and Design

Computer Arithmetic: Principles, Architecture and Design
RISC I: A Reduced Instruction Set VLSI Computer

ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture

Low load latency through sum-addressed memory (SAM)

Proceedings of the 25th annual international symposium on Computer architecture
Cool-Mem: combining statically speculative memory accessing with selective address translation for energy efficiency

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Designing for a Gigahertz

IEEE Micro
Redundant Arithmetic Optimizations (Research Note)

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Coupling compiler-enabled and conventional memory accessing for energy efficiency

ACM Transactions on Computer Systems (TOCS)
Instruction level redundant number computations for fast data intensive processing in asynchronous processors

Journal of Systems Architecture: the EUROMICRO Journal
Store Buffer Design in First-Level Multibanked Data Caches

Proceedings of the 32nd annual international symposium on Computer Architecture
A comparison of two policies for issuing instructions speculatively

Journal of Systems Architecture: the EUROMICRO Journal
Parameterized MAC unit generation for a scalable embedded DSP core

Microprocessors & Microsystems

Quantified Score

Hi-index	14.98

Visualization

Abstract

The response time of parallel adders is mainly determined by the carry propagation delay. The evaluation of conditions of the type A+B=K is addressed. Although an addition is involved in the comparison, it is shown that it can be evaluated without carry propagation, thus drastically reducing the computation time. Dependencies produced by branches degrade the performance of pipelined computers. The evaluation of conditions is often one of the critical paths in the execution of branch instructions. A circuit is proposed for the fast evaluation of A+B=K conditions that can significantly improve processor performance.