Issue No. 02 - February (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.833113
<p><b>Abstract</b>—Modular multiplication is a very important arithmetic operation in residue-based real-time computing systems. In realizing these multipliers, ROM-based structures are more efficient for small moduli. Due to the exponential growth of ROM sizes, implementations with arithmetic components are more suitable for medium and large moduli. This paper presents a new modular multiplier that can deal efficiently with medium and large size moduli. The design of this modular multiplier that multiplies two <tmath>$n$</tmath> bit residue digits consists, basically, of a <tmath>$(n\times n)$</tmath> binary multiplier, a <tmath>$((n-1-k)\times k)$</tmath> binary multiplier <tmath>$(k<n)$</tmath>, three <tmath>$n$</tmath>-bit adders, and a small-size combinational circuit. When compared with the most competitive published work [<ref type="bib" rid="bibT017012">12</ref>], the new multiplier reduces, significantly, both time delay and hardware requirements. The design is very suitable for VLSI realization.</p>
Residue number system, modular multiplication, computer arithmetic, VLSI, hardware requirements, time delay.
A. A. Hiasat, "New Efficient Structure for a Modular Multiplier for RNS," in IEEE Transactions on Computers, vol. 49, no. , pp. 170-174, 2000.