What people are saying - Write a review
We haven't found any reviews in the usual places.
The Discrete Fourier Transform and Circular Convolution
Properties of the Cyclotomic Polynomials
Introduction to Reprinted Papers
2 other sections not shown
Agarwal and Burrus algorithm for computing applications array calculation Chinese Remainder Theorem circular convolution coefficients Complex Mersenne Transforms complex numbers consider convolution algorithms convolved cyclotomic polynomials defined DFT's digital filtering digital signal processing dimension dimensional diminished-1 Discrete Fourier Transform divisor efficient equations example factor FFT algorithm fast Fourier transform Fermat number transform finite field FNT's formula GF(p hardware highly composite IEEE Trans input integers modulo inverse transform linear mapping matrix Mersenne prime method minimum number mod F modulo modulo F multi multidimensional multiplica mutually prime number of additions number of multiplications number theory obtain one-dimensional operations paper permutation polynomials post-weave prime factor FFT primitive root problem rectangular transform reduced representation residue reduction result ring of integers root of unity Section sequence subroutine subtraction Table techniques tion transform length values vector volution WFTA Winograd word length zero