IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 1992 · 21 citations · 6 references
ComputingComputer EngineeringComputer ScienceAlgorithmsData StructuresParallel ComputingAlgorithm AnalysisData ParallelismDigital Signal ProcessingFourier AnalysisHardware AccelerationDigital Signal Processing BlocksDiscrete Fourier TransformFast Fourier TransformFourier TransformSystolic Array DesignSystolic ArraysVector Processors
An efficient algorithm that places an optimized DG (dependence graph) for 2/sup n/ 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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
6