메뉴 건너뛰기




Volumn 54, Issue 2, 1996, Pages 137-151

Split-radix generalized fast Fourier transform

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FAST FOURIER TRANSFORMS;

EID: 0030263705     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(96)00103-X     Document Type: Article
Times cited : (10)

References (11)
  • 1
    • 0017097212 scopus 로고
    • One-dimensional and two-dimensional generalized discrete Fourier transform
    • February
    • G. Bongiovanni, P. Corsini and G. Frosini, "One-dimensional and two-dimensional generalized discrete Fourier transform", IEEE Trans. Acoust. Speech Signal Process., Vol. ASSP-24, February 1974, pp. 97-99.
    • (1974) IEEE Trans. Acoust. Speech Signal Process. , vol.ASSP-24 , pp. 97-99
    • Bongiovanni, G.1    Corsini, P.2    Frosini, G.3
  • 2
    • 0016930873 scopus 로고
    • Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series
    • March
    • G. Bonnerot and M. Bellanger, "Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series", Proc. IEEE, Vol. 64, March 1976, pp. 392-393.
    • (1976) Proc. IEEE , vol.64 , pp. 392-393
    • Bonnerot, G.1    Bellanger, M.2
  • 4
    • 0021755317 scopus 로고
    • Split-radix FFT algorithm
    • P. Duhamel and H. Hollman, "Split-radix FFT algorithm", Electron Lett., Vol. 20, 1984, pp. 14-16.
    • (1984) Electron Lett. , vol.20 , pp. 14-16
    • Duhamel, P.1    Hollman, H.2
  • 5
    • 0022012304 scopus 로고
    • Semisystolic array implementation of circular, skew-circular, and linear convolutions
    • February
    • O.K. Ersoy, "Semisystolic array implementation of circular, skew-circular, and linear convolutions", IEEE Trans. Comput., Vol. 34, No. 2, February 1985, pp. 190-194.
    • (1985) IEEE Trans. Comput. , vol.34 , Issue.2 , pp. 190-194
    • Ersoy, O.K.1
  • 6
    • 30244441349 scopus 로고
    • Fast computation of real discrete Fourier transform for any number of data points
    • Portland, OR, May
    • N.C. Hu and O.K. Ersoy, "Fast computation of real discrete Fourier transform for any number of data points", IEEE ISCAS, Portland, OR, May 1989.
    • (1989) IEEE ISCAS
    • Hu, N.C.1    Ersoy, O.K.2
  • 8
    • 0015699024 scopus 로고
    • Design and simulation of a speech analysis-synthesis system based in short-time Fourier analysis
    • June
    • R.W. Schafer and L.R. Rabiner, "Design and simulation of a speech analysis-synthesis system based in short-time Fourier analysis", IEEE Trans. Audio Electroacoust., Vol. AU-21, No. 3, June 1973, pp. 165-174.
    • (1973) IEEE Trans. Audio Electroacoust. , vol.AU-21 , Issue.3 , pp. 165-174
    • Schafer, R.W.1    Rabiner, L.R.2
  • 9
    • 0027554491 scopus 로고
    • Efficient computation of the DFT with only a subset of input or output points
    • H.V. Sorensen and C.S. Burrus, "Efficient computation of the DFT with only a subset of input or output points". IEEE Trans. Signal Process., Vol. 41, No. 3, 1993, pp. 1184-1200.
    • (1993) IEEE Trans. Signal Process. , vol.41 , Issue.3 , pp. 1184-1200
    • Sorensen, H.V.1    Burrus, C.S.2
  • 11
    • 0015143967 scopus 로고
    • Real signals fast Fourier transform: Storage capacity and step number reduction by means of an odd discrete Fourier transform
    • October
    • J.L. Vernet, "Real signals fast Fourier transform: Storage capacity and step number reduction by means of an odd discrete Fourier transform", Proc. IEEE, Vol. 59, October 1971, pp. 1531-1532.
    • (1971) Proc. IEEE , vol.59 , pp. 1531-1532
    • Vernet, J.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.