| 二进制整数离散余弦变换无乘法提升阶梯算法 |
| |
| 引用本文： | 陈力.二进制整数离散余弦变换无乘法提升阶梯算法[J].汕头大学学报(自然科学版),2004,19(3):19-26. |
| |
| 作者姓名： | 陈力 |
| |
| 作者单位： | 汕头大学电子工程系,汕头,515063 |
| |
| 基金项目： | 国家自然科学基金资助项目 (NO :60 2 75 0 1 1 )，广东省自然科学基金资助项目 (NO :0 2 1 2 5 2 ) |
| |
| 摘 要： | 研究了一种基于二进制整数离散余弦变换的无乘法快速和高效算法 ,新算法同时对实现提升阶梯中涉及的系数进行了分式化和截“1”近似 ,对带来的误差进行了实验分析 ,实现了加法器总数的优化 .实验表明通过构造无乘法提升阶梯替代传统的递归平面旋转变换的算法降低了系统的运算复杂度 ,同时提高了算法的实时性 .
|
| 关 键 词： | 离散余弦变换 提升阶梯 无乘法降阶 快速算法 |
| 文章编号： | 1001-4217(2004)03-0019-08 |
| 修稿时间： | 2004年3月8日 |
Binary Integer Discrete Cosine Transform Based on Multiplierless Lifting Structures |
| |
| CHEN Li.Binary Integer Discrete Cosine Transform Based on Multiplierless Lifting Structures[J].Journal of Shantou University(Natural Science Edition),2004,19(3):19-26. |
| |
| Authors: | CHEN Li |
| |
| Abstract: | In this paper,a fast algorithm for multiplier-less binary integer approximation of discrete cosine transform is presented.The errors in the process when the multiplier coefficients in the lifting structures are converted to binary fractions are analyzed in experiments and the truncation errors are also studied.The lifting structures are realized with minimized additions.Compared with recursive algorithms based on plane rotations,the 3lifting structures reduce the computational complexity in real-time realization of the algorithm. |
| |
| Keywords: | discrete cosine transform lifting structures multiplierless approximation fast algorithms |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
