论文部分内容阅读
本文提出一种计算DCT(2~m)的递归快速新算法,该算法比Lee算法计算误差小,比Vettreli等人的FFCT算法的结构简单,同时具有和上述算法相同的计算复杂性。文中同时导出DFT和DCT之间的关系。基于DCT的快速新算法,DFT的递归快速新算法具有和FFCT和SR—FFT同样的计算复杂性,但具有更好的递归结构。
In this paper, we propose a new fast recursive algorithm for computing DCT (2 ~ m), which has less computational errors than the Lee algorithm and has a simpler structure than the VFCtreli et al.’s FFCT algorithm and has the same computational complexity as the above algorithm. The paper also derived the relationship between DFT and DCT. Based on the fast DCT-based new algorithm, DFT’s recursive fast new algorithm has the same computational complexity as FFCT and SR-FFT, but with a better recursive structure.