整数DCT(BinDCT)快速算法及其在图象压缩中的应用  

FAST ALGORITHM OF INTEGAR DCT (BINDCT) AND ITS APPLICATION IN IMAGE COMPRESSION

作　　者：朱桂华[1] 

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

出　　处：《常德师范学院学报（自然科学版）》2002年第2期28-31,共4页Journal of Changde Teachers University

摘　　要：设计和实现了离散余弦变换 (DCT)的基于提升结构的无乘法快速算法 ,称之为二进制的DCT(binDCT) .它只需移位和加法 .该算法是在基于旋转变换的递归算法基础上设计的 ,将传统的旋转变换相当于 3个提升矩阵乘积减少至2个提升矩阵乘积 ,并且还用到了互换思想 。Fast multiplierless approximations of the discrete cosine transform(DCT) with the lifting scheme, named the binDCT, which only need shift and addition,was realized. This algorithm was derived from plane rotation-based recursive algorithem, which reduced 3 lifting steps to 2 lifting steps in the plane rotation. What's more, permuted idea was used to cut down the operation quantity.

关 键 词：快速算法 图象压缩 整数离散余弦变换 二进制 提升结构 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TN911.73[自动化与计算机技术—计算机科学与技术]