摘要
提出了计算Ⅰ型和Ⅲ型滑动离散余弦变换和滑动离散正弦变换的快速 算法．该算法具有递归运算结构，计算复杂性为Ｏ（Ｎ），运算量小于其他算 法；文中讨论了该算法的数值稳定性问题，并将该算法与其他算法作了比 较．
The fast algorithms are proposed for the computation of the running discrete cosine transform- I (DCT-- I ), discrete sine transform- I (DST-I ), discrete cosine transform-Ⅲ (DCT- Ⅲ ), and discrete sine transform-Ⅲ(DST-Ⅲ ), which provide considerable computational savings. The stability problem of its numerical computation is also discussed. These fast algorithms can be used for transform-domain adaptive filtering in signal processing.
出处
《大连理工大学学报》
EI
CAS
CSCD
北大核心
1993年第6期724-731,共8页
Journal of Dalian University of Technology
基金
国家自然科学基金资助项目
关键词
离散余弦变换
离散正弦变
信息处理
fast transforms
algorithms
signal processing/discrete cosine transform
discrete sine transform
