A low-power carry skip adder with fast saturation

We present the design of a carry skip adder that achieves low power dissipation and high-performance operation. The carry skip adder's delay and power dissipation are reduced by dividing the adder into variable-sized blocks that balance the delay of inputs to the carry chain. This grouping reduces active power by minimizing extraneous glitches and transitions. Each block also uses highly optimized complementing carry look-ahead logic to reduce delay. Compared to previous designs, the adder architecture decreases power consumption by reducing the number of transistors, logic levels, and glitches. A 32-bit carry skip adder design that uses our approach has been implemented in 130 nm CMOS technology. At 1.2 V and 25 C, the 32-bit adder has a critical path delay of 921 ps and average power dissipation normalized to 600 MHz operation of 0.786 mW. We also present a technique to quickly perform saturating addition, which is useful in a variety of digital signal processing and multimedia applications. Our technique for fast saturation is based on techniques for carry select addition and works particularly well when the input and output operands can have different formats. A 40-bit carry skip adder that uses our technique for fast saturation has critical path delays of 1149 ps in 130 nm technology at 1.2 V and 25 C and 560 ps in 90nm technology at 1.0 V and 25 C. The 40-bit adder's average power dissipation normalized to 600 MHz operation is 0.928 mW in 130 nm technology and 0.335 mW in 90 nm technology.

[1]  David Harris,et al.  Logical effort of carry propagate adders , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[2]  Akhilesh Tyagi,et al.  A Reduced-Area Scheme for Carry-Select Adders , 1993, IEEE Trans. Computers.

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

[4]  Massimo Alioto,et al.  A simple strategy for optimized design of one-level carry-skip adders , 2003 .

[5]  Silvio Turrini,et al.  Optimal group distribution in carry-skip adders , 1989, Proceedings of 9th Symposium on Computer Arithmetic.

[6]  Vojin G. Oklobdzija,et al.  Delay Optimization of Carry-Skip Adders and Block Carry-Lookahead Adders Using Multidimensional Dynamic Programming , 1992, IEEE Trans. Computers.

[7]  Jean-Michel Muller,et al.  A Way to Build Efficient Carry-Skip Adders , 1987, IEEE Transactions on Computers.

[8]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[9]  Sanu Mathew,et al.  Energy-delay estimation technique for high-performance microprocessor VLSI adders , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

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

[11]  Stamatis Vassiliadis,et al.  A static low-power, high-performance 32-bit carry skip adder , 2004 .

[12]  C. John Glossner,et al.  Parallel saturating fractional arithmetic units , 1999, Proceedings Ninth Great Lakes Symposium on VLSI.

[13]  Lee-Sup Kim,et al.  A low power carry select adder with reduced area , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[14]  Uming Ko,et al.  Low-power design techniques for high-performance CMOS adders , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[15]  Vitit Kantabutra Designing Optimum One-Level Carry-Skip Adders , 1993, IEEE Trans. Computers.