A simplified architecture for modulo (2n + 1) multiplication

IEEE Transactions on Computers

Volumn 47, Issue 3, 1998, Pages 333-337

  Ma, Yutai ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

Booth's algorithm; Carry lookahead adder; Carry save adder; Convolution; CSA array; Fermat number transform; Modulo (2n + 1) multiplication; RNS arithmetic; Wallace tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; CONVOLUTIONAL CODES; LOGIC CIRCUITS; MATHEMATICAL TRANSFORMATIONS; TREES (MATHEMATICS);

BOOTH'S ALGORITHM; CARRY LOOKAHEAD ADDER; CARRY SAVER ADDER (CSA) ARRAYS; FERMAT NUMBER TRANSFORMS; RESIDUE NUMBER SYSTEM (RNS) ARITHMETIC; WALLACE TREE;

ADDERS;

EID: 0032025474     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.660169     Document Type: Article

References (16)

1. M. Benaissa, A. Bouridane, S.S. Dlay, and A.G.J. Holt, "Diminished-1 Multiplier for a Fast Convolver and Correlator Using the Fermat Number Transform," IEE Proc. G, vol. 135, no. 5, pp. 187-193, Oct. 1988.
2. M. Benaissa, A. Pajayakrit, S.S. Dlay, and A.G.J. Holt, "VLSI Design for Diminished-1 Multiplication of Integers Modulo a Fermat Number," IEE Proc. E, vol. 135, no. 3, pp. 161-164, May 1988.
3. A.D. Booth, "A Signed Binary Multiplication Technique," Quarterly J. Mechanical Applications of Math., vol. 4, pt. 2, pp. 236-240, 1951.
4. R.P. Brent and H.T. Kung, "A Regular Layout for Parallel Adders," IEEE Trans. Computers, vol. 31, no. 3, pp. 260-264, Mar. 1982.
5. J.J. Chang, T.K. Truong, H.M. Shao, I.S. Reed, and I.S. Hsu, "The VLSI Design of a Single Chip for the Multiplication of Integers Modulo a Fermat Number," IEEE Trans. Acoustics Speech and Signal Processing., vol. 33, no. 6, pp. 1,599-1,602, Dec. 1985.
6. n + 1)," IEEE J. Solid-State Circuits, vol. 26, no. 7, pp. 990-994, July 1991.
7. n - 1 Adder Design," IEEE Trans. Circuits and Systems-II, vol. 41, no. 7, pp. 463-467, July 1994.
8. L.M. Leibowitz, "A Simplified Binary Arithmetic for the Fermat Number Transform," IEEE Trans. Acoustics Speech and Signal Processing, vol. 24, no. 5, pp. 356-359, Oct.1976.
9. T.F. Ngai, M.J. Irwin, S. Rawat, "Regular, Area-Time Efficient Carry Lookahead Adders," J. Parallel and Distributed Computing, vol. 3, no. 1, pp. 92-105, Mar. 1986.
10. D. Radhakrishnan and Y. Yuan, "Novel Approaches to the Design of VLSI RNS multipliers," IEEE Trans. Circuits and Systems Part II, vol. 39, no. 1, pp. 52-57, Jan. 1992.
11. F.J. Taylor, "A VLSI Residue Arithmetic Multiplier," IEEE Trans. Computers, vol. 31, no. 6, pp. 540-546, June 1982.
12. F.J. Taylor, "A Single Modulus Complex ALU for Signal Processing," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 33, no. 5, pp. 1,302-1,315, Oct. 1985.
13. P.J. Towers, A. Pajayakrit, and A.G.J. Holt, "Cascadable NMOS VLSI Circuit for Implementing a Fast Convolver Using the Fermat Number Transform," IEE Proc. G, vol. 134, no. 2, pp. 57-66, 1987.
14. T.K. Truong, I.S. Reed, C.S. Yeh, and H.M. Shao, "A Parallel VLSI Architecture for a Digital Filter of Arbitrary Length Using Fermat Number Transforms," Proc. IEEE Int'l Conf. Circuits and Computers, pp. 574-576, 1982.
15. C.S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electronic Computers, vol. 13, pp. 14-17, Feb. 1964.
16. a + 1 Multiplier," Proc. IEEE Int'l Conf. Computer Design: VLSI in Computers and Processors, pp. 614-617, 1993.