Five-step FFT algorithm with reduced computational complexity |
| |
| Authors: | Rami Al Na'mneh W David Pan |
| |
| Affiliation: | Department of Electrical and Computer Engineering, University of Alabama in Huntsville, Huntsville, AL 35899, USA |
| |
| Abstract: | We propose a fast Fourier transform algorithm, which removes two steps of twiddle factor multiplications from the conventional five-step FFT algorithm. The proposed FFT algorithm not only reduces the computational complexity of the five-step FFT algorithm by O(n) operations, but also reduces its memory requirement. |
| |
| Keywords: | Five-step fast Fourier transform Computational complexity |
| 本文献已被 ScienceDirect 等数据库收录！ |
