作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2004, Vol. 30 ›› Issue (20): 159-160.

• 论文 • 上一篇    下一篇

基于查表的无乘法DCT快速算法

杜相文,陈贺新,赵岩   

  1. 吉林大学南岭校区通信工程学院测控技术与仪器系,吉林大学南岭校区通信工程学院测控技术与仪器系,吉林大学通信工程学院通信工程系 长春 130025
  • 发布日期:2004-10-25

Multiplierless Fast DCT Algorithm Based on Look-up-table

DU Xiangwen1, CHEN Hexin1, ZHAO Yan2   

  1. (1.Department of Survey and Control Technology and Equipment, College of Communication Engineering, Nanling Campus, Jilin University, Changchun 130025; 2. Department of Communication Engineering, College of Communication Engineering, Jilin University, Changchun 130012)
  • Published:2004-10-25

摘要: 为提高离散余弦变换(DCT)的运算速度,提出了一种高效、快速的无乘法DCT算法。该算法在不引入移位运算的前提下,利用查表法去除了在DCT变换中所需的乘法运算,只需要有限步加法即可完成DCT,运算速度比JPEG中的传统算法提高了1.5倍多。所得到的数据精度与原始的DCT算法完全相同。该算法特别适用于图像信号的处理。

关键词: 无乘法, 查表, 快速离散余弦变换

Abstract: A new efficient and fast multiplierless discrete cosine transform (DCT) algorithm is presented in order to increase the speed of DCT. Without shifting operation, the multiplierless method finishes DCT only by using addition. The computing speed of the method is more than 1.5 times faster than that of the classical algorithm used in JPEG. Furthermore, the precision of the transformed results is same as that of general DCT. This algorithm is especially suitable to image processing.

中图分类号: