메뉴 건너뛰기




Volumn 79, Issue 3, 1999, Pages 251-259

Real-time implementation of the moving FFT algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DIGITAL ARITHMETIC; FAST FOURIER TRANSFORMS; REAL TIME SYSTEMS; SYNCHRONIZATION;

EID: 0033354378     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(99)00098-5     Document Type: Article
Times cited : (16)

References (17)
  • 1
    • 0023669897 scopus 로고
    • A new approach to recursive Fourier transform
    • November
    • M.G. Amin, A new approach to recursive Fourier transform, Proc. IEEE 75 (11) (November 1987) 1537-1538.
    • (1987) Proc. IEEE , vol.75 , Issue.11 , pp. 1537-1538
    • Amin, M.G.1
  • 2
    • 0025233182 scopus 로고
    • Recursive moving window DFT algorithm
    • January
    • J.L. Aravena, Recursive moving window DFT algorithm, IEEE Trans. Comput. 39 (1) (January 1990) 145-148.
    • (1990) IEEE Trans. Comput. , vol.39 , Issue.1 , pp. 145-148
    • Aravena, J.L.1
  • 3
    • 0017052750 scopus 로고
    • Procedures for computing the discrete Fourier transform on staggered blocks
    • April
    • G. Bongiovanni, P. Corsini, G. Frosini, Procedures for computing the discrete Fourier transform on staggered blocks, IEEE Trans. Acoust. Speech Signal Process. ASSP-24 (2) (April 1976) 132-137.
    • (1976) IEEE Trans. Acoust. Speech Signal Process. , vol.ASSP-24 , Issue.2 , pp. 132-137
    • Bongiovanni, G.1    Corsini, P.2    Frosini, G.3
  • 4
    • 0027629544 scopus 로고
    • An efficient recursive algorithm for time-varying Fourier transform
    • July
    • W. Chen, N. Kehtamavaz, T. W. Spencer, An efficient recursive algorithm for time-varying Fourier transform, IEEE Trans. Signal Process. 41 (7) (July 1993) 2488-2490.
    • (1993) IEEE Trans. Signal Process. , vol.41 , Issue.7 , pp. 2488-2490
    • Chen, W.1    Kehtamavaz, N.2    Spencer, T.W.3
  • 5
    • 84968470212 scopus 로고
    • An algorithm for machine computation of complex Fourier series
    • April
    • J.W. Cooley, J.W. Tukey, An algorithm for machine computation of complex Fourier series, Math. Comput. 19 (April 1965) 297-301.
    • (1965) Math. Comput. , vol.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 6
    • 0022700957 scopus 로고
    • Implementation of 'split-radix' FFT algorithms for complex real and real-symmetric data
    • April
    • P. Duhamel, Implementation of 'split-radix' FFT algorithms for complex real and real-symmetric data, IEEE Trans. Acoust. Speech Signal Process. ASSP-34 (April 1986) 285-295.
    • (1986) IEEE Trans. Acoust. Speech Signal Process. , vol.ASSP-34 , pp. 285-295
    • Duhamel, P.1
  • 7
    • 0021755317 scopus 로고
    • Split radix FFT algorithm
    • January
    • P. Duhamel, H. Hollmann, Split radix FFT algorithm, Electron. Lett. 20 (1) (January 1984) 14-16.
    • (1984) Electron. Lett. , vol.20 , Issue.1 , pp. 14-16
    • Duhamel, P.1    Hollmann, H.2
  • 8
    • 0019245117 scopus 로고
    • A continuous recursive DFT analyzer - The discrete coherent memory filter
    • December
    • B.G. Goldberg, A continuous recursive DFT analyzer - The discrete coherent memory filter, IEEE Trans. Acoust. Speech Signal Process. ASSP-28 (6) (December 1980) 760-762.
    • (1980) IEEE Trans. Acoust. Speech Signal Process. , vol.ASSP-28 , Issue.6 , pp. 760-762
    • Goldberg, B.G.1
  • 9
    • 0000735574 scopus 로고
    • Recursive, complex Fourier analysis for real-time applications
    • June
    • J.H. Halberstein, Recursive, complex Fourier analysis for real-time applications, Proc. IEEE (Lett.) 54 (June 1966) 903.
    • (1966) Proc. IEEE (Lett.) , vol.54 , pp. 903
    • Halberstein, J.H.1
  • 10
    • 0032300877 scopus 로고    scopus 로고
    • Real-time implementation of the split-radix FFT - An algorithm to efficiently construct local butterfly modules
    • P.-C. Lo, Y.-Y. Lee, Real-time implementation of the split-radix FFT - An algorithm to efficiently construct local butterfly modules, Signal Processing 71 (1998) 291-299.
    • (1998) Signal Processing , vol.71 , pp. 291-299
    • Lo, P.-C.1    Lee, Y.-Y.2
  • 13
  • 14
    • 0026857192 scopus 로고
    • A split-radix partial input/output fast Fourier transform algorithm
    • May
    • C. Roche, A split-radix partial input/output fast Fourier transform algorithm, IEEE Trans. Signal Process. 40 (5) (May 1992) 1273-1276.
    • (1992) IEEE Trans. Signal Process. , vol.40 , Issue.5 , pp. 1273-1276
    • Roche, C.1
  • 15
    • 0026900953 scopus 로고
    • Moving discrete Fourier transform
    • August
    • B.G. Sherlock, D.M. Manro, Moving discrete Fourier transform, IEE Proc.-F 139 (4) (August 1992) 279-282.
    • (1992) IEE Proc.-F , vol.139 , Issue.4 , pp. 279-282
    • Sherlock, B.G.1    Manro, D.M.2
  • 16
    • 0027554491 scopus 로고
    • Efficient computation of the DFT with only a subset of input or output points
    • March
    • H.V. Sorensen, C.S. Burrus, Efficient computation of the DFT with only a subset of input or output points, IEEE Trans. Signal Process. 41 (3) (March 1993) 1184-1200.
    • (1993) IEEE Trans. Signal Process. , vol.41 , Issue.3 , pp. 1184-1200
    • Sorensen, H.V.1    Burrus, C.S.2
  • 17
    • 0020750625 scopus 로고
    • Recursion in short-time signal analysis
    • M. Unser, Recursion in short-time signal analysis, Signal Processing 5 (1983) 229-240.
    • (1983) Signal Processing , vol.5 , pp. 229-240
    • Unser, M.1


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