A Fast 2D 8×8 IDCT Algorithm Based on Look-Up Table

JI Xiu-hua; ZHANG Cai-ming; HAN Hui-jian

您当前的位置：

首页 >

文章列表页 >

A Fast 2D 8×8 IDCT Algorithm Based on Look-Up Table

更新时间：2025-07-16

- A Fast 2D 8×8 IDCT Algorithm Based on Look-Up Table
- Acta Electronica Sinica Vol. 36, Issue 4, Pages: 639-645(2008)
- 作者机构：
  
  1. 山东大学计算机科学与技术学院,山东,济南,250061
  2. 山东经济学院计算机科学与技术学院,山东,济南,250014
  3. 山东大学计算机科学与技术学院山东济南,250061
  4. 山东经济学院计算机科学与技术学院山东济南,250014
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP391
- Published Online：25 April 2008，
  
  Published：2008
- 稿件说明：
移动端阅览
JI Xiu-hua, ZHANG Cai-ming, HAN Hui-jian. A Fast 2D 8×8 IDCT Algorithm Based on Look-Up Table[J]. Acta Electronica Sinica, 2008, 36(4): 639-645.
DOI：

JI Xiu-hua, ZHANG Cai-ming, HAN Hui-jian. A Fast 2D 8×8 IDCT Algorithm Based on Look-Up Table[J]. Acta Electronica Sinica, 2008, 36(4): 639-645. DOI：

摘要

提出一种基于查表法的二维8×8离散余弦逆变换(2D 8×8 IDCT)的快速算法

其查找表LUT(Look-Up Table)结构的设计是基于二维8×8 DCT的基本图像.利用两种技术减小查找表长度:①利用基本图像的对称特性;②通过对离散余弦正变换(DCT)和量化过程的分析

推导出每个量化后DCT系数的取值范围.使得查找表只有10.9746K项数据

若量化矩阵具有对称性

q(u

v)=q(v

LUT的长度还可减少近半.新算法利用查表法消除IDCT中乘法运算

并利用图像数据的特点和基本图像的对称特性大大减少加法次数

提高了计算速度.以多幅标准图像为样本数据进行实验

结果表明:新算法实现2D 8×8 IDCT运算平均只需加法182次.与当前运算量最小的Feig快速算法做比较

新算法避免了乘法

所需加法次数也降低了约15%.

Abstract

A new fast two dimension 8×8 Inverse Discrete Cosine Transform (IDCT) algorithm based on Look-Up Table (LUT) is presented

in which

the LUT structure is based on the DCT basic images.The LUT size is decreased by using two techniques.One is to use the symmetries of the basic images;another is to elicit the range of each quantized DCT coefficient. As a result

the LUT only has 10.9746K data.If the quantization matrix has the symmetry

q(u

v)=q(v

the LUT size can be decreased half nearly again.The new algorithm avoids multiplications by using LUT and decreases additions greatly by utilizing the characteristics of actual images and the symmetries of the basic images. The experimental results indicate that it only needs 182 additions av

eragely and decreases about 15 percent of additions besides eliminating multiplications compared with Feig’s algorithm that needs least arithmetic operations nowadays.

关键词

Keywords

references

Views

1727

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Image Compression Based on Geometrical Direction

Multi-Polarimetric SAR Image Compression Based on Three Dimensional Matrix Transform

A Feature Method for Fast Fractal Image Encoding

Image Segmentation Based on a Modified Pulse-Coupled Neural Network

Related Author

DUAN Jing-hong

LIU Gang

WANG Ying-hui

LIU Jing

PAN Zhi-gang

WANG Yan-fei

ZHANG Wen-chao

LI Ying

Related Institution

School of Computer Science and TechnologyXidian UniversityXi'anShaanxi 710071China

Faculty of Computer Science and EngineeringXi'an University of TechnologyXi'anShaanxi 710048China

School of Computer Science and Technology, Xidian University

Faculty of Computer Science and Engineering, Xi'an University of Technology

Graduate school of the Chinese Academic of ScienceBeijing 100039China

⁰