Abstract
Conventional entropy coding such as UVLC (universal variable length coding) usually uses variable length coding (VLC) based on static codeword table mechanism to code syntax elements which are partitioned from motion vectors and residual coefficients. UVLC employs half-variable length code (HVLC) such as kth order Exp-Golomb-Rice code to code syntax elements. However, static tables which indicate the average probability can not adapt the real-time probability distribution satisfactorily, so there are some needs to construct a probability updating mechanism in the codeword tables. If the real-time probability could be evaluated, Huffman code is undoubtedly the best choice for its approximation to source entropy. In PUAHC, dynamic Huffman code which is based on probability updating and Golomb code are joined together to code different source information for their adaptations to different kinds of probability distributions. In the experiment, it is proved that when PUAHC is used, the bit rate can be decreased by 3.9% and the computational complexity of decoder is also acceptable compared to UVLC.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
