Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Bailey's FFT algorithm
open-in-new
<h2 id="see-also">See also</h2> <ul><li><a href="/facts/Row-column_FFT_algorithm/caT7UUCh">Row-column FFT algorithm</a></li> <li><a href="/facts/Vector-radix_FFT_algorithm/f7ax1T8n">Vector-radix FFT algorithm</a></li></ul> <h2 id="sources">Sources</h2> <ul><li>Bailey, D. H. (March 1989). <a href="https://www.davidhbailey.com/dhbpapers/fftq.pdf">"FFTS in external of hierarchical memory"</a> (PDF). <i>Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89</i>. Vol. 4. ACM Press. pp. 23–35. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1145%2F76263.76288">10.1145/76263.76288</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0897913418. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:52809390">52809390</a>.</li> <li>Frigo, M.; Johnson, S.G. (February 2005). "The Design and Implementation of FFTW3". <i>Proceedings of the IEEE</i>. 93 (2): 216–231. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/2005IEEEP..93..216F">2005IEEEP..93..216F</a>. <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.3097">10.1.1.66.3097</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1109%2FJPROC.2004.840301">10.1109/JPROC.2004.840301</a>. <a href="/facts/ISSN_(identifier)/DPAflDvU">ISSN</a> <a href="https://search.worldcat.org/issn/0018-9219">0018-9219</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:6644892">6644892</a>.</li> <li>Hart, William B.; Tornaría, Gonzalo; Watkins, Mark (2010). <a href="http://wrap.warwick.ac.uk/41654/1/WRAP_Hart_0584144-ma-270913-congruent.pdf">"Congruent Number Theta Coefficients to 1012"</a> (PDF). <i>Algorithmic Number Theory</i>. Lecture Notes in Computer Science. Vol. 6197. Springer Berlin Heidelberg. pp. 186–200. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2F978-3-642-14518-6_17">10.1007/978-3-642-14518-6_17</a>. <a href="/facts/EISSN_(identifier)/DPAflDvU">eISSN</a> <a href="https://search.worldcat.org/issn/1611-3349">1611-3349</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-642-14517-9. <a href="/facts/ISSN_(identifier)/DPAflDvU">ISSN</a> <a href="https://search.worldcat.org/issn/0302-9743">0302-9743</a>.</li> <li>Al Na'mneh, Rami; Pan, W. David (March 2007). "Five-step FFT algorithm with reduced computational complexity". <i>Information Processing Letters</i>. 101 (6): 262–267. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2Fj.ipl.2006.10.009">10.1016/j.ipl.2006.10.009</a>. <a href="/facts/ISSN_(identifier)/DPAflDvU">ISSN</a> <a href="https://search.worldcat.org/issn/0020-0190">0020-0190</a>.</li> <li>Arndt, Jörg (1 October 2010). <a href="https://books.google.com/books?id=HsRHS6u7e80C&pg=PA438">"The Matrix Fourier Algorithm (MFA)"</a>. <i>Matters Computational: Ideas, Algorithms, Source Code</i>. Springer Science & Business Media. pp. 438–439. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-642-14764-7. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/1005788763">1005788763</a>.</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Arndt 2010, p. 438. - Arndt, Jörg (1 October 2010). "The Matrix Fourier Algorithm (MFA)". Matters Computational: Ideas, Algorithms, Source Code. Springer Science & Business Media. pp. 438–439. ISBN 978-3-642-14764-7. OCLC 1005788763. <a href="https://books.google.com/books?id=HsRHS6u7e80C&pg=PA438" target="_blank">https://books.google.com/books?id=HsRHS6u7e80C&pg=PA438</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Hart, Tornaría & Watkins 2010, p. 191. - Hart, William B.; Tornaría, Gonzalo; Watkins, Mark (2010). "Congruent Number Theta Coefficients to 1012" (PDF). Algorithmic Number Theory. Lecture Notes in Computer Science. Vol. 6197. Springer Berlin Heidelberg. pp. 186–200. doi:10.1007/978-3-642-14518-6_17. eISSN 1611-3349. ISBN 978-3-642-14517-9. ISSN 0302-9743. <a href="http://wrap.warwick.ac.uk/41654/1/WRAP_Hart_0584144-ma-270913-congruent.pdf" target="_blank">http://wrap.warwick.ac.uk/41654/1/WRAP_Hart_0584144-ma-270913-congruent.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Gentleman, W.M.; Sande, G. (1966). "Fast Fourier Transforms—For Fun and Profit" (PDF). AFIPS Conference Proceedings Volume 29. Fall Joint Computer Conference, November 7-10, 1966. San Francisco, California. pp. 563–578. <a href="https://www.cis.rit.edu/class/simg716/FFT_Fun_Profit.pdf" target="_blank">https://www.cis.rit.edu/class/simg716/FFT_Fun_Profit.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Bailey 1989, p. 2. - Bailey, D. H. (March 1989). "FFTS in external of hierarchical memory" (PDF). Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89. Vol. 4. ACM Press. pp. 23–35. doi:10.1145/76263.76288. ISBN 0897913418. S2CID 52809390. <a href="https://www.davidhbailey.com/dhbpapers/fftq.pdf" target="_blank">https://www.davidhbailey.com/dhbpapers/fftq.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Frigo & Johnson 2005, p. 2. - Frigo, M.; Johnson, S.G. (February 2005). "The Design and Implementation of FFTW3". Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. ISSN 0018-9219. S2CID 6644892. <a href="https://ui.adsabs.harvard.edu/abs/2005IEEEP..93..216F" target="_blank">https://ui.adsabs.harvard.edu/abs/2005IEEEP..93..216F</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Hart, Tornaría & Watkins 2010, p. 191. - Hart, William B.; Tornaría, Gonzalo; Watkins, Mark (2010). "Congruent Number Theta Coefficients to 1012" (PDF). Algorithmic Number Theory. Lecture Notes in Computer Science. Vol. 6197. Springer Berlin Heidelberg. pp. 186–200. doi:10.1007/978-3-642-14518-6_17. eISSN 1611-3349. ISBN 978-3-642-14517-9. ISSN 0302-9743. <a href="http://wrap.warwick.ac.uk/41654/1/WRAP_Hart_0584144-ma-270913-congruent.pdf" target="_blank">http://wrap.warwick.ac.uk/41654/1/WRAP_Hart_0584144-ma-270913-congruent.pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Al Na'mneh & Pan 2007, pp. 191–192. - Al Na'mneh, Rami; Pan, W. David (March 2007). "Five-step FFT algorithm with reduced computational complexity". Information Processing Letters. 101 (6): 262–267. doi:10.1016/j.ipl.2006.10.009. ISSN 0020-0190. <a href="https://doi.org/10.1016%2Fj.ipl.2006.10.009" target="_blank">https://doi.org/10.1016%2Fj.ipl.2006.10.009</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Al Na'mneh & Pan 2007. - Al Na'mneh, Rami; Pan, W. David (March 2007). "Five-step FFT algorithm with reduced computational complexity". Information Processing Letters. 101 (6): 262–267. doi:10.1016/j.ipl.2006.10.009. ISSN 0020-0190. <a href="https://doi.org/10.1016%2Fj.ipl.2006.10.009" target="_blank">https://doi.org/10.1016%2Fj.ipl.2006.10.009</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> </ol>