메뉴 건너뛰기




Volumn 26, Issue 1, 1978, Pages 56-63

z-Transform DFT Filters and F FT's

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER ANALYSIS; DIGITAL FILTERING; FOURIER TRANSFORMATION;

EID: 0017905027     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1978.1163036     Document Type: Article
Times cited : (80)

References (7)
  • 1
    • 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,” Math. Comput., vol. 19, pp. 297–301, 1965.
    • (1965) Math. Comput. , vol.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 2
    • 84938158655 scopus 로고
    • What is the fast Fourier transform?
    • June
    • W. T. Cochran et al., “What is the fast Fourier transform?” IEEE Trans. Audio Electroacoust., vol. AU-15, pp. 45–55, June 1967.
    • (1967) IEEE Trans. Audio Electroacoust. , vol.AU-15 , pp. 45-55
    • Cochran, W.T.1
  • 7
    • 0014810746 scopus 로고
    • The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms
    • J. W. Cooley, P. A. W. Lewis, and P. D. Welch, “The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms,” J. Sound Vib., vol. 12, no. 3, pp. 315–337, 1970.
    • (1970) J. Sound Vib. , vol.12 , Issue.3 , pp. 315-337
    • Cooley, J.W.1    Lewis, P.A.W.2    Welch, P.D.3


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