메뉴 건너뛰기




Volumn 2400, Issue , 2002, Pages 691-700

A blocking algorithm for parallel 1-D FFT on clusters of PCs

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; FAST FOURIER TRANSFORMS; MICROCOMPUTERS;

EID: 84872895246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45706-2_96     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
  • 4
    • 21844493537 scopus 로고
    • A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
    • Hegland, M.: A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing. Numerische Mathematik 68 (1994) 507–547
    • (1994) Numerische Mathematik , vol.68 , pp. 507-547
    • Hegland, M.1
  • 5
  • 7
    • 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
  • 11
    • 0021470572 scopus 로고
    • FFT algorithms for vector computers
    • Swarztrauber, P.N.: FFT algorithms for vector computers. Parallel Computing 1 (1984) 45–63
    • (1984) Parallel Computing , vol.1 , pp. 45-63
    • Swarztrauber, P.N.1
  • 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가 분석하여 추출한 것입니다.