A parallel FFT algorithm for transputer networks
From MaRDI portal
Publication:1180606
DOI10.1016/S0167-8191(05)80073-0zbMath0752.65097OpenAlexW1984662206MaRDI QIDQ1180606
Publication date: 27 June 1992
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80073-0
performancefast Fourier transformparallel algorithmsMIMD machinestree topologycubic topologyOccam languagetransputer networks
Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (1)
This page was built for publication: A parallel FFT algorithm for transputer networks