IEEE Transactions on Signal Processing · 1992 · 19 citations · 5 references
ComputingComputer EngineeringComputer ScienceAlgorithmsData StructuresParallel ComputingData CompressionDigital Signal ProcessingFourier AnalysisSignal ProcessingData Processing AlgorithmsDiscrete Fourier TransformFast Fourier TransformFourier TransformTransform
A fast discrete Fourier transform (DFT) computing algorithm used in situations where part of the data is zero and only the first transform elements are to be calculated is proposed. The method is based on the pruning of a split-radix decimation-time (DIT) fast Fourier transform (FFT) diagram. It has the advantage of providing gains as a result of pruning computation and the use of a split radix.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
5
Pierre Duhamel, Henk D. L. Hollmann · Electronics Letters · 1984 · 421 citations
J. Markel · IEEE Transactions on Audio and Electroacoustics · 1971 · 273 citations