The Community for Technology Leaders
Green Image
Two algorithms for parallel multiplication of two n-bit binary numbers are presented. Both use column compression to increase the speed of execution. They require almost regular interconnection between only two types of cells and hence are very suitable for VLSI implementation. Both of them can also be easily modified to handle two's complement numbers with constant differences in time.
parallel algorithms; binary multiplication; systolic architectures; n-bit binary numbers; column compression; VLSI implementation; two's complement numbers; digital arithmetic; parallel algorithms.

P. Srimani and B. Sinha, "Fast Parallel Algorithms for Binary Multiplication and their Implementation on Systolic Architectures," in IEEE Transactions on Computers, vol. 38, no. , pp. 424-431, 1989.
91 ms
(Ver 3.3 (11022016))