Fast fourier transforms: a tutorial review and a state of the art
Signal Processing
Fast Algorithms for Digital Signal Processing
Fast Algorithms for Digital Signal Processing
Fast Transforms: Algorithms, Analyses, Applications
Fast Transforms: Algorithms, Analyses, Applications
Orthogonal Transforms for Digital Signal Processing
Orthogonal Transforms for Digital Signal Processing
Method of flow graph simplification for the 16-point discrete Fourier transform
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
This paper analyzes the block structure of the matrix of the N-point discrete Fourier transform (DFT) in the real space R 2N . Each block of this matrix corresponds to the Givens transformation, or elementary rotation describing the multiplications by twiddle coefficients. Such rotations around the circle can be substituted by other kinds of rotations, for instance rotations around ellipses, while reserving the block-wise representation of the matrix and main properties of the DFT. To show that, we present two classes of the elliptic discrete Fourier transforms (EDFT), that are defined by different types of the Nth roots of the identity matrix 2脳2, whose groups of motion move points around different ellipses. These two classes (the N-block EDFT of types I and II) are parameterized and exist for any order N. Properties and examples of application of the proposed elliptic EDFTs in signal and image processing are given.