Modular Multipliers Using a Modified Residue Addition Algorithm with Signed-Digit Number Representation.

In this paper, we present multipliers using a modified addition algorithm modulo m with a signed-digit(SD) number representation where m = 2ⁿ - 1, 2ⁿ or 2ⁿ + 1. To simplify an SD modular adder, new addition rules are proposed for generating the intermediate sum and carry with a binary number representation. By using the new codes for intermediate sum and carry and the end-around carry architecture, the proposed modulo m addition requires less hardware and short delay time for the residue addition than previous methods. A modulo m multiplier can be implemented by a binary modulo m adder tree. Compared to previous work, the circuit area and delay time of the multiplier are improved by 21% and 30%, respectively. [ABSTRACT FROM AUTHOR]

Copyright of International MultiConference of Engineers & Computer Scientists 2009 is the property of Newswood Limited and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)