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

DOI10.1016/0167-8191(94)00034-8zbMath0875.68165OpenAlexW2038565554MaRDI QIDQ673846

Kuninobu Tanno, Susumu Horiguchi, Toshihiro Taketa

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

zbMATH Keywords

Parallel algorithmFast Fourier transformSIMDProcessor arrayMassively parallel computers

Mathematics Subject Classification ID

Computer system organization (68M99)

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