Pioneers in Computer Science
Pioneers in CS
Back
James Cooley
Cold Warsignal processing

James Cooley

James William Cooley was an American mathematician

1926 – 2016U.S.AContribution: 1965

Introduction

James Cooley (born 1926) is an American mathematician and computer scientist. He is known for his co-development of the Cooley-Tukey FFT algorithm, a fast algorithm for computing the discrete Fourier transform. Cooley's work in signal processing and algorithm design has had a significant impact on various fields, including telecommunications and image processing.

Key Achievement

With John W. Tukey, Known for co-developing the Fast Fourier Transform (FFT) algorithm. His work revolutionized signal processing by enabling efficient computation of the Discrete Fourier Transform (DFT), impacting a wide range of applications in fields like audio, image processing, and telecommunications.

Biography

James William Cooley was an American mathematician. Cooley received a B.A. degree in 1949 from Manhattan College, Bronx, NY, an M.A. degree in 1951 from Columbia University, New York, NY, and a Ph.D. degree in 1961 in applied mathematics from Columbia University. He was a programmer on John von Neumann's computer at the Institute for Advanced Study, Princeton, NJ, from 1953 to 1956, where he notably programmed the Blackman–Tukey transformation.

Did You Know?

  • degree in 1951 from Columbia University, New York, NY, and a Ph.D.
  • degree in 1961 in applied mathematics from Columbia University.
  • He was a programmer on John von Neumann's computer at the Institute for Advanced Study, Princeton, NJ, from 1953 to 1956, where he notably programmed the Blackman–Tukey transformation.

Awards

IEEE Fellow

Institutions

IBM

New York University

University of Rhode Island

Education

Fu Foundation School of Engineering and Applied Science

Manhattan University

Columbia University