메뉴 건너뛰기




Volumn 35, Issue 8, 1987, Pages 1120-1125

An improved digit-reversal permutation algorithm for the fast fourier and hartley transforms

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TRANSFORMATIONS - FAST FOURIER TRANSFORMS;

EID: 0023402021     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1987.1165252     Document Type: Article
Times cited : (46)

References (12)
  • 2
    • 0021470264 scopus 로고
    • The fast Hartley transform
    • Aug
    • R. N. Bracewell, “The fast Hartley transform,” Proc. IEEE, vol. 72, pp. 1010–1018, Aug. 1984.
    • (1984) Proc. IEEE , vol.72 , pp. 1010-1018
    • Bracewell, R.N.1
  • 3
    • 0003774361 scopus 로고
    • ch. 10, 11, Englewood Cliffs, NJ: Prentice-Hall
    • E. O. Brigham, The Fast Fourier Transform. Englewood Cliffs, NJ: Prentice-Hall, 1974, ch. 10, 11, pp. 148–197.
    • (1974) The Fast Fourier Transform , pp. 148-197
    • Brigham, E.O.1
  • 4
    • 84939697128 scopus 로고    scopus 로고
    • Two Hartley transforms for the price of one FFT
    • submitted for publication to
    • O. Buneman, “Two Hartley transforms for the price of one FFT,” submitted for publication to SIAM. Sci. Stat. Comput.
    • SIAM. Sci. Stat. Comput.
    • Buneman, O.1
  • 6
    • 84911514314 scopus 로고
    • A high speed algorithm for the computer generation of Fourier transforms
    • Apr
    • H. C. Andrews, “A high speed algorithm for the computer generation of Fourier transforms,” IEEE Trans. Comput., vol. C-17, p. 373, Apr. 1968.
    • (1968) IEEE Trans. Comput. , vol.C-17 , pp. 373
    • Andrews, H.C.1
  • 12
    • 0003989121 scopus 로고
    • New York: Oxford University Press,
    • R. N. Bracewell, The Hartley Transform. New York: Oxford University Press, 1986, pp. 66–70.
    • (1986) The Hartley Transform , pp. 66-70
    • Bracewell, R.N.1


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