메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 624-627

Some new parallel fast Fourier transform algorithms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER SIMULATION; DIGITAL SIGNAL PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; FAST FOURIER TRANSFORMS; IMAGE PROCESSING; MULTIPROCESSING SYSTEMS;

EID: 33745156806     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDCAT.2005.224     Document Type: Conference Paper
Times cited : (13)

References (10)
  • 3
    • 33745126193 scopus 로고    scopus 로고
    • Higher Education Press, Beijing, (In Chinese)
    • Chen Guoliang., "Parallel Algorithm Practice", Higher Education Press, Beijing, 2004 (In Chinese).
    • (2004) Parallel Algorithm Practice
    • Chen, G.1
  • 5
    • 84968470212 scopus 로고
    • An algorithm for the machine calculation of complex fourier series
    • Cooley, J. W., and Tukey, O. W., "An Algorithm for the Machine Calculation of Complex Fourier Series", Math. Comput. No. 19, 1965, pp.297-301.
    • (1965) Math. Comput. , Issue.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, O.W.2
  • 6
    • 0038147173 scopus 로고    scopus 로고
    • A parallel 1-D FFT algorithm for the Hitachi SR8000
    • Daisuke Takahashi, "A parallel 1-D FFT algorithm for the Hitachi SR8000", Parallel Computing, no.29, 2003, pp. 679-690.
    • (2003) Parallel Computing , Issue.29 , pp. 679-690
    • Takahashi, D.1
  • 8
    • 75449119790 scopus 로고    scopus 로고
    • Tsinghua University Press, Beijing, (In Chinese)
    • Len Jianhua, "Fourier Transform", Tsinghua University Press, Beijing, 2004, pp. 165-202 (In Chinese).
    • (2004) Fourier Transform , pp. 165-202
    • Len, J.1
  • 9
    • 0001249667 scopus 로고
    • Discrete fourier transforms when the number of data samples is prime
    • Rader,C.M., "Discrete Fourier transforms when the number of data samples is prime",Proc. IEEE,no.56,1968,pp.1107-1108.
    • (1968) Proc. IEEE , Issue.56 , pp. 1107-1108
    • Rader, C.M.1
  • 10
    • 0026204024 scopus 로고
    • On indexing the prime-factor fast fourier transform algorithm
    • S. C. Chan and K. L. Ho, "On indexing the prime-factor fast Fourier transform algorithm", IEEE Trans. Circuits and Systems 38 (8), 1991,pp.951-953.
    • (1991) IEEE Trans. Circuits and Systems , vol.38 , Issue.8 , pp. 951-953
    • Chan, S.C.1    Ho, K.L.2


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