Cooley–Tukey FFT algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cooley–Tukey FFT algorithm" in English language version.

refsWebsite

Global rank English rank

13doi.org

2^nd place

6semanticscholar.org

11^th place

8^th place

6psu.edu

207^th place

136^th place

3fftw.org

low place

2ieee.org

652^nd place

515^th place

2jstor.org

26^th place

20^th place

2harvard.edu

18^th place

17^th place

1hathitrust.org

441^st place

311^th place

1ucdavis.edu

1,873^rd place

1,347^th place

1dartmouth.edu

2,242^nd place

1,513^th place

1web.archive.org

1^st place

1colorado.edu

2,526^th place

1,796^th place

1cnx.org

5,966^th place

4,179^th place

1archive.org

6^th place

archive.org

Swarztrauber, P. N. (1982). "Vectorizing the FFTs". In Rodrigue, G. (ed.). Parallel Computations. New York: Academic Press. pp. 51–83. ISBN 978-0-12-592101-5.

cnx.org

S. G. Johnson and M. Frigo, "Implementing FFTs in practice," in Fast Fourier Transforms (C. S. Burrus, ed.), ch. 11, Rice University, Houston TX: Connexions, September 2008.

colorado.edu

amath.colorado.edu

Rockmore, Daniel N., Comput. Sci. Eng. 2 (1), 60 (2000). The FFT — an algorithm the whole family can use Special issue on "top ten algorithms of the century "Barry A. Cipra. "The Best of the 20th Century: Editors Name Top 10 Algorithms" (PDF). SIAM News. 33 (4). Archived from the original (PDF) on 2009-04-07. Retrieved 2009-03-31.

dartmouth.edu

cs.dartmouth.edu

Rockmore, Daniel N., Comput. Sci. Eng. 2 (1), 60 (2000). The FFT — an algorithm the whole family can use Special issue on "top ten algorithms of the century "Barry A. Cipra. "The Best of the 20th Century: Editors Name Top 10 Algorithms" (PDF). SIAM News. 33 (4). Archived from the original (PDF) on 2009-04-07. Retrieved 2009-03-31.

doi.org

Cooley, James W.; Tukey, John W. (1965). "An algorithm for the machine calculation of complex Fourier series". Math. Comput. 19 (90): 297–301. doi:10.2307/2003354. JSTOR 2003354.
Cooley, James W.; Lewis, Peter A. W.; Welch, Peter D. (1967). "Historical notes on the fast Fourier transform" (PDF). IEEE Transactions on Audio and Electroacoustics. 15 (2): 76–79. CiteSeerX 10.1.1.467.7209. doi:10.1109/tau.1967.1161903.
Singleton, Richard C. (1967). "On computing the fast Fourier transform". Commun. ACM. 10 (10): 647–654. doi:10.1145/363717.363771. S2CID 6287781.
Frigo, M.; Johnson, S. G. (2005). "The Design and Implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.
Karp, Alan H. (1996). "Bit reversal on uniprocessors". SIAM Review. 38 (1): 1–26. CiteSeerX 10.1.1.24.2913. doi:10.1137/1038001. JSTOR 2132972.
Carter, Larry; Gatlin, Kang Su (1998). "Towards an optimal bit-reversal permutation program". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). pp. 544–553. CiteSeerX 10.1.1.46.9319. doi:10.1109/SFCS.1998.743505. ISBN 978-0-8186-9172-0. S2CID 14307262.
Rubio, M.; Gómez, P.; Drouiche, K. (2002). "A new superfast bit reversal algorithm". International Journal of Adaptive Control and Signal Processing. 16 (10): 703–707. doi:10.1002/acs.718. S2CID 62201722.
Pease, M. C. (1968). "An adaptation of the fast Fourier transform for parallel processing". J. ACM. 15 (2): 252–264. doi:10.1145/321450.321457. S2CID 14610645.
Temperton, C. (1991). "Self-sorting in-place fast Fourier transform". SIAM Journal on Scientific and Statistical Computing. 12 (4): 808–823. doi:10.1137/0912043.
Qian, Z.; Lu, C.; An, M.; Tolimieri, R. (1994). "Self-sorting in-place FFT algorithm with minimum working space". IEEE Trans. ASSP. 52 (10): 2835–2836. Bibcode:1994ITSP...42.2835Q. doi:10.1109/78.324749.
Hegland, M. (1994). "A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing". Numerische Mathematik. 68 (4): 507–547. CiteSeerX 10.1.1.54.5659. doi:10.1007/s002110050074. S2CID 121258187.

dx.doi.org

Originally attributed to Stockham in W. T. Cochran et al., What is the fast Fourier transform?, Proc. IEEE vol. 55, 1664–1674 (1967).
P. N. Swarztrauber, FFT algorithms for vector computers, Parallel Computing vol. 1, 45–63 (1984).

fftw.org

Johnson, S. G., and M. Frigo, "A modified split-radix FFT with fewer arithmetic operations," IEEE Trans. Signal Process. 55 (1), 111–119 (2007).
Frigo, M.; Johnson, S. G. (2005). "The Design and Implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.
Frigo, Matteo; Johnson, Steven G. "FFTW". A free (GPL) C library for computing discrete Fourier transforms in one or more dimensions, of arbitrary size, using the Cooley–Tukey algorithm

harvard.edu

ui.adsabs.harvard.edu

Frigo, M.; Johnson, S. G. (2005). "The Design and Implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.
Qian, Z.; Lu, C.; An, M.; Tolimieri, R. (1994). "Self-sorting in-place FFT algorithm with minimum working space". IEEE Trans. ASSP. 52 (10): 2835–2836. Bibcode:1994ITSP...42.2835Q. doi:10.1109/78.324749.

hathitrust.org

babel.hathitrust.org

Gauss, Carl Friedrich (1866). "Theoria interpolationis methodo nova tractata" [Theory regarding a new method of interpolation]. Nachlass (Unpublished manuscript). Werke (in Latin and German). Vol. 3. Göttingen, Germany: Königlichen Gesellschaft der Wissenschaften zu Göttingen. pp. 265–303.

ieee.org

ieeexplore.ieee.org

Heideman, M. T., D. H. Johnson, and C. S. Burrus, "Gauss and the history of the fast Fourier transform," IEEE ASSP Magazine, 1, (4), 14–21 (1984)
M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 99), p.285-297. 1999. Extended abstract at IEEE, at Citeseer.

jstor.org

Cooley, James W.; Tukey, John W. (1965). "An algorithm for the machine calculation of complex Fourier series". Math. Comput. 19 (90): 297–301. doi:10.2307/2003354. JSTOR 2003354.
Karp, Alan H. (1996). "Bit reversal on uniprocessors". SIAM Review. 38 (1): 1–26. CiteSeerX 10.1.1.24.2913. doi:10.1137/1038001. JSTOR 2132972.

psu.edu

citeseerx.ist.psu.edu

Cooley, James W.; Lewis, Peter A. W.; Welch, Peter D. (1967). "Historical notes on the fast Fourier transform" (PDF). IEEE Transactions on Audio and Electroacoustics. 15 (2): 76–79. CiteSeerX 10.1.1.467.7209. doi:10.1109/tau.1967.1161903.
Frigo, M.; Johnson, S. G. (2005). "The Design and Implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.
Karp, Alan H. (1996). "Bit reversal on uniprocessors". SIAM Review. 38 (1): 1–26. CiteSeerX 10.1.1.24.2913. doi:10.1137/1038001. JSTOR 2132972.
Carter, Larry; Gatlin, Kang Su (1998). "Towards an optimal bit-reversal permutation program". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). pp. 544–553. CiteSeerX 10.1.1.46.9319. doi:10.1109/SFCS.1998.743505. ISBN 978-0-8186-9172-0. S2CID 14307262.
Hegland, M. (1994). "A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing". Numerische Mathematik. 68 (4): 507–547. CiteSeerX 10.1.1.54.5659. doi:10.1007/s002110050074. S2CID 121258187.

citeseer.ist.psu.edu

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 99), p.285-297. 1999. Extended abstract at IEEE, at Citeseer.

semanticscholar.org

api.semanticscholar.org

Singleton, Richard C. (1967). "On computing the fast Fourier transform". Commun. ACM. 10 (10): 647–654. doi:10.1145/363717.363771. S2CID 6287781.
Frigo, M.; Johnson, S. G. (2005). "The Design and Implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.
Carter, Larry; Gatlin, Kang Su (1998). "Towards an optimal bit-reversal permutation program". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). pp. 544–553. CiteSeerX 10.1.1.46.9319. doi:10.1109/SFCS.1998.743505. ISBN 978-0-8186-9172-0. S2CID 14307262.
Rubio, M.; Gómez, P.; Drouiche, K. (2002). "A new superfast bit reversal algorithm". International Journal of Adaptive Control and Signal Processing. 16 (10): 703–707. doi:10.1002/acs.718. S2CID 62201722.
Pease, M. C. (1968). "An adaptation of the fast Fourier transform for parallel processing". J. ACM. 15 (2): 252–264. doi:10.1145/321450.321457. S2CID 14610645.
Hegland, M. (1994). "A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing". Numerische Mathematik. 68 (4): 507–547. CiteSeerX 10.1.1.54.5659. doi:10.1007/s002110050074. S2CID 121258187.

ucdavis.edu

ece.ucdavis.edu

Cooley, James W.; Lewis, Peter A. W.; Welch, Peter D. (1967). "Historical notes on the fast Fourier transform" (PDF). IEEE Transactions on Audio and Electroacoustics. 15 (2): 76–79. CiteSeerX 10.1.1.467.7209. doi:10.1109/tau.1967.1161903.

web.archive.org

Rockmore, Daniel N., Comput. Sci. Eng. 2 (1), 60 (2000). The FFT — an algorithm the whole family can use Special issue on "top ten algorithms of the century "Barry A. Cipra. "The Best of the 20th Century: Editors Name Top 10 Algorithms" (PDF). SIAM News. 33 (4). Archived from the original (PDF) on 2009-04-07. Retrieved 2009-03-31.