Revision as of 01:45, 24 March 2023 edit Dimawik (talk \| contribs) Extended confirmed users 2,445 edits edited Tag: Disambiguation links added ← Previous edit		Revision as of 01:47, 24 March 2023 edit undo Dimawik (talk \| contribs) Extended confirmed users 2,445 edits m formatting Next edit →
Line 1: ~~{{in use}}~~ [[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. It is designed for systems with hierarchical memory common in modern computers. The Bailey FFT uses a number of techniques to improve the performance:

Bailey's FFT algorithm: Difference between revisions