메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1087-1093

Parallel FFT algorithms on network-on-chips

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK-ON-CHIPS; PARALLEL COMPUTATION;

EID: 44049099060     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2008.55     Document Type: Conference Paper
Times cited : (43)

References (15)
  • 1
    • 44049097342 scopus 로고    scopus 로고
    • FFT benchmark results
    • FFT benchmark results. http://www.fftw.org/speed.
  • 5
    • 34548126965 scopus 로고    scopus 로고
    • J. H. Bahn, S. E. Lee, and N. Bagherzadeh. On design and analysis of a feasible network-on-chip (NoC) architecture. In ITNG '07, pages 1033-1038, Washington, DC, USA, 2007. IEEE Computer Society.
    • J. H. Bahn, S. E. Lee, and N. Bagherzadeh. On design and analysis of a feasible network-on-chip (NoC) architecture. In ITNG '07, pages 1033-1038, Washington, DC, USA, 2007. IEEE Computer Society.
  • 6
    • 65349160003 scopus 로고
    • FFTs in external or hierarchical memory
    • D. H. Bailey. FFTs in external or hierarchical memory. In PPSC, pages 211-224, 1989.
    • (1989) PPSC , pp. 211-224
    • Bailey, D.H.1
  • 7
    • 44049100620 scopus 로고    scopus 로고
    • Improving data locality in parallel fast Fourier transform algorithm for pricing financial derivatives
    • S. Barua, R. K. Thulasiram, and P. Thulasiraman. Improving data locality in parallel fast Fourier transform algorithm for pricing financial derivatives, ipdps, 14:235a, 2004.
    • (2004) ipdps , vol.14
    • Barua, S.1    Thulasiram, R.K.2    Thulasiraman, P.3
  • 8
    • 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. Mathematical Computation, 19:297-301, 1965.
    • (1965) Mathematical Computation , vol.19 , pp. 297-301
    • Cooley, J.W.1    Tukey, J.W.2
  • 9
    • 33745156806 scopus 로고    scopus 로고
    • Z. Cui-xiang, H. Guo-qiang, and H. Ming-he. Some new parallel fast Fourier transform algorithms. In PDCAT '05, pages 624-628, Washington, DC, USA, 2005. IEEE Computer Society.
    • Z. Cui-xiang, H. Guo-qiang, and H. Ming-he. Some new parallel fast Fourier transform algorithms. In PDCAT '05, pages 624-628, Washington, DC, USA, 2005. IEEE Computer Society.
  • 10
    • 0023379643 scopus 로고
    • Performance analysis of the FFT algorithm on a shared-memory parallel architecture
    • Z. Cvetanovic. Performance analysis of the FFT algorithm on a shared-memory parallel architecture. IBM Journal of Research and Development, 31(4):435-451, 1987.
    • (1987) IBM Journal of Research and Development , vol.31 , Issue.4 , pp. 435-451
    • Cvetanovic, Z.1
  • 12
    • 44049096945 scopus 로고    scopus 로고
    • Parallel FFT computation with a CDMA-based network-on-chip
    • D. Kim, M. Kim, and G. E. Sobelman. Parallel FFT computation with a CDMA-based network-on-chip. In ISCAS (2), pages 1138-1141, 2005.
    • (2005) ISCAS , vol.2 , pp. 1138-1141
    • Kim, D.1    Kim, M.2    Sobelman, G.E.3
  • 14
    • 0023347849 scopus 로고
    • Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures
    • A. Norton and A. J. Silberger. Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architectures. IEEE Trans. Comput., 36(5):581-591, 1987.
    • (1987) IEEE Trans. Comput , vol.36 , Issue.5 , pp. 581-591
    • Norton, A.1    Silberger, A.J.2
  • 15
    • 0021470572 scopus 로고
    • FFT algorithms for vector computers
    • P. N. Swarztrauber. FFT algorithms for vector computers. Parallel Comput., 1:45-63, 1984.
    • (1984) Parallel Comput , vol.1 , pp. 45-63
    • Swarztrauber, P.N.1


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