Area-time optimal adder with relative placement generator

This paper presents design of an adder generator, for the production of area-time-optimal adders. A unique feature of the proposed generator is its integrated synthesis and layout environment achieved by providing relative placement information to the synthesis tool. Adders produced by this generator are dynamically configured for a given technology library, wire-load model, delay, and area goal. The adder architecture used in this generator is a hybrid of Brent and Kung (1982), carry select, and ripple carry adders. When compared with standard cell fast adders, a 20%-50% reduction in area with comparable delays is achieved. The reduction comes from a judicious selection of ripple carry or carry select adders based on computation of delays. When performance is being met, the carry select adders are replaced with ripple carry adders. The proposed generator has been integrated into a commercially available high-performance datapath design tool.

[1]  Reto Zimmermann,et al.  Efficient VLSI implementation of modulo (2/sup n//spl plusmn/1) addition and multiplication , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[2]  Richard Brent.  On the Addition of Binary Numbers , 1970, IEEE Transactions on Computers.

[3]  Vojin G. Oklobdzija,et al.  High-performance system design : circuits and logic , 1999 .

[4]  Vojin G. Oklobdzija,et al.  Some optimal schemes for ALU implementation in VLSI technology , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[5]  J. Hsu,et al.  A Compiler For Optimal Adder Design , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[6]  G. Baccarani,et al.  A 3.5 ns, 64 bit, carry-lookahead adder , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[7]  K. Soumyanath,et al.  Sub-500-ps 64-b ALUs in 0 . 18-m SOI / Bulk CMOS : Design and Scaling Trends , 2001 .

[8]  Rolf Drechsler,et al.  On the generation of area-time optimal testable adders , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Vojin G. Oklobdzija,et al.  Delay optimization of carry-skip adders and block carry-lookahead adders , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[10]  Hoi-Jun Yoo,et al.  480 ps 64-bit race logic adder , 2001, 2001 Symposium on VLSI Circuits. Digest of Technical Papers (IEEE Cat. No.01CH37185).

[11]  Simon Knowles,et al.  A family of adders , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[12]  Vojin G. Oklobdzija,et al.  Multiplexer based adder for media signal processing , 1999, 1999 International Symposium on VLSI Technology, Systems, and Applications. Proceedings of Technical Papers. (Cat. No.99TH8453).

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

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

[15]  Cheng-Chew Lim,et al.  Parallel prefix adder design , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[16]  Belle W. Y. Wei,et al.  Area-Time Optimal Adder Design , 1990, IEEE Trans. Computers.

[17]  K. Soumyanath,et al.  Sub-500 ps 64 b ALUs in 0.18 /spl mu/m SOI/bulk CMOS: Design & scaling trends , 2001, 2001 IEEE International Solid-State Circuits Conference. Digest of Technical Papers. ISSCC (Cat. No.01CH37177).