| 整数DCT(BinDCT)快速算法 |
| |
| 引用本文： | 朱桂华.整数DCT(BinDCT)快速算法[J].国防科技大学学报,2002,24(2):69-72. |
| |
| 作者姓名： | 朱桂华 |
| |
| 作者单位： | 常德师范学院计算机系,湖南,常德,415000 |
| |
| 基金项目： | 国家自然科学基金资助项目 (10 17110 9) |
| |
| 摘 要： | 设计和实现了基于提升结构的无乘法二进制DCT (BinDCT)的快速算法。该算法是在基于旋转变换的递归算法基础上设计的 ,并将传统的旋转变换的 3个提升矩阵乘积减少至 2个提升矩阵乘积 ,从而使算法的运算量比现有算法大为减少
|
| 关 键 词： | 离散余弦变换 二进制离散余弦变换 提升结构 |
| 文章编号： | 1001-2486(2002)02-0069-04 |
| 收稿时间： | 2001/10/10 0:00:00 |
| 修稿时间： | 2001年10月10 |
Fast Algorithm for Integer DCT(BinDCT) |
| |
| ZHU Guihua.Fast Algorithm for Integer DCT(BinDCT)[J].Journal of National University of Defense Technology,2002,24(2):69-72. |
| |
| Authors: | ZHU Guihua |
| |
| Institution: | Department of Computer, Changde Teacher's College,Changde 415000, China |
| |
| Abstract: | In this paper, we design and implement fast multiplierless approximations of the discrete cosine transform(DCT) with the lifting scheme, named the BinDCT, which avoids floating point operations. This algorithm is derived from the plane rotation-based algorithm, which reduces 3 lifting steps to 2 lifting steps via the plane rotation. So the arithmetic operation cost is reduced greatly. |
| |
| Keywords: | DCT BinDCT lifting scheme |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
|
