메뉴 건너뛰기




Volumn 45, Issue 1, 1998, Pages 256-260

Efficient moving-window dft algorithms

Author keywords

Discrete fourier transform; Harmonic analysis, recursive digital filters; Spectral analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL FILTERS; FOURIER TRANSFORMS; HARMONIC ANALYSIS; RECURSIVE FUNCTIONS; SPECTRUM ANALYSIS;

EID: 0031999910     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/82.661667     Document Type: Article
Times cited : (57)

References (14)
  • 1
    • 0028393318 scopus 로고    scopus 로고
    • A comparative review of real and complex Fourier-related transforms,"
    • vol. 82, pp. 42947, Mar. 1994.
    • O. K. Ersoy A comparative review of real and complex Fourier-related transforms," Proc. IEEE, vol. 82, pp. 42947, Mar. 1994.
    • Proc. IEEE
    • Ersoy, O.K.1
  • 2
    • 84968470212 scopus 로고    scopus 로고
    • An algorithm for the machine calculation of complex Fourier series,"
    • vol. 19, pp. 297-301, 1965.
    • J. W. Cooley and J. W. Tukey An algorithm for the machine calculation of complex Fourier series," Math. Comput, vol. 19, pp. 297-301, 1965.
    • Math. Comput
    • Cooley, J.W.1    Tukey, J.W.2
  • 4
    • 0023364252 scopus 로고    scopus 로고
    • "Real-valued fast Fourier transform algorithms," IEEE Trans
    • 35, pp. 849-863, June 1987.
    • H. V. Sorensen et al., "Real-valued fast Fourier transform algorithms," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 849-863, June 1987.
    • Acoust., Speech, Signal Processing, Vol. ASSP
    • Sorensen, H.V.1
  • 5
    • 0021481259 scopus 로고    scopus 로고
    • Simple FFT and DCT algorithms with reduced number of operations,"
    • vol. 6, pp. 267-278, Aug. 1984.
    • M. Vetterli and H. J. Nussbaumer Simple FFT and DCT algorithms with reduced number of operations," Signal Processing, vol. 6, pp. 267-278, Aug. 1984.
    • Signal Processing
    • Vetterli, M.1    Nussbaumer, H.J.2
  • 6
    • 0026108404 scopus 로고    scopus 로고
    • An efficient FFT algorithm based on the discrete sine transform,"
    • vol. 39, pp. 48690, Feb. 1991.
    • A. Gupta and K. R. Rao An efficient FFT algorithm based on the discrete sine transform," IEEE Trans. Signal Processing, vol. 39, pp. 48690, Feb. 1991.
    • IEEE Trans. Signal Processing
    • Gupta, A.1    Rao, K.R.2
  • 9
    • 0025233182 scopus 로고    scopus 로고
    • Recursive moving window DFT algorithm,"
    • vol. 39, pp. 145-148, Jan. 1990.
    • J. L. Aravena Recursive moving window DFT algorithm," IEEE Trans. Comput., vol. 39, pp. 145-148, Jan. 1990.
    • IEEE Trans. Comput.
    • Aravena, J.L.1
  • 10
    • 33747766896 scopus 로고    scopus 로고
    • Recursive real-time calculation of basic waveforms of signals,"
    • vol. 138, pt. C, pp. 46970, Nov. 1991.
    • K.-Fr. Eichhorn and T. Lobos Recursive real-time calculation of basic waveforms of signals," Proc. Inst. Elect. Eng., vol. 138, pt. C, pp. 46970, Nov. 1991.
    • Proc. Inst. Elect. Eng.
    • Eichhorn, K.-F.1    Lobos, T.2
  • 11
    • 0026900953 scopus 로고    scopus 로고
    • Moving discrete Fourier transform,"
    • vol. 139, pt. F, pp. 279-282, Aug. 1992.
    • B. G. Sherlock and D. M. Monro Moving discrete Fourier transform," Proc. Inst. Elect. Eng., vol. 139, pt. F, pp. 279-282, Aug. 1992.
    • Proc. Inst. Elect. Eng.
    • Sherlock, B.G.1    Monro, D.M.2


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