作者: Martin Vetterli , member Eurasip , Henri J. Nussbaumer
DOI: 10.1016/0165-1684(84)90059-8
关键词: Discrete Fourier transform 、 Bruun's FFT algorithm 、 Bluestein's FFT algorithm 、 Prime-factor FFT algorithm 、 Twiddle factor 、 Fast Fourier transform 、 Discrete cosine transform 、 Split-radix FFT algorithm 、 Algorithm 、 Mathematics
摘要: A simple algorithm for the evaluation of discrete Fourier transforms (DFT) and cosine (DCT) is presented. This approach, based on divide conquer technique, achieves a substantial decrease in number additions when compared to currently used FFT algorithms (30% DFT real data, 15% complex data 25% DCT) keeps same multiplications as best known algorithms. The structure fact that it suited (one does not have take transform two sequences simultaneously anymore) should lead efficient implementations wide range applications.