1 October 2012 New bitstream structure for parallel context-adaptive-variable-length-coding decoding
Yun-Gu Lee, Kyunghwan Cho
Author Affiliations +
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.
© 2012 SPIE and IS&T 0091-3286/2012/$25.00 © 2012 SPIE and IS&T
Yun-Gu Lee and Kyunghwan Cho "New bitstream structure for parallel context-adaptive-variable-length-coding decoding," Journal of Electronic Imaging 21(4), 043002 (1 October 2012). https://doi.org/10.1117/1.JEI.21.4.043002
Published: 1 October 2012
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Video

Video coding

Computer programming

Image segmentation

Parallel processing

Standards development

Data communications

RELATED CONTENT


Back to Top