Abstract

ABSTRACTIn this paper, residue number system to binary converters for the moduli set {2n+1–3, 2n–1, 2n–1–1} using five techniques are investigated. These techniques are based on (1) mixed-radix conversion, (2) New Chinese Remainder Theorem (CRT) II, (3) CRT, (4) mixed-radix CRT, and (5) core function. The proposed converters are compared regarding area and conversion time requirements with the converters described for other three moduli sets described in the literature {2n–1, 2n, 2n+1}, {2n–1, 2n, 2n–1–1}, {2n–1, 2n, 2n+1–1} and a four moduli set {2n–3,2n–1,2n+1,2n+3} which has a similar dynamic range.

Full Text
Paper version not known

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 call

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.