Abstract
An investigation is conducted into residue number system (RNS) to decimal number system conversion algorithms and their implementations. For general Q-tuple RNS decoding, the authors propose a modularized decoding algorithm in which each module decodes only a 2-tuple RNS code, and they discuss its computational complexity at the algorithm level. The second algorithm is for decoding a 2-tuple RNS code and can be called a partial table-lookup method. By memorizing only partial decimal numbers in the dynamic range of any RNS, this method can generate the correct decimal number with at most three additions. Hardware implementation methods are discussed, and a comparison of the algorithms with conventional decoding algorithms is made in terms of the arithmetic operation complexity, dynamic range requirements, and hardware implementation complexity. >
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 callDisclaimer: 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.
