Superpipelined adder designs
I.H. Unwala, Earl E. Swartzlander
Abstract
I.H. Unwala, Earl E. Swartzlander
Abstract
The superpipelining concept is applied to adder designs. Superpipelined designs of ripple carry, carry select, conditional sum, and carry lookahead adders are presented as examples. It is shown that the carry skip adder cannot be superpipelined. Results for the total number of latches required, the number of pipelining stages, and the total gate counts are presented. It is shown that the superpipelined carry lookahead adder is faster and less complex than the other adders.>
OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The superpipelining concept is applied to adder designs. Superpipelined designs of ripple carry, carry select, conditional sum, and carry lookahead adders are presented as examples. It is shown that the carry skip adder cannot be superpipelined. Results for the total number of latches required, the number of pipelining stages, and the total gate counts are presented. It is shown that the superpipelined carry lookahead adder is faster and less complex than the other adders.>
Key concepts: Adder, Carry (investment), Carry-save adder, Serial binary adder, Arithmetic, Computer science, Parallel computing, Algorithm