Content deleted Content added
Citation bot (talk | contribs) Alter: pages. Add: chapter-url, volume, s2cid, isbn. Formatted dashes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox3 | #UCB_webform_linked 203/2306 |
→References: see also |
||
Line 15:
The Bailey FFT is typically used for computing [[Discrete Fourier transform|DFTs]] of large datasets, such as those used in scientific and engineering applications. The Bailey FFT is a very efficient algorithm, and it has been used to compute FFTs of datasets with billions of elements (when applied to the [[number-theoretic transform]], the datasets of the order of 10<sup>12</sup> elements were processed in mid-2000s{{sfn|Al Na'mneh|Pan|2007}}).
== See also ==
* [[Row-column FFT algorithm]]
* [[Vector-radix FFT algorithm]]
==References==
| |||