Efficient Two-Dimensional-FFT Program
1992
Program computes 64 X 64-point fast Fourier transform in less than 17 microseconds. Optimized 64 X 64 Point Two-Dimensional Fast Fourier Transform combines performance of real- and complex-valued one-dimensional fast Fourier transforms (FFT's) to execute two-dimensional FFT and coefficients of power spectrum. Coefficients used in many applications, including analyzing spectra, convolution, digital filtering, processing images, and compressing data. Source code written in C, 8086 Assembly, and Texas Instruments TMS320C30 Assembly languages.
Keywords:
- Discrete Fourier transform
- Constant Q transform
- Discrete Fourier transform (general)
- Prime-factor FFT algorithm
- Non-uniform discrete Fourier transform
- Fourier transform on finite groups
- Cyclotomic fast Fourier transform
- Split-radix FFT algorithm
- Computer science
- Theoretical computer science
- Discrete-time Fourier transform
- Algorithm
- Fast Fourier transform
- Fractional Fourier transform
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI