Abstract
The use of a residue number system (RNS) in digital systems and especially filter designs is facilitated by efficient algorithms for the conversion from RNS to binary numbers. The conversion is generally based on the Chinese remainder theorem or the mixed radix conversion. This correspondence describes another conversion algorithm which employs the direct pairwise solution of the Diophantine equations defining the number in the given moduli set. The algorithm provides a high degree of parallel computation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
