计算机工程 ›› 2013, Vol. 39 ›› Issue (2): 23-26.doi: 10.3969/j.issn.1000-3428.2013.02.005

• 专栏 • 上一篇    下一篇

一种基于CAVLC解码的快速码表查找算法

?黄明政,王建华,韩一石,孙运龙   

  1. (广东工业大学信息工程学院,广州 510006)
  • 收稿日期:2012-03-29 修回日期:2012-05-23 出版日期:2013-02-15 发布日期:2013-02-13
  • 作者简介:黄明政(1989-),男,硕士研究生,主研方向:视频通信,视频编解码;王建华,硕士研究生;韩一石,副教授;孙运龙,硕士研究生
  • 基金项目:

    广东省科技计划基金资助项目(2011B090400344, 2011B010200029)

A Quick Code Table Lookup Algorithm Based on CAVLC Decoding

HUANG Ming-zheng, WANG Jian-hua, HAN Yi-shi, SUN Yun-long   

  1. (School of Information Engineering, Guangdong University of Technology, Guangzhou 510006, China)
  • Received:2012-03-29 Revised:2012-05-23 Online:2013-02-15 Published:2013-02-13

摘要:

在分析和研究基于上下文的自适应可变长度编码(CAVLC)码表结构特点的基础上,结合码表统计规律,提出一种新的CAVLC解码码表查找算法。根据码字前缀0的个数和码字长度之间的关系共同决定输入码字后缀位数和数值,实现对输入码流的快速确定,对确定的输入码字,只需再查一次表便可以得到其对应的解码输出。测试结果表明,该优化算法在解码查表速度方面比原算法提高约20%。

关键词: 基于上下文的自适应可变长度编码, 码表查找, 码字前缀, 码字后缀, 码字长度

Abstract:

Based on the thorough analysis and study on the structural characteristics of Context-based Adaptive Variable Length Coding(CAVLC) code tables, this paper proposes a new table lookup algorithm for CAVLC decoding with the statistical law of code tables. The idea of this algorithm is based on the relationship between the numbers of zero in code prefix and the length of code. With it, it proposes a scheme, in which the code suffix and the code value are determined by the relationship between the numbers of zero in code prefix and the length of code, and it can decode the input code quickly. As a result, a specific input code can be decoded with only one time table lookup. Test results show that the optimized algorithm can achieve 20% speed-up in the table lookup compared with the original algorithm.

Key words: Context-based Adaptive Variable Length Coding(CAVLC), code table lookup, code prefix, code suffix, code length

中图分类号: