Abstract

The modulo $2^{n} + 1$ multiplier is the bottleneck of a wide range of applications from residue number system arithmetic to cryptography. Recently, with demand for low-power and energy-efficient designs, the radix-8 Booth recoding has been considered to derive modulo $2^{n} + 1$ multipliers. This brief presents two novel methods to increase the performance and improve the efficiency of radix-8 modulo $2^{n} + 1$ multipliers. The first technique is a method to significantly reduce the amount of bias terms that need to be handled. The second technique is a new hard multiple generator based on a parallel-prefix structure that computes only for odd positions; it results in a lightweight parallel-prefix adder for the computation of the triple of a number with significant area-saving and improved fan-out. The implementation results based on the TSMC 65-nm technology show improvements of at least 27% and up to 57% in the area–time2 product when compared with the recently proposed radix-8 multiplier.

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.