FAST FOURIER TRANSFORM - A DETAILED EXPLANATION IS OFFERED OF AN ALGORITHM THAT REDUCES COMPUTER TIME AND ALLOWS ITS USER TO EMPLOY POWERFUL FREQUENCY TECHNIQUES ONCE CONDIDERED INEFFICIENT

被引：364

作者：

BRIGHAM, EO

MORROW, RE

机构：

来源：

关键词：

D O I：

10.1109/MSPEC.1967.5217220

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

页码：63 / &

共 9 条

[1]

BOX GEP, 1954, DESIGN ANALYSIS INDU, P363

[2] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].

COOLEY, JW ;

TUKEY, JW .

Danielson, GC ;

Lanczos, C .

JOURNAL OF THE FRANKLIN INSTITUTE, 1942, 233 :435-452

Danielson, GC ;

Lanczos, C .

JOURNAL OF THE FRANKLIN INSTITUTE, 1942, 233 :365-380

[5]

GENTLEMAN WM, 1966 FALL JOINT COMP, V29, P563

[6]

GOOD IJ, 1958, J ROY STAT SOC B, V20, P361

[7]

Runge C, 1903, Z MATH PHYS, V48, P443

[8]

STOCKHAM TG, 1966 JOINT COMP C AF, V28, P229

[9]

YATES F, 1937, DESIGN ANALYSIS FACT