FFT: Fast Fourier transform 1965年, James W. Cooley和 John W. Tukey在《计算数学》(《 Mathematics of Computation》)上发表了“一种用机器计算复序列傅 立叶级数的算法( An algorithm for the machine calculation of complex Fourier series)”论文。 自此之后,新的算法不断涌现。一种是对N等于2的整数次幂的算法 如基2算法,基4算法。另一种是N不等于2的整数次幂的算法,例如 Winagrad算法,素因子算法。 Calculation of B: Jena w Cadley and Joan W Tuley he as train untaa ata) M eagle a th prin=pal John W. Tukey A础计中h切 Dr James W. cooley Worked at IBM Watson Research Center in Yorktown Heights, (1915-2000) N.Y After his retirement from IBM x,1 in 1991, he joined the Electrica 出 Engineering Department at the University of Rhode islan 1965 年，James W. Cooley 和 John W. Tukey 在《计算数学》（《 Mathematics of Computation》）上发表了“ 一种用机器计算复序列傅 立叶级数的算法（An algorithm for the machine calculation of complex Fourier series）” 论文。  自此之后，新的算法不断涌现。一种是对N等于 2 的整数次幂的算法， 如基 2 算法，基 4 算法。另一种是N不等于 2 的整数次幂的算法，例如 Winagrad 算法，素因子算法。 FFT: Fast Fourier Transform Dr. James W. Cooley Worked at IBM Watson Research Center in Yorktown Heights, N.Y..After his retirement from IBM in 1991, he joined the Electrical Engineering Department at the University of Rhode Island. John W. Tukey (1915 – 2000)