Pipelined adders
Authors:
- L. DaddaLDL. Dadda
- V. PiuriVPV. Piuri
- 1 March 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 45 (3) , 348-356
Abstract
A well-known scheme for obtaining high throughput adders is a pipeline in which each stage contains an array of half-adders performing a carry-save addition. This paper shows that other schemes can be designed, based on the idea of pipelining a serial-input adder or a ripple-carry adder. Such schemes offer a considerable savings of components while preserving high throughput. These schemes can be generalized by using (p, q) parallel counters to obtain pipelined adders for more than two numbers.Keywords
This publication has 2 references indexed in Scilit: