.png){kind=icon}
Return
Memory-efficient H.264/AVC CAVLC for fast decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCE.2006.1706492.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fast decoding method is presented for memory-efficient context-based adaptive variable length coding (CAVLC). The CAVLC algorithm in H.264/MPEG-4 A VC significantly increased the compression ratio compared with variable length coding (VLC) of conventional video coding standards such as H.263 and MPEG-4 Visual because of adaptive use of neighboring blocks' context. Implementation of the CAVLC decoding algorithm, however, is much more complicated than existing VLC decoding methods because of frequent access to the unstructured VLC tables, adaptive switching of tables, and five syntax elements. Especially in mobile video terminals such. as digital multimedia broadcasting (DMB) and digital video broadcasting handheld (DVB-H) player, conventional CAVLC decoding algorithms result in increased power consumption due to frequent memory access. This paper presents a new CA VLC decoding method using arithmetic operations instead of the conventional table look-up method that requires a lots of memory access. Experimental results show that the proposed algorithm has 50% higher speed and 95% less memory access comparing with three conventional CAVLC algorithms, such as table look-up by sequential search, table look-up by binary search, and Moon's method
Keywords:
CAVLC decoding
arithmetic operation
memory access
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.9
Papers:
5.3K
Citations:
6.8K
Organization
No organization information available
.png){kind=icon}
