Abstract
A context-adaptive-variable-length-coding (CAVLC) decoder cannot determine an exact start position of the k 'th syntax element until it decodes the ( k - 1 )'th syntax element, which makes parallel CAVLC decoding difficult. We propose a new bitstream structure to maximize parallelism of CAVLC decoding. Our algorithm enables us to simultaneously access multiple points from different MBs in a bitstream. Then, a CAVLC decoder can concurrently read multiple symbols from the multiple access points and decode them in parallel. Experimental results show that the proposed algorithm significantly increases decoding speed without sacrificing coding efficiency.
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.
