Name
Abstract | ||
|---|---|---|
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). |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1109/ICASSP.1979.1170654 | Acoustics, Speech, and Signal Processing, IEEE International Conference ICASSP '79. |
Keywords | Field | DocType |
discrete fourier transform,fast fourier transforms,fast fourier transform,algebra,arithmetic,multidimensional systems,fourier transforms,fourier transform,polynomials | Non-uniform discrete Fourier transform,Cyclotomic fast Fourier transform,Algebra,Prime-factor FFT algorithm,Computer science,Algorithm,Fast Fourier transform,Discrete Fourier transform (general),Discrete Fourier transform,Fractional Fourier transform,Discrete sine transform | Conference |
Volume | Citations | PageRank |
4 | 1 | 0.75 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. J. Nussbaumer | 1 | 38 | 33.38 |
| Philippe Quandalle | 2 | 1 | 0.75 |