Prime Blocklength Discrete Fourier Transforms Tising the Polynomial Residue Number System
G.S. Zelniker, Fred J. Taylor · 2005
The Rader prime algorithm is a well known technique for converting the discrete Fourier transform (DFT) into a cyclic convolution. A method for performing DFTs by using the polynomial residue number system to implement the %der algorithm is presented. Additionally, a finite computational structure in which to perform polynomial operations with complex coefficients is introduced. This structure allows polynomials with complex coefficients to be multiplied with minimal multiplicative complexity. It will be shown that the techniques presented are easily realizable in VLSI.