
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Skavantzos, P.B. Rao, "New Multipliers Modulo 2/sup N/1," IEEE Transactions on Computers, vol. 41, no. 8, pp. 957961, August, 1992.  
BibTex  x  
@article{ 10.1109/12.156538, author = {A. Skavantzos and P.B. Rao}, title = {New Multipliers Modulo 2/sup N/1}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {8}, issn = {00189340}, year = {1992}, pages = {957961}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.156538}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  New Multipliers Modulo 2/sup N/1 IS  8 SN  00189340 SP957 EP961 EPD  957961 A1  A. Skavantzos, A1  P.B. Rao, PY  1992 KW  multipliers; modulo 2/sup N/1; multiplication; cyclic convolution; additions; squaring; ROM bits; lookup tables; digital arithmetic; multiplying circuits. VL  41 JA  IEEE Transactions on Computers ER   
Techniques for computing the product of two Nbit integers modulo 2/sup N/1 from their kbit byte decompositions are presented. A modulus 2/sup N/1 is chosen, as multiplication performed in this modulus can be reconstructed from the cyclic convolution between the sequences of the kbit bytes of the decomposed numbers. It is shown that cyclic convolutions can be computed using only additions and squaring operations but not twooperand multiplications. Since the squaring operation is a oneoperand operation, significant savings in ROM bits can be obtained if lookup tables are used.
[1] A. V. Oppenheim and R. W. Schafer,Digital Signal Processing. Englewood Cliffs, NJ: PrenticeHall, 1975.
[2] F. J. Taylor, "Residue arithmetic: A tutorial with examples,"IEEE Comput. Mag., vol. 17, no. 5, pp. 5062, May 1984.
[3] M. A. Soderstrand, W. K. Jenkins, G. A. Jullien, and F. J. Taylor, Eds.,Modern Applications of Residue Number System Arithmetic to Digital Signal Processing. New York: IEEE Press, 1986.
[4] F. J. Taylor, "Large moduli multipliers for signal processing,"IEEE Trans. Circuits Syst., vol. CAS28, no. 7, pp. 731736, July 1981.
[5] K. Hwang,Computer Arithmetic. New York: Wiley, 1979.
[6] M. J. Flynn and S. Waser,Introduction to Arithmetic for Digital Systems Designers. CBS College Publishing, 1982, pp. 215222.
[7] A. Skavantzos, "The one over eight squared algorithm: A new way for computing convolutions and complex multiplications," inProc. Int. Symp. Circuits Syst.(ISCAS '90), New Orleans, LA, May 1990, pp. 6164.
[8] A. Skavantzos, "Novel approach for implementing convolutions with small tables,"IEE ProcE, vol. 138, no. 4, pp. 255259, July 1991.
[9] J.H. McClellan and C.M. Rader,Number Theory in Digital Signal Processing. Englewood Cliffs, NJ: PrenticeHall, 1975.
[10] M.A. Soderstrand and E.L. Fields, "Multipliers for residue number arithmetic digital filters,"Electron. Lett., vol. 13, no. 6, pp. 164166, Mar. 1977.
[11] M.A. Soderstrand and C. Vernia, "A Highspeed lowcost moduloPimultiplier with RNS arithmetic applications," inProc. IEEE, vol. 68, no. 4, pp. 529532, Apr. 1980.