| DFT(2~m)和DCT(2~m)的递归快速新算法 |
| |
| 引用本文： | 马维祯,殷瑞祥.DFT(2~m)和DCT(2~m)的递归快速新算法[J].华南理工大学学报(自然科学版),1987(4). |
| |
| 作者姓名： | 马维祯 殷瑞祥 |
| |
| 作者单位： | 华南工学院无线电工程系，华南工学院无线电工程系 |
| |
| 摘 要： | 本文提出一种计算DCT(2~m)的递归快速新算法,该算法比Lee算法计算误差小,比Vettreli等人的FFCT算法的结构简单,同时具有和上述算法相同的计算复杂性。文中同时导出DFT和DCT之间的关系。基于DCT的快速新算法,DFT的递归快速新算法具有和FFCT和SR—FFT同样的计算复杂性,但具有更好的递归结构。
|
| 关 键 词： | 算法 傅里叶变换 计算复杂性 数字信号处理 离散傅里叶变换 快速傅里叶变换 离散余弦变换 离散正弦变换 |
NEW FAST RECURSIVE ALGORITHMS FOR DFT(2~m)AND DCT(2~m) |
| |
| Ma Weizhen and Yin Ruixiang Dept.of Radio Eng.,South China Inst.of Tech..NEW FAST RECURSIVE ALGORITHMS FOR DFT(2~m)AND DCT(2~m)[J].Journal of South China University of Technology(Natural Science Edition),1987(4). |
| |
| Authors: | Ma Weizhen and Yin Ruixiang Deptof Radio Eng South China Instof Tech |
| |
| 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. |
| |
| Keywords: | algorithm Fourier transform computational complexity digital signal processing discrete Fourier transform fast Fourier transform discrete cosine transform discrete sine transform |
| 本文献已被 CNKI 等数据库收录！ |
