Title :
An 18 ns 56-bit multiply-adder circuit
Author :
Montoye, R.K. ; Cook, P.W. ; Hokenek, E. ; Havreluk, R.P.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
A multiply-adder that achieves a 56-b X*X+Z function with cycle time of 18 ns in a 1- mu m CMOS technology is discussed. The organization requires only two pipeline stages, ensuring quick recovery from branch instructions. The design is for the fraction part of a 64-b multiply-adder and is itself 56 b wide at input and output. To achieve high performance and reasonable density, it uses Booth encoding and a Wallace tree array. Data are captured at the input latches and routed immediately to the Booth encoders, which, in addition to encoding the X input, also provide driven Y and Y-bar signals for the array. The Z input is also captured and routed to the Z shifter. Encoded X, Y-bar, and Z and shifted Z signals are all routed to the partial product array. Booth encoding for 56 b produces 29 partial products; the Z input raises the number of terms to be added to 30. The partial product array reduces this to three, at which point a second latch captures the reduced result. After the latch, the three terms are reduced to two in a full adder, and the resulting two terms added and renormalized.<>
Keywords :
CMOS integrated circuits; adders; integrated logic circuits; multiplying circuits; pipeline processing; 1 micron; 18 ns; Booth encoding; CMOS technology; Wallace tree array; Y-bar signals; Z shifter; branch instructions; cycle time; full adder; multiply-adder circuit; partial product array; pipeline stages; Adders; CMOS technology; Circuits; Compressors; Decoding; Encoding; Latches; Pipelines; Very large scale integration; Wiring;
Conference_Titel :
Solid-State Circuits Conference, 1990. Digest of Technical Papers. 37th ISSCC., 1990 IEEE International
Conference_Location :
San Francisco, CA, USA
DOI :
10.1109/ISSCC.1990.110122