Bluestein's FFT for arbitrary \(N\) on the hypercube

DOI10.1016/S0167-8191(05)80051-1zbMath0739.65117OpenAlexW2004315237MaRDI QIDQ1179208

William L. Briggs, Roland A. Sweet, Van Emden Henson, Paul N. Swarztrauber, James S. Otto

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(05)80051-1

zbMATH Keywords

fast Fourier transformdiscrete Fourier transformcyclic convolutionalgorithm on hypercube architecture

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

This page was built for publication: Bluestein's FFT for arbitrary \(N\) on the hypercube