Abstract

The problem of designing efficient multioperand modular adders is approached. A carry-save adder tree is used allowing a response time lower than values in the literature, without restrictions regarding modules. Moreover it is shown that a structure such as the proposed one is suitable for evaluating |X|/sub m/ within a logarithmic time.

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.