The Subtable-Huffman algorithm on CAVLC in H.264

2009 
Based on the analysis of standard decoding methods of CAVLC in H.264, this paper proposes an improved algorithm. Depending on the theories of subtable, Huffman Tree and Huffman coding, this algorithm improves the standard table look-up decoding efficiency on CAVLC. The testing result shows the Subtable-Huffman algorithm achieves 3 times higher efficiency than the standard one, with some simple subtables and the use of Huffman coding, and can improve more.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []