Power analysis of high throughput pipelined carry-propagation adders

In several previous papers the area, delay, and power consumption for various carry-propagation adders have been compared. However, for high throughput applications it may be necessary to introduce pipelining into the adder. The number of stages to be inserted and the width of the pipelining registers differs between different adders structure. In this work we focus on the power consumption far adder structures when pipelining is used to increase the throughput. Four adder structures with varying wordlengths and pipeline levels are implemented using standard cells and the power consumption is compared. The results show that the Kogge-Stone parallel Prefix adder gives the lowest power consumption given the throughput most of the time.

[1]  Jack Sklansky,et al.  Conditional-Sum Addition Logic , 1960, IRE Trans. Electron. Comput..

[2]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[3]  Earl E. Swartzlander,et al.  Estimating the power consumption of CMOS adders , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[4]  Mary Jane Irwin,et al.  Area-time-power tradeoffs in parallel adders , 1996 .

[5]  Harold S. Stone,et al.  A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations , 1973, IEEE Transactions on Computers.

[6]  Reto Zimmermann,et al.  Binary adder architectures for cell-based VLSI and their synthesis , 1997 .

[7]  Jan M. Rabaey,et al.  Digital Integrated Circuits: A Design Perspective , 1995 .