节点文献
DFT(2~m)和DCT(2~m)的递归快速新算法
NEW FAST RECURSIVE ALGORITHMS FOR DFT(2~m)AND DCT(2~m)
【摘要】 本文提出一种计算DCT(2~m)的递归快速新算法,该算法比Lee算法计算误差小,比Vettreli等人的FFCT算法的结构简单,同时具有和上述算法相同的计算复杂性。文中同时导出DFT和DCT之间的关系。基于DCT的快速新算法,DFT的递归快速新算法具有和FFCT和SR—FFT同样的计算复杂性,但具有更好的递归结构。
【Abstract】 This paper presents a new fast recursive algorithm for compu-ting discrete cosine transform DCT(2~m).The algorithm has highercomputational precision than Lee’s algorithm and a simpler struc-ture than FFCT presented by Vetterli et al.with the same compu-tational complexity.In the paper,the authors have derived therelationship between DFT and DCT.Based on the new fastalgorithm for DCT,the new fast recursive algorithm for DFT hasthe same computational complexity as FFCT and SR-FFT but abetter recursive structure.
- 【文献出处】 华南工学院学报(自然科学版) , 编辑部邮箱 ,1987年04期
- 【被引频次】3
- 【下载频次】57