A NWE ALGORITHM FOR FAST FOURIER TANSFORM BASED ON FUNCTION MAPPING

[in Chinese]; [in Chinese]; [in Chinese]; [in Chinese]

[1] Cooley J W, Tukey J W. An algorithm for the machine computation of complex Fourier series. Mathematics of Computation, 1965,19(4):297～301

[2] Gentleman W.M., Sande G. Fast Fourier transform for fun and profit. AFISP Proc. 1966 Fall Joint COmputer Conf.1966,29(6):563～578

[3] Morris L.R. High efficiency radix-4 fast fourier transform. IEEE Programs for Signal Processing4 Bergland G.D. A FFT algorithm using base 8 iterations. Math. comput, 1968,22(3):275～279

[4] Singerton P.C. An algorithm for computing the mixed radix fast Fourier transform,IEEE Trans, 1969,17(1):99～103

[5] Winograd S. On computing the discrete Fourier transfor.Proc Nat Acad Sci USA,1976,73(4):1005～1006

[6] Kolba D.P. Parks T.W. A prime factor FFT algorithm using high speed convolution.IEEE Trans, 1977,25(2):281～294

[7] Burrus C.S. Eschenbacher P.W. An in place, in order prime factor FFT algorithm.IEEE Trans, 1981,29(5):806～817

[8] Morris L.R. A comparative study of time efficient FFT and WFTA programs for general purpose computers.IEEE Trans, 1978,26(2):141～150

[9] Duhamel P. Holtmann H. Split-radix FFT algorithm. Eletronics Letters. 1984,20(1):14～16