Area-efficient multipliers for digital signal processing applications

An area-efficient parallel sign-magnitude multiplier that receives two N-bit numbers and produces an N-bit product, referred to as a truncated multiplier, is described. The quantization of the product to N bits is achieved by omitting about half the adder cells needed to add the partial products but in order to keep the quantization error to a minimum, probabilistic biases are obtained and are then fed to the inputs of the retained adder cells. The truncated multiplier requires approximately 50% of the area of a standard parallel multiplier. The paper then shows that this design strategy can also be applied for the design of two's-complement multipliers. The paper concludes with the application of the truncated multiplier for the implementation of a digital filter and it is shown that the signal-to-noise ratio of the digital filter using a truncated multiplier is better than that using a standard multiplier.

[1]  C. Lerouge,et al.  A fast 16 bit NMOS parallel multiplier , 1984, IEEE Journal of Solid-State Circuits.

[2]  Gehan A. J. Amaratunga,et al.  8*8 bit pipelined Dadda multiplier in CMOS , 1988 .

[3]  Shinji Nakamura,et al.  A Single Chip Parallel Multiplier by MOS Technology , 1988, IEEE Trans. Computers.

[4]  M.T. Fertsch,et al.  A 16 bitx16 bit pipelined multiplier macrocell , 1985, IEEE Journal of Solid-State Circuits.

[5]  M. Hatamian,et al.  A 70-MHz 8-bit/spl times/8-bit parallel pipelined multiplier in 2.5-/spl mu/m CMOS , 1986 .

[6]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

[7]  D. Schmitt-Landsiedel,et al.  A Pipelined 330 MHz Multiplier , 1985, ESSCIRC '85: 11th European Solid-State Circuits Conference.