Vector coding algorithms for multidimensional discrete Fourier transform
From MaRDI portal
Publication:2475397
DOI10.1016/j.cam.2006.11.025zbMath1152.65124MaRDI QIDQ2475397
Publication date: 11 March 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2006.11.025
fast Fourier transform; Cooley-Tukey algorithm; butterfly operation; row-column algorithm; vector coding
65T50: Numerical methods for discrete and fast Fourier transforms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast Fourier transforms: A tutorial review and a state of the art
- Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
- Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform
- Effective implementations of multi-dimensional radix-2 FFT
- A new radix-6 FFT algorithm
- In-place butterfly-style FFT of 2-D real sequences
- Fast computation of discrete Fourier transforms using polynomial transforms
- Split vector-radix fast Fourier transform
- On Computing the Discrete Fourier Transform
- Vector computation of the discrete Fourier transform
- An Algorithm for the Machine Calculation of Complex Fourier Series