Acta Photonica Sinica, Volume. 31, Issue 10, 1233(2002)

A NWE ALGORITHM FOR FAST FOURIER TANSFORM BASED ON FUNCTION MAPPING

[in Chinese]... [in Chinese], [in Chinese] and [in Chinese] |Show fewer author(s)
Author Affiliations
  • [in Chinese]
  • show less
    References(9)

    [1] [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] [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] [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] [4] Singerton P.C. An algorithm for computing the mixed radix fast Fourier transform,IEEE Trans, 1969,17(1):99~103

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

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

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

    [8] [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] [9] Duhamel P. Holtmann H. Split-radix FFT algorithm. Eletronics Letters. 1984,20(1):14~16

    Tools

    Get Citation

    Copy Citation Text

    [in Chinese], [in Chinese], [in Chinese], [in Chinese]. A NWE ALGORITHM FOR FAST FOURIER TANSFORM BASED ON FUNCTION MAPPING[J]. Acta Photonica Sinica, 2002, 31(10): 1233

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Jan. 11, 2002

    Accepted: --

    Published Online: Sep. 18, 2007

    The Author Email:

    DOI:

    Topics