Title :
A novel efficient parallel algorithm for RNS to binary conversion for arbitrary moduli set
Author_Institution :
Div. of Comput. Technol., Nanyang Technol. Univ., Singapore
Abstract :
We present a parallel algorithm for RNS to binary conversion, which is computationally efficient and requires moderate amount of storage. The algorithm is based on a graphical interpretation of the residue numbers, and imposes no restriction on the size or choice of moduli set. The parallel time complexity of the algorithm is Θ upper bound [(log k)], where k is the size of the moduli set
Keywords :
computational complexity; parallel algorithms; residue number systems; RNS to binary conversion; algorithm complexity; graphical interpretation; moduli set; parallel algorithm; parallel time complexity; residue numbers; storage; upper bound; Arithmetic; Concurrent computing; Dynamic range; Parallel algorithms; Signal processing algorithms; Spirals; Synthetic aperture sonar; Visualization; Wrapping;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1994. ICASSP-94., 1994 IEEE International Conference on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-1775-0
DOI :
10.1109/ICASSP.1994.389619
