In 1968, C. Rader observed that for a prime number p, the p-point 1-dimensional FT could be computed by a (p— 1) x (p— 1) skew-circulant matrix action. S. Winograd and others greatly extended the range of Rader’s method to include the p R-point 1-dimensional FT and multidimensional generalizations .
KeywordsDiscrete Fourier Transform Finite Field Irreducible Polynomial Circulant Matrix Multiplicative Character
Unable to display preview. Download preview PDF.
- An, M. and Tolimieri, R. (1993), “Multiplicative Multidimensional Fourier transform Algorithms,” preprint, Aware, Inc.Google Scholar
- Auslander, L., Feig, E., and Winograd, S. (1983), “New Algorithms for the Multiplicative Discrete Fourier transform,” IEEE Trans. ASSP ASSP-31(2).Google Scholar
- Ireland and Rosen (1980), A Classical Introduction to Modern Number Theory, Springer-Verlag, New York.Google Scholar
- Vulis, M. (1989), “The Weighted Redundancy Transform,” IEEE Trans. ASSP ASSP-37(11).Google Scholar
- Winograd, S. (1980), “Arithmetic Complexity of Computations,” Presented at CBMS-NSF Regional Conf. Series in Appl. Math.Google Scholar