A parallel 1-D FFT algorithm for the Hitachi SR8000

DOI10.1016/S0167-8191(03)00039-5zbMath1243.65168MaRDI QIDQ436195

Daisuke A. Takahashi

Publication date: 30 July 2012

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformall-to-all communicationcyclic distributiondistributed-memory parallel computervector symmetric multiprocessor

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Related Items (1)

Five-step FFT algorithm with reduced computational complexity

This page was built for publication: A parallel 1-D FFT algorithm for the Hitachi SR8000