By Topic

A universal architecture for designing efficient modulo 2n+1 multipliers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sousa, L. ; Electr. & Comput. Eng. Dept., Inst. Superior Tecnico, Lisbon, Portugal ; Chaves, R.

This paper proposes a simple and universal architecture for designing efficient modified Booth multipliers modulo (2n+1). The proposed architecture is comprehensive, providing modulo (2n+1) multipliers with similar performance and cost both for the ordinary and for the diminished-1 number representations. The performance and the efficiency of the proposed multipliers are evaluated and compared with the earlier fastest modulo (2n+1) multipliers, based on a simple gate-count and gate-delay model and on experimental results obtained from CMOS implementations. These results show that the proposed approach leads on average to approximately 10% faster multipliers than the fastest known structures for the diminished-1 representation based on the modified Booth recoding. Moreover, they also show that the proposed architecture is the only one taking advantage of this recoding to obtain faster multipliers with a significant reduction in hardware. With the used figures of merit, the proposed diminished-1 multipliers are on average 10% and 25% more efficient than the known most efficient modulo (2n+1) multipliers for Booth recoded and nonrecoded multipliers, respectively.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:52 ,  Issue: 6 )