Bluestein's FFT for arbitrary \(N\) on the hypercube
From MaRDI portal
Publication:1179208
DOI10.1016/S0167-8191(05)80051-1zbMath0739.65117MaRDI 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
fast Fourier transform; discrete Fourier transform; cyclic convolution; algorithm on hypercube architecture
65T50: Numerical methods for discrete and fast Fourier transforms
65Y10: Numerical algorithms for specific classes of architectures