×

A class of systolic multiplier units for VLSI technology. (English) Zbl 0591.94033

The architecture of a new systolic multiplier unit is introduced, and the VLSI design of this architecture is given. The proposed multiplication algorithm views the numbers as a string of bits, thus eliminating the need for any adder in the design. The main advantages of the proposed architecture are the following two: 1) the regularity of data flow through the system providing a suitable ground for the current VLSI technology, 2) the reduction of required I/O PINs per chip by a factor of two in the comparison with alternative models.
Reviewer: J.Hromkovič

MSC:

94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
94C30 Applications of design theory to circuits and networks
Full Text: DOI

References:

[1] D. D. Gajski, Parallel Compressors,IEEE Trans, on Computers, pp. 393?398 (May 1980).
[2] F. P. Agrawal, and V. U. Reddy, Log-Sum Multiplier, National Computer Conference, pp. 783?787 (1976).
[3] L. Dadda, Some Schemes for Parallel Multipliers,Alta Frequenza,34:349?356 (May 1986).
[4] A. Habibi and P. A. Wintz, Fast Multipliers,IEEE Trans, on Computers’, pp. 153?160 (February 1970).
[5] Jun. Iwamura, A 16-Bit CMOS/SOS Multiplier-Accumulator,IEEE, International Conference on Circuits and Computers, pp. 151?154 (1982).
[6] W. J. Stenzel, W. J. Kubitz, and G. H. Garcia, A Compact High Speed Multiplication Scheme,IEEE Trans, on Computers, pp. 948?957 (October 1977). · Zbl 0368.94037
[7] C. S. Wallace, A Suggestion for a Fast Multiplier,IEEE Trans. on Electronic Computers, pp. 14?17 (February 1964). · Zbl 0124.07907
[8] K. Hwang,Computer Arithmetric, Principles, Architecture, and Design, John Wiley and Sons, (1979).
[9] W. K. Luk, A Regular Layout for Parallel Multiplier of 0(log2 n) Time, inVLSI Systems and Computations, Computer Science Press, pp. 317?326 (1981).
[10] R. P. Brent and H. T. Kung, The Area Time Complexity of Binary Multiplication,Journal of the ACM,28(3):521?534 (July 1981). · Zbl 0462.68014 · doi:10.1145/322261.322269
[11] P. R. Cappello and K. Steiglitz, A VLSI Layout for a Pipelined Dadda Multiplier,ACM Trans. on Computer Systems, pp. 157?174 (May 1983).
[12] P. Reusens, W. H. Ku, and Y. H. Mao, Fixed Point High Parallel Multipliers in VLSI, inVLSI Systems and Computations, Computer Science Press, pp. 301?310 (1981).
[13] E. E. Swartzlander, Jr., Merged Arithmetic for Signal Processing,Proc. of IEEE Fourth Symp. on Comput. Arithmetic, Santa Monica, California (1978).
[14] J. Deverell, Pipeline Iterative Arithmetric Arrays,IEEE Trans. on Computers, pp. 317?322 (March 1978).
[15] C. Mead and L. Conway,Introduction to VLSI Systems, Addison Wesley (1980).
[16] A. R. Hurson, B. Shirazi and S. H. Pakzad, VSLI Layout Design of a Systolic Multiplier Unit for 2’s Complement Numbers,IEEE Int. Conf. on Comput. Design: VLSI in Computers, pp. 354?358 (1985).
[17] A. D. Booth, A Signed Binary Multiplication Technique,Quart. J. Mech. Appl. Math., Vol.4, Pt. 2 (1951). · Zbl 0043.12902
[18] L. R. Rubinfield, A Proof of the Modified Booth’s Algorithms for Multiplication,IEEE Trans. on Computers, pp. 1014?1015 (October 1975). · Zbl 0326.68034
[19] R. M. M. Obermann,Digital Circuits for Binary Arithmetic, A Halsted Press Book, (1979).
[20] S. Waser and M. J. Flynn,Introduction to Arithmetric for Digital Systems Designers, Holt, Reinhart and Winston, New York (1982).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.