LOGARITHMIC PRUNING OF FFT FREQUENCIES

被引：11

作者：

BARASH, S

RITOV, Y

机构：

[1] UNIV PENN,DEPT STAT,PHILADELPHIA,PA 19104

[2] HEBREW UNIV JERUSALEM,DEPT STAT,IL-91905 JERUSALEM,ISRAEL

来源：

IEEE TRANSACTIONS ON SIGNAL PROCESSING | 1993年 / 41卷 / 03期

关键词：

D O I：

10.1109/78.205740

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A standard fast Fourier transform (FFT) computes the transform at evenly spaced points on a linear scale. We suggest a simple modification of the FFT algorithm resulting in an efficient method to calculate the transform only at evenly spaced frequencies on a logarithmic scale. The saving in the number of operations, compared with a standard FFT, is around 60% for typical values.

引用

页码：1398 / 1400

页数：3

共 5 条

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

COOLEY, JW ;

TUKEY, JW .

MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&

[2] FFT PRUNING [J].

MARKEL, JD .

IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS, 1971, AU19 (04) :305-&

[3]

Nussbaumer H.J., 1982, FAST FOURIER TRANSFO

[4]

Press W.H., 1994, NUMERICAL RECIPES C, V2nd ed.

[5] PRUNING DECIMATION IN-TIME FFT ALGORITHM [J].

SKINNER, DP .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1976, 24 (02) :193-194

← 1 →