Abstract
An algorithm for designing efficient modulo (2n+1) multipliers based on Booth recoding is proposed. With this algorithm, Wallace-tree adders can be used to design the fastest among all known modulo (2n+1) multipliers.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
