摘要
Starting from an index mapping for one to multi-dimensions, a general in-placeand in-order prime factor FFT algorithm is proposed in this paper. In comparing with existingprime factor FFT algorithms, this algorithm saves about half of the required storage capacityand possesses a higher efficiency. In addition, this algorithm can easily implement the DFT andIDFT in a single subroutine,
Starting from an index mapping for one to multi-dimensions, a general in-place and in-order prime factor FFT algorithm is proposed in this paper. In comparing with existing prime factor FFT algorithms, this algorithm saves about half of the required storage capacity and possesses a higher efficiency. In addition, this algorithm can easily implement the DFT and IDFT in a single subroutine,
基金
Supported by the National Natural Science Foundation of China
