Cooley and Tukey: fast discrete Fourier computation

What changed

Reorganized discrete Fourier computation through factorization of the transform length, reducing operation counts for the factorizable lengths treated and describing machine implementation.

Scientific scope

The 1965 factorized fast discrete-Fourier computation method under its stated length conditions.

Evidence

Original sources and institutional historical accounts support the stated contribution. The reading boundary is recorded at each source; this assessment is not an independent scientific verification.

Contributors

• James W. Cooley · SCIENCE: Named source contributor to this scoped work; individual labor shares are not measured.
• John W. Tukey · SCIENCE: Named source contributor to this scoped work; individual labor shares are not measured.

• Cooley and Tukey, An Algorithm for the Machine Calculation of Complex Fourier Series, Mathematics of Computation 19, 297–301 (1965)

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction