Abstract

Novel architectures for designing modulo 2n+1 subtractors and combined adders/subtractors are proposed in this manuscript. Both the normal and the diminished-one representations of the operands are considered. Unit gate estimates and CMOS VLSI implementations reveal that the proposed modulo 2n+1 subtractors for operands in the normal representation are more efficient than those previously proposed. The proposed diminished-one modulo 2n+1 subtractors have a complexity similar to that of the corresponding diminished-one adders. Modulo 2n−1 subtractors and adders/subtractors are also considered for the sake of completeness and a comparison between alternative architectures is provided.

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.