메뉴 건너뛰기




Volumn 7, Issue 2, 2005, Pages 80-88

The fast Fourier transform for experimentalists, part I: Concepts

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE FAST FOURIER TRANSFORMS (IFFT); NYQUIST FREQUENCY; SINE FUNCTION; ZERO PADDING;

EID: 17044388559     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCSE.2005.42     Document Type: Review
Times cited : (29)

References (13)
  • 12
    • 84968470212 scopus 로고
    • An algorithm for the machine calculation of complex Fourier series
    • J.W. Cooley and J.W. Tukey, "An Algorithm for the Machine Calculation of Complex Fourier Series," Mathematics of Computation, vol. 19, no. 90, 1965, pp. 297-301.
    • (1965) Mathematics of Computation , vol.19 , Issue.90 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 13
    • 0347107240 scopus 로고    scopus 로고
    • The FFT: An algorithm the whole family can use
    • D.N. Rockmore, "The FFT: An Algorithm the Whole Family Can Use," Computing in Science & Eng., vol. 2, no. 1, 2000, pp. 60-64.
    • (2000) Computing in Science & Eng. , vol.2 , Issue.1 , pp. 60-64
    • Rockmore, D.N.1


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