High speed multidimensional systolic arrays for discrete Fourier transform

Author

Lee, Moon Ho

Author_Institution

Dept. of Inf. & Telecommun. Eng., Chonbuk Nat. Univ., Chonju, South Korea

Volume

39

Issue

12

fYear

1992

fDate

12/1/1992 12:00:00 AM

Firstpage

876

Lastpage

879

Abstract

An efficient algorithm that places an optimized DG (dependence graph) for 2ⁿ points of the discrete Fourier transform (DFT) computation is proposed. A one-dimensional DFT is turned into a multidimensional DFT, consisting of a few short DFTs, which is based on the version of the Goertzel algorithm via Horner´s rule. The data sequences in the Cooley-Tukey FFT algorithm are in an order that is easily manageable and well suited for vector processors and any parallel machine such as hypercube

Keywords

digital signal processing chips; fast Fourier transforms; systolic arrays; Goertzel algorithm; Horner´s rule; data sequences; discrete Fourier transform; hypercube; multidimensional DFT; multidimensional systolic arrays; one-dimensional DFT; parallel machine; vector processors; Design automation; Digital signal processing; Digital signal processing chips; Discrete Fourier transforms; Multidimensional systems; Signal mapping; Signal processing algorithms; Silicon; Systolic arrays; Very large scale integration;

fLanguage

English

Journal_Title

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7130

Type

jour

DOI

10.1109/82.208584

Filename

208584