Multiplication is frequently required in digital signal processing. Parallel multipliers provide a high-speed method for multiplication, but require large area for VLSI implementations. In most signal processing applications, a rounded product is desired to avoid growth in word-size. Thus an important design goal is to reduce the area requirements of rounded output multipliers. The authors present a technique for parallel multiplication which computes the product of two numbers by summing only the most significant columns of the multiplication matrix, along with a correction constant. A method for selecting the value of the correction constant which minimizes the average and mean square error is introduced. Equations are given for estimating the average, mean square, and maximum error of the rounded product. With this technique, the hardware requirements of the multiplier can be reduced by 25 to 35%, while limiting the maximum error of the rounded product to less than one unit in the last place.<<ETX>>
[1]
Andrew D. Booth,et al.
A SIGNED BINARY MULTIPLICATION TECHNIQUE
,
1951
.
[2]
Christopher S. Wallace,et al.
A Suggestion for a Fast Multiplier
,
1964,
IEEE Trans. Electron. Comput..
[3]
Stylianos D. Pezaris.
A 40-ns 17-Bit by 17-Bit Array Multiplier
,
1971,
IEEE Transactions on Computers.
[4]
Bruce A. Wooley,et al.
A Two's Complement Parallel Array Multiplication Algorithm
,
1973,
IEEE Transactions on Computers.
[5]
William J. Kubitz,et al.
A Compact High-Speed Parallel Multiplication Scheme
,
1977,
IEEE Transactions on Computers.
[6]
E. Swartzlander.
Merged Arithmetic
,
1980,
IEEE Transactions on Computers.
[7]
Mark Horowitz,et al.
SPIM: a pipelined 64*64-bit iterative multiplier
,
1989
.
[8]
Y. C. Lim,et al.
Single-Precision Multiplier with Reduced Circuit Complexity for Signal Processing Applications
,
1992,
IEEE Trans. Computers.