Abstract

The implementation of residue number system (RNS) adders based on binary adders is described. These adders use two cycles of addition and support any class of modulus. A technique for choosing the correct sum in a two-cycle residue addition is presented and proved correct. Three VLSI layout approaches for residue adders are described and performance figures for area and speed are given. The two approaches using one binary adder offer savings of about 30% in area and significant improvement in speed/area product over the approach using two binary adders. >

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.