Bailey's FFT algorithm: Difference between revisions

Revision as of 14:49, 24 March 2023

Revision as of 04:33, 19 April 2023

Line 1:

[[File:Bailey 4-step FFT.svg|thumb|Bailey algorithm (4-step version) for a 16-point FFT]]

The '''Bailey FFT''' (also known as a '''4-step FFT''') is a high-performance algorithm for computing the [[fast Fourier transform]] (FFT) on vector supercomputers. This variation of the [[StockhamCooley–Tukey FFT algorithm]] is designed for systems with hierarchical memory common in modern computers. The Bailey FFT uses a number of techniques to improve the performance:

* [[Stride of an array|Unit stride]] for the underlying FFT processing is possible, long vector transfers between main memory and external storage