| 引用本文: | 朱桂华.整数DCT(BinDCT)快速算法.[J].国防科技大学学报,2002,24(2):69-72.[点击复制] |
| ZHU Guihua.Fast Algorithm for Integer DCT(BinDCT)[J].Journal of National University of Defense Technology,2002,24(2):69-72[点击复制] |
|
| |
|
|
| 本文已被：浏览 7107次 下载 6736次 |
| 整数DCT(BinDCT)快速算法 |
| 朱桂华 |
|
(常德师范学院 计算机系,湖南 常德 415000)
|
| 摘要: |
| 设计和实现了基于提升结构的无乘法二进制DCT(BinDCT)的快速算法。该算法是在基于旋转变换的递归算法基础上设计的，并将传统的旋转变换的3个提升矩阵乘积减少至2个提升矩阵乘积, 从而使算法的运算量比现有算法大为减少。 |
| 关键词: 离散余弦变换 二进制离散余弦变换 提升结构 |
| DOI： |
| 投稿日期：2001-10-10 |
| 基金项目:国家自然科学基金资助项目(10171109) |
|
| Fast Algorithm for Integer DCT(BinDCT) |
| ZHU Guihua |
|
(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 |
|
|
