Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
From MaRDI portal
Publication:4721618
DOI10.1109/TC.1987.1676943zbMath0614.65145OpenAlexW1910724553MaRDI QIDQ4721618
Allan J. Silberger, Alan Norton
Publication date: 1987
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1987.1676943
fast Fourier transformparallelismperformance analysisParallel algorithmsshared memoryMIMDCooley-Tukey FFT algorithm
Trigonometric interpolation (42A15) Parallel numerical computation (65Y05) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
Parallel algorithm for SWFFT using 3D data structure, An FFT performance model for optimizing general-purpose processor architecture, Parallel algorithms for some algebraic operations on polynomial equations