A novel efficient parallel algorithm for RNS to binary conversion for arbitrary moduli set

Author

Das, Amitabha

Author_Institution

Div. of Comput. Technol., Nanyang Technol. Univ., Singapore

fYear

1994

fDate

19-22 Apr 1994

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;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1994. ICASSP-94., 1994 IEEE International Conference on

Conference_Location

Adelaide, SA

ISSN

1520-6149

Print_ISBN

0-7803-1775-0

Type

conf

DOI

10.1109/ICASSP.1994.389619

Filename

389619

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2580577