Fast discrete transforms by means of eigenpolynomials
From MaRDI portal
Publication:1311982
DOI10.1016/0898-1221(93)90004-FzbMath0791.65109WikidataQ56158513 ScholiaQ56158513MaRDI QIDQ1311982
Publication date: 29 June 1994
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
fast algorithms; discrete Fourier transform; discrete cosine transform; discrete Hartley transform; discrete sine transform; eigenpolynomials
65T50: Numerical methods for discrete and fast Fourier transforms
Related Items
Cites Work
- Simple FFT and DCT algorithms with reduced number of operations.
- Spectral and computational properties of band symmetric Toeplitz matrices
- An observation on certain spectral properties of Toeplitz matrices
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
- Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
- The Fast Hartley Transform Algorithm
- Discrete Cosine Transform
- On a Matrix Algebra Related to the Discrete Hartley Transform
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item