article · IEEE Transactions on Computers · 1999
Parallel multiplication using fast sorting networks
Cited by 6Abstract and details only
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 N was small. Unfortunately, the growth in the number of gates of that method was O(N/sup 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/sup 2/ log/sup 2/ N), and the speed is O(log/sup 2/ N).
Cite this paper
Fiore, P. (1999). Parallel multiplication using fast sorting networks. IEEE Transactions on Computers, 48(6), 640–645. https://doi.org/10.1109/12.773800
Fiore, P.D. “Parallel multiplication using fast sorting networks.” IEEE Transactions on Computers, vol. 48, no. 6, 1999, pp. 640–45, https://doi.org/10.1109/12.773800.
Fiore, P.D. 1999. “Parallel multiplication using fast sorting networks.” IEEE Transactions on Computers 48 (6): 640–45. https://doi.org/10.1109/12.773800.
Fiore, P. (1999) ‘Parallel multiplication using fast sorting networks’, IEEE Transactions on Computers, 48(6), pp. 640–645. Available at: https://doi.org/10.1109/12.773800.
@article{fiore1999parallel,
title = {{Parallel multiplication using fast sorting networks}},
author = {Fiore, P.D.},
journal = {IEEE Transactions on Computers},
volume = {48},
number = {6},
pages = {640--645},
year = {1999},
doi = {10.1109/12.773800}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.