Eigenvectors and functions of the discrete Fourier transform
Abstract
A method is presented for computing an orthonormal set of eigenvectors for the discrete Fourier transform (DFT). The technique is based on a detailed analysis of the eigenstructure of a special matrix which commutes with the DFT. It is also shown how fractional powers of the DFT can be efficiently computed, and possible applications to multiplexing and transform coding are suggested.
- Publication:
-
IEEE Transactions on Acoustics Speech and Signal Processing
- Pub Date:
- February 1982
- DOI:
- Bibcode:
- 1982ITASS..30...25D
- Keywords:
-
- Discrete Fourier transforms;
- Signal processing algorithms;
- Linear algebra;
- Matrices;
- Fast Fourier transforms;
- Harmonic analysis;
- Matrix decomposition;
- Eigenvalues and eigenfunctions;
- Transform coding;
- Concrete