整数DCT(BinDCT)快速算法  

Fast Algorithm for Integer DCT(BinDCT)

作　　者：朱桂华[1] 

机构地区：[1]常德师范学院计算机系,湖南常德415000

出　　处：《国防科技大学学报》2002年第2期69-72,共4页Journal of National University of Defense Technology

基　　金：国家自然科学基金资助项目 (10 17110 9)

摘　　要：设计和实现了基于提升结构的无乘法二进制DCT (BinDCT)的快速算法。该算法是在基于旋转变换的递归算法基础上设计的 ,并将传统的旋转变换的 3个提升矩阵乘积减少至 2个提升矩阵乘积 。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.

关 键 词：BinDCT 快速算法 离散余弦变换 二进制离散余弦变换 提升结构 DCT 递归算法 图像处理 变换编码 

分 类 号：TN919.81[电子电信—通信与信息系统] TN9[电子电信—信息与通信工程]