Parallel multiplication using fast sorting networks

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³) 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² log² N), and the speed is O(log² N)