This paper presents the design of a highly re-configurable adder, which has been optimized for speed and area. Since pass transistor based multiplexer is the fastest element in standard CMOS logic, we designed the adder using only multiplexers and 2-input inverted logic gates. This adder is the hybrid of binary carry lookahead adder of Brent, and carry select adder. By using the hybrid approach, the area and wiring of the adder is reduced by 1/2, keeping the adder delay proportional to O(log n). The critical path of the 68-bit partitioned adder consists of 7 two-to-one multiplexers and 1 XOR gate. The adder can be partitioned to support a variety of data formats, it can add two 64-bit-operands, four 32-bit operands, eight 16-bit operands, or sixteen and bit operands. The adder can be used for multi-media applications, and is well suited for VLIW processors. The adder is described in Verilog, and synthesized using Synopsys tool. The critical path delay of the 64-bit adder is 0.9 ns at typical conditions in standard cell 0.25 um technology.
[1]
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.
[2]
Richard Brent.
On the Addition of Binary Numbers
,
1970,
IEEE Transactions on Computers.
[3]
Vojin G. Oklobdzija.
Simple and efficient CMOS circuit for fast VLSI adder realization
,
1988,
1988., IEEE International Symposium on Circuits and Systems.
[4]
Kai Hwang,et al.
Computer arithmetic: Principles, architecture, and design
,
1979
.
[5]
Michael J. Flynn,et al.
High-Speed Addition in CMOS
,
1992,
IEEE Trans. Computers.
[6]
Charles Roth,et al.
A low-power, high-speed implementation of a PowerPC/sup TM/ microprocessor vector extension
,
1999,
Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).
[7]
H. T. Kung,et al.
A Regular Layout for Parallel Adders
,
1982,
IEEE Transactions on Computers.