메뉴 건너뛰기




Volumn 2367, Issue , 2002, Pages 380-389

A blocking algorithm for parallel 1-D FFT on shared-memory parallel computers

Author keywords

[No Author keywords available]

Indexed keywords

FAST FOURIER TRANSFORMS; MEMORY ARCHITECTURE; ONE DIMENSIONAL; PROGRAM PROCESSORS;

EID: 84945901304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48051-x_38     Document Type: Conference Paper
Times cited : (7)

References (14)
  • 1
    • 84968470212 scopus 로고
    • An algorithm for the machine calculation of complex Fourier series
    • Cooley, J. W., Tukey, J. W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19 (1965) 297-301.
    • (1965) Math. Comput , vol.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 3
    • 0025403252 scopus 로고
    • FFTs in external or hierarchical memory
    • Bailey, D. H.: FFTs in external or hierarchical memory. The Journal of Supercomputing 4 (1990) 23-35.
    • (1990) The Journal of Supercomputing , vol.4 , pp. 23-35
    • Bailey, D.H.1
  • 5
    • 0029180039 scopus 로고
    • High-performance FFT algorithms for the Convex C4/XA supercomputer
    • Wadleigh, K. R., Gostin, G. B., Liu, J.: High-performance FFT algorithms for the Convex C4/XA supercomputer. The Journal of Supercomputing 9 (1995) 163-178.
    • (1995) The Journal of Supercomputing , vol.9 , pp. 163-178
    • Wadleigh, K.R.1    Gostin, G.B.2    Liu, J.3
  • 14
    • 0035341167 scopus 로고    scopus 로고
    • An extended split-radix FFT algorithm
    • Takahashi, D.: An extended split-radix FFT algorithm. IEEE Signal Processing Letters 8 (2001) 145-147.
    • (2001) IEEE Signal Processing Letters , vol.8 , pp. 145-147
    • Takahashi, D.1


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