27 April 2016 Memory-efficient table look-up optimized algorithm for context-based adaptive variable length decoding in H.264/advanced video coding
Author Affiliations +
Abstract
Table look-up operation plays a very important role during the decoding processing of context-based adaptive variable length decoding (CAVLD) in H.264/advanced video coding (AVC). However, frequent table look-up operation can result in big table memory access, and then lead to high table power consumption. Aiming to solve the problem of big table memory access of current methods, and then reduce high power consumption, a memory-efficient table look-up optimized algorithm is presented for CAVLD. The contribution of this paper lies that index search technology is introduced to reduce big memory access for table look-up, and then reduce high table power consumption. Specifically, in our schemes, we use index search technology to reduce memory access by reducing the searching and matching operations for code_word on the basis of taking advantage of the internal relationship among length of zero in code_prefix, value of code_suffix and code_lengh, thus saving the power consumption of table look-up. The experimental results show that our proposed table look-up algorithm based on index search can lower about 60% memory access consumption compared with table look-up by sequential search scheme, and then save much power consumption for CAVLD in H.264/AVC.
© 2016 SPIE and IS&T
Jianhua Wang, Jianhua Wang, Lianglun Cheng, Lianglun Cheng, Tao Wang, Tao Wang, Xiaodong Peng, Xiaodong Peng, } "Memory-efficient table look-up optimized algorithm for context-based adaptive variable length decoding in H.264/advanced video coding," Journal of Electronic Imaging 25(2), 023028 (27 April 2016). https://doi.org/10.1117/1.JEI.25.2.023028 . Submission:
JOURNAL ARTICLE
10 PAGES


SHARE
Back to Top