论文信息 - New polynomial transform algorithms for fast DFT computation

New polynomial transform algorithms for fast DFT computation

Polynomial transforms defined in rings of polynomials, have been introduced recently and shown to give efficient algorithms for the computation of two-dimensional convolutions. In this paper, we present two methods for computing discrete Fourier transforms (DFT) by polynomial transforms. We show that these techniques are particularly well adapted to multidimensional DFTs and yield algorithms that are, in many instances, more efficient than the fast Fourier transform (FFT) or the Winograd Fourier Transform (WFTA).

Henri J. Nussbaumer | Philippe Quandalle

[1] Henri J. Nussbaumer,et al. New algorithms for convolution and DFT based on polynomial transforms , 1978, ICASSP.

[2] Henri J. Nussbaumer,et al. Computation of Convolutions and Discrete Fourier Transforms by Polynomial Transforms , 1978, IBM J. Res. Dev..

[3] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .

[4] C. Rader,et al. A new principle for fast Fourier transformation , 1976 .

[5] H. Nussbaumer,et al. Fast computation of discrete Fourier transforms using polynomial transforms , 1979 .

[6] H. J. Nussbaumer,et al. Digital filtering using polynomial transforms , 1977 .

[7] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.