A Fast Fourier Transform Algorithm Using Base 8 Iterations
From MaRDI portal
Publication:5551900
DOI10.2307/2004656zbMath0165.51504MaRDI QIDQ5551900
Publication date: 1968
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2004656
Related Items
Computing the Fast Fourier Transform on a Vector Computer, A fast Poisson solver for realistic semiconductor device structures, A note on prime factor FFT algorithms, Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP, Fast Fourier transformation based on number theoretic transforms, Fast Fourier transforms with recursively generated trigonometric functions, Fast algorithms for the conjugate periodic function, HYDRO\(_ -\)GEN: A spatially distributed random field generator for correlated properties