Introduction to algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A New Design Technique for Column Compression Multipliers
IEEE Transactions on Computers
| Hi-index | 14.98 |
A recent paper describes the use of Svoboda's binary counter in the construction of fast parallel multipliers. The resulting approach was shown to be faster than the conventional Dadda multiplier when the wordlength $N$ was small. Unfortunately, the growth in the number of gates of that method was $O(N^3)$ and the speed was $O(N)$. In this paper, Batcher's bitonic sorting network and other efficient networks replace the Svoboda counter. The asymptotic growth rate in gates of these new methods is $O(N^2 \log^2 N )$, and the speed is $O(\log^2 N)$.