MODULAR REALIZATIONS OF THE DFT FROM THE GOERTZEL DFT MODULES (OF SMALLER DIMENSION)

被引：3

作者：

GHOUSE, MA

机构：

[1] Department of Electrical Engineering, State University of New York at Stony Brook, Stony Brook

来源：

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

关键词：

D O I：

10.1109/TSP.1993.193171

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

The Good-Thomas fast Fourier transform (FFT) algorithm is combined with the Goertzel discrete Fourier transform (DFT) algorithm. This results in modular hardware structures with good data-flow properties and low hardware complexity. These structures allow making tradeoffs between the hardware complexity and the time performance.

引用

页码：427 / 432

页数：6

共 14 条

[1]

Brigham E. O., 1974, FAST FOURIER TRANSFO

[2]

CASPARI KL, 1970 P S WORKSH APPL

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

COOLEY, JW ;

TUKEY, JW .

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

[4]

ELLIOT DF, 1982, FAST TRANSFORMS

[5]

GHOUSE MA, 1987, 21ST AS C SIGN SYST

[6]

GHOUSE MA, 1988, THESIS U CALIFORNIA

[7]

Goertzel G., 1958, AM MATH MONTHLY, V65, P34, DOI DOI 10.2307/2310304

[8]

GOOD IJ, 1958, J ROY STAT SOC B MET, V20, P34

[9] RECURSIVE DISCRETE FOURIER TRANSFORMATION [J].

HOSTETTER, GH .

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1980, 28 (02) :184-190

[10]

JONES KJ, 1990, P I ELEC ENG, V137

← 1 2 →