1. 山东大学计算机科学与技术学院,山东,济南,250061
2. 山东经济学院计算机科学与技术学院,山东,济南,250014
3. 山东大学计算机科学与技术学院山东济南,250061
4. 山东经济学院计算机科学与技术学院山东济南,250014
网络出版:2008-04-25,
纸质出版:2008
移动端阅览
纪秀花, 张彩明, 韩慧健. 用查表法快速实现二维8×8离散余弦逆变换的研究[J]. 电子学报, 2008,36(4):639-645.
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.
提出一种基于查表法的二维8×8离散余弦逆变换(2D 8×8 IDCT)的快速算法
其查找表LUT(Look-Up Table)结构的设计是基于二维8×8 DCT的基本图像.利用两种技术减小查找表长度:①利用基本图像的对称特性;②通过对离散余弦正变换(DCT)和量化过程的分析
推导出每个量化后DCT系数的取值范围.使得查找表只有10.9746K项数据
若量化矩阵具有对称性
q(u
v)=q(v
u)
LUT的长度还可减少近半.新算法利用查表法消除IDCT中乘法运算
并利用图像数据的特点和基本图像的对称特性大大减少加法次数
提高了计算速度.以多幅标准图像为样本数据进行实验
结果表明:新算法实现2D 8×8 IDCT运算平均只需加法182次.与当前运算量最小的Feig快速算法做比较
新算法避免了乘法
所需加法次数也降低了约15%.
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
u)
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.
0
浏览量
1727
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621