Parallel FFT algorithms using radix 4 butterfly computation on an eight-neighbor processor array

DOI10.1016/0167-8191(94)00034-8zbMATH Open0875.68165OpenAlexW2038565554MaRDI QIDQ673846FDOQ673846

Authors: Kuninobu Tanno, Toshihiro Taketa, Susumu Horiguchi 

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0167-8191(94)00034-8

Recommendations

• scientific article; zbMATH DE number 991433
• scientific article; zbMATH DE number 3997125
• Parallel FFT algorithms for mimd computers
• FFT algorithms and their adaptation to parallel processing

zbMATH Keywords

Parallel algorithmSIMDFast Fourier transformMassively parallel computersProcessor array

Mathematics Subject Classification ID

Computer system organization (68M99)

Cited In (1)

• Scalable FFT processors and pipelined butterfly units

This page was built for publication: Parallel FFT algorithms using radix 4 butterfly computation on an eight-neighbor processor array

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673846)