This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Decomposition of Complex Multipliers Using Polynomial Encoding
October 1992 (vol. 41 no. 10)
pp. 1331-1333

A method for complex multiplication that relies on encoding 2n-bit complex numbers as polynomials of degree 7 in the ring of polynomials modulo x/sup 8/-1 with n/4-bit coefficients is introduced. Complex multiplication can then be performed with an 8-point cyclic convolution plus some conversion overhead and, with care, this can be done without introducing any errors. The technique is suitable for designs using systolic arrays.

[1] S.Y. Kung,VLSI Array Processors, Prentice Hall, Englewood Cliffs, N.J. 1988.
[2] H. T. Kung, "Why systolic architectures?"IEEE Comput. Mag., vol. 15, no. 1, pp. 37-46, Jan. 1982.
[3] K. Hwang,Computer Arithmetic: Principles, Architecture, and Design. New York: Wiley, 1979.
[4] M. J. Flynn and S. Waser,Introduction to Arithmetic for Digital Systems Designers. CBS College Publishing, 1982, pp. 215-222.
[5] R. E. Blahut,Fast Algorithms for Digital Signal Processing. Reading: MA: Addison-Wesley, 1985.
[6] K. Hwang,Computer Arithmetic, New York: Wiley, 1979, pp. 167-171.
[7] J. J. F. Cavanagh,Digital Computer Arithmetic Design and Implementation. New York: McGraw-Hill, 1984, pp. 117-122.

Index Terms:
complex multipliers decomposition; polynomial encoding; 8-point cyclic convolution; systolic arrays; digital arithmetic; encoding; systolic arrays.
Citation:
A. Skavantzos, T. Stouraitis, "Decomposition of Complex Multipliers Using Polynomial Encoding," IEEE Transactions on Computers, vol. 41, no. 10, pp. 1331-1333, Oct. 1992, doi:10.1109/12.166610
Usage of this product signifies your acceptance of the Terms of Use.