1Cooley J W, Tukey J W. An algorithm for the machine calculation ot complex Fourier series[J]. Math, comput, 1965, 19 ( 90 ) : 297-301.
2E. N. Linzer, E. Feig. IEEE Trans Signal Processing, 1993, 41 ( 1 ) : 93—107.
3Linzer E N,Feig E. Implementation of efficient FFT algorithms on fused multiply—add architectures[J], Signal Processing, IEEE Transactions on, 1993, 41 { 1 ) : 93.
4Lu C, Cooley J W,Toliniieri R. FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000|J]. Signal Processing, IEEE Transactions on, 1993, 41 ( 2 ) : 638—648.
5U. Meyer-Base, H. Natarajan , E. Castillo, et al. Fasterthan the FFT : The chirp—z RAG-n discrete fast Fourier transform. Frequency,2006, 60 ( 7—8 ) : 147—151.
