A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf
.
Parallel multiplication using fast sorting networks
1999
IEEE transactions on computers
AbstractÐ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 x was small. Unfortunately, the growth in the number of gates of that method was yx Q and the speed was yx. 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 yx P log P x, and the speed is ylog P x.
doi:10.1109/12.773800
fatcat:c4fa2olcxjdrraor7bddiu2ze4