
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yutai Ma, "A Simplified Architecture for Modulo (2n + 1) Multiplication," IEEE Transactions on Computers, vol. 47, no. 3, pp. 333337, March, 1998.  
BibTex  x  
@article{ 10.1109/12.660169, author = {Yutai Ma}, title = {A Simplified Architecture for Modulo (2n + 1) Multiplication}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {3}, issn = {00189340}, year = {1998}, pages = {333337}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.660169}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Simplified Architecture for Modulo (2n + 1) Multiplication IS  3 SN  00189340 SP333 EP337 EPD  333337 A1  Yutai Ma, PY  1998 KW  Convolution KW  Fermat number transform KW  RNS arithmetic KW  modulo (2n + 1) multiplication KW  Booth's algorithm KW  Wallace tree KW  carry save adder KW  CSA array KW  carry lookahead adder. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—The modulo (2
[1] C. Fernstrom, I. Kruzela, and B. Svensson, LUCAS Associative Array Processor: Design, Programming and Application Studies, Lecture Notes in Computing Science, no. 216, SpringerVerlag, New York, 1986.
[2] W.D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
[3] A.D. Booth, "A Signed Binary Multiplication Technique," Quarterly J. Mechanical Applications of Math., vol. 4, pt. 2, pp. 236240, 1951.
[4] R.P. Brent and H.T. Kung, "A Regular Layout for Parallel Adders," IEEE Trans. Computers, vol. 31, no. 3, pp. 260264, 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,5991,602, Dec. 1985.
[6] A.V. Curiger, H. Bonnenberg, and H. Kaeslin, "Regular VLSI Architectures for Multiplication Modulo (2n+ 1)," IEEE J. SolidState Circuits, vol. 26, no. 7, pp. 990994, July 1991.
[7] C. Efstathiou, D. Nikolos, and J. Kalamatianos, AreaTime Efficient Modulo$2^n1$Adder Design IEEE Trans. Circuits and Systems II, vol. 41, no. 7, pp. 463467, 1994.
[8] L.M. Leibowitz, A Simplified Binary Arithmetic for the Fermat Number Transform IEEE Trans. Acoustics, Speech, Signal Processing, vol. 24, pp. 356359, 1976.
[9] T.F. Ngai, M.J. Irwin, S. Rawat, "Regular, AreaTime Efficient Carry Lookahead Adders," J. Parallel and Distributed Computing, vol. 3, no. 1, pp. 92105, Mar. 1986.
[10] D. Radhakrishnan and Y. Yuan, “Novel Approaches to the Design of VLSI RNS Multipliers,” IEEE Trans. Circuits and SystemsII: Analog and Digital Signal Processing, vol. 39, pp. 5257, Jan. 1992.
[11] F.J. Taylor, "A VLSI Residue Arithmetic Multiplier," IEEE Trans. Computers, vol. 31, no. 6, pp. 540546, June 1982.
[12] F. Taylor, A Single Modulus ALU for Signal Processing IEEE Trans. Acoustics, Speech, Signal Processing, vol. 33, pp. 13021315, 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. 5766, 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. 574576, 1982.
[15] C.S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electronic Computers, vol. 13, pp. 1417, Feb. 1964.
[16] A. Wrzyszcz and D. Milford, "A New Modulo 2a+ 1 Multiplier," Proc. IEEE Int'l Conf. Computer Design, pp. 614617,Cambridge, Mass., Oct.36, 1993.