首页 | 本学科首页   官方微博 | 高级检索  
     

整数DCT(BinDCT)快速算法及其在图象压缩中的应用
引用本文:朱桂华. 整数DCT(BinDCT)快速算法及其在图象压缩中的应用[J]. 湖南文理学院学报(自然科学版), 2002, 14(2): 28-31
作者姓名:朱桂华
作者单位:湖南常德师范学院,计算机系,湖南,常德,415003
摘    要:设计和实现了离散余弦变换 (DCT)的基于提升结构的无乘法快速算法 ,称之为二进制的DCT(binDCT) .它只需移位和加法 .该算法是在基于旋转变换的递归算法基础上设计的 ,将传统的旋转变换相当于 3个提升矩阵乘积减少至2个提升矩阵乘积 ,并且还用到了互换思想 ,从而使算法的运算量比现有算法大为减少

关 键 词:离散余弦变换  整数离散余弦变换  二进制离散余弦变换  提升结构  应用
文章编号:1009-3818(2002)02-0028-04
修稿时间:2001-12-13

FAST ALGORITHM OF INTEGAR DCT (BINDCT) AND ITS APPLICATION IN IMAGE COMPRESSION
ZHU Gui-hua. FAST ALGORITHM OF INTEGAR DCT (BINDCT) AND ITS APPLICATION IN IMAGE COMPRESSION[J]. Journal of Hunan University of Arts and Science:Natural Science Edition, 2002, 14(2): 28-31
Authors:ZHU Gui-hua
Abstract: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.
Keywords:DCT  integer DCT  binDCT  lifting scheme  application
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号