Category:FFT algorithms
This category is being considered for speedy renaming to Category:Fast Fourier transforms in accordance with Wikipedia's category discussion policy. Any pages in this category will be recategorized (not deleted).
If you disagree with its speedy renaming, please explain at this category's entry on the speedy section of the Categories for discussion page.
Do not use the "Move" tab to move this category page while the discussion is in progress! Categories are processed following the 48-hour discussion period and their contents are moved by a bot.
Please do not empty the category or remove this notice while the discussion is in progress.
Add entry * [[:Category:FFT algorithms]] to [[:Category:Fast Fourier transforms]] – Reason ~~~~
This category is for fast Fourier transform (FFT) algorithms, i.e. algorithms to compute the discrete Fourier transform (DFT) in O(N log N) time (or better, for approximate algorithms), where is the number of discrete points.
Pages in category "FFT algorithms"
The following 17 pages are in this category, out of 17 total. This list may not reflect recent changes.