Issue No. 03 - March (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.660169
<p><b>Abstract</b>—The modulo (2<super><it>n</it></super> + 1) multiplication is widely used in the computation of convolutions and in RNS arithmetic and, thus, it is important to reduce the calculation delay. This paper presents a concept of a modulo (2<super><it>n</it></super> + 1) carry save adder (MCSA) and uses two MCSAs to perform the residue reduction. We also apply Booth's algorithm to the modulo (2<super><it>n</it></super> + 1) multiplication scheme in order to reduce the number of partial products. With these techniques, the new architecture reduces the multiplier's calculation delay and is suitable for VLSI implementation for moderate and large <it>n</it> (<it>n</it>≥ 16).</p>
Convolution, Fermat number transform, RNS arithmetic, modulo (2n + 1) multiplication, Booth's algorithm, Wallace tree, carry save adder, CSA array, carry lookahead adder.
Y. Ma, "A Simplified Architecture for Modulo (2n + 1) Multiplication," in IEEE Transactions on Computers, vol. 47, no. , pp. 333-337, 1998.