Earticle

초록

영어

Aiming to solve the problem of long table look-up time in table look-up of CAVLC (Context-based Adaptive Variable Length Coding) for H.264/ AVC, a quick table look-up algorithm based on hash query (TLHQ) is proposed to reduce table look-up time for CAVLC decoding in this paper. The basic idea of the new algorithm is that it uses query technology of hash table to rapidly determine code length based on the number of zero in code prefix, As a result, it can save a lot of time of table looking-up and code judging. Experimental results show that our supposed new algorithm could reduce about 20% table look-up time and save 1056 byte storage space for CAVLC decoding in H.264/AVC.

목차

Abstract
 1. Introduction
 2. The Principle and Complexity Analysis of CAVLC Decoding
  2.1. Principle of CAVLC Decoding
  2.2. Complexity Analysis of CAVLC Decoding
 3. Proposed Scheme
  3.1. Variable Length Tables
  3.2. Relationship between Code Length and Numbers of 0 in Code Prefix
  3.3. Build Hash Table
  3.4. Tables Look-up Algorithm Based on Hash Query
 4. Simulation Results and Analysis
  4.1. Simulation Environment
  4.2. Reduce Table Look-up Time
  4.3. Save Table Storage Space
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Jianhua Wang [ Faculty of Automation, Guangdong University of Technology, P. R. China ]
• Lianglun Cheng [ Faculty of Automation, Guangdong University of Technology, P. R. China ]
• Jun Liu [ Faculty of Automation, Guangdong University of Technology, P. R. China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605