Title :
High speed multidimensional systolic arrays for discrete Fourier transform
Author_Institution :
Dept. of Inf. & Telecommun. Eng., Chonbuk Nat. Univ., Chonju, South Korea
fDate :
12/1/1992 12:00:00 AM
Abstract :
An efficient algorithm that places an optimized DG (dependence graph) for 2n 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;
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
