Content deleted Content added
Niceguyedc (talk | contribs) m v2.05 - Repaired 1 link to disambiguation page - (You can help) - DFT |
Adding short description: "High-performance algorithm" |
||
Line 1:
{{Short description|High-performance algorithm}}
[[File:Bailey 4-step FFT.svg|thumb|Bailey algorithm (4-step version) for a 16-point FFT]]
The '''Bailey's FFT''' (also known as a '''4-step FFT''') is a high-performance algorithm for computing the [[fast Fourier transform]] (FFT). This variation of the [[Cooley–Tukey FFT algorithm]] was originally designed for systems with hierarchical memory common in modern computers (and was the first FFT algorithm in this so called "out of core" class). The algorithm treats the samples as a two dimensional matrix (thus yet another name, a '''matrix FFT algorithm'''{{sfn|Arndt|2010|p=438}}) and executes short FFT operations on the columns and rows of the matrix, with a correction multiplication by "[[twiddle factor]]s" in between.{{sfn|Hart|Tornaría|Watkins|2010|p=191}}
| |||