Decomposition of Complex Multipliers Using Polynomial Encoding
暂无分享,去创建一个
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] Joseph Cavanagh,et al. Digital Computer Arithmetic , 1983 .
[2] Richard E. Blahut,et al. Fast Algorithms for Digital Signal Processing , 1985 .
[3] H. T. Kung. Why systolic architectures? , 1982, Computer.
[4] S. Kung,et al. VLSI Array processors , 1985, IEEE ASSP Magazine.
[5] Kai Hwang,et al. Computer arithmetic: Principles, architecture, and design , 1979 .
[6] Earl E. Swartzlander,et al. Computer Arithmetic , 1980 .