Decomposition of Complex Multipliers Using Polynomial Encoding

  • Authors:
  • Alexander Skavantzos;Thanos Stouraitis

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1992

Quantified Score

Hi-index 14.98

Visualization

Abstract

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.