Abstract
This paper describes how a w-bit prefix-type carry-lookahead adder may be modified to yield more than one result per operation. The modified adder, called a 'flagged prefix adder', adds two 2's-complement numbers to give a sum S equals A + B but returns anyone of the following results: S; S + 1; -(S + 1); -(S + 2) as a function of a set of flag bits derived by the adder concurrently with the addition. Similarly, if the flagged prefix adder preforms the 2's-complement subtraction S equals A-B, the adder may return any one of: S, S- 1, -S, -(S + 1). Hence, the flagged prefix adder may be used to perform 'instant increment' or 'instant complement' operations. The extra logic required by the flagged prefix adder relative to the original prefix adder is 2w gates and w 2-to-1 multiplexers.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Neil Burgess "Flagged prefix adder for dual additions", Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); https://doi.org/10.1117/12.325715
Lens.org Logo
CITATIONS
Cited by 20 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Logic

Multiplexers

Transistors

Signal generators

Field effect transistors

Very large scale integration

Computer arithmetic

RELATED CONTENT

An Ultra-Fast SBNR Divider
Proceedings of SPIE (May 17 1989)
Flexible arithmetic and logic unit for multimedia processing
Proceedings of SPIE (December 24 2003)
Noise analysis of MESFET gallium arsenide circuits
Proceedings of SPIE (October 08 1999)
GaAs VLSI technology and circuit elements for DSP
Proceedings of SPIE (October 01 1990)
Arithmetic processor design for the T9000 transputer
Proceedings of SPIE (December 01 1991)
Optimization of spanning tree adders
Proceedings of SPIE (August 25 2006)

Back to Top