A nesting algorithm for very fast discrete Fourier transforms

摘要

The use of a nesting discrete Fourier transform technique to compute discrete Fourier transform is proposed. This technique only relies on two primitive modules and other modules are generated by a standard nesting procedure. The speed of computation of this approach is comparable to the speed of computation of the WFTA, whereas the program size of the present approach is smaller than that of the WFTA. This approach is most suitable for cases where there are restrictions on memory size.