Memory Efficient and Low Complexity Variable Length Decoding for MPEG-4 Applications

Variable length decoding (VLD) is one of the most computationally expensive parts in a video decoder. Since VLD is an inherent bit-serial operation and is the first stage of the whole decoding task, the overall decoding system performance is determined by its throughput and efficiency. In this paper...

Full description

Saved in:
Bibliographic Details
Main Authors: Tao Sheng, Sarem, M., Jingli Zhou
Format: Conference Proceeding
Language:English
Subjects:
Application software
Digital signal processing
Educational institutions
Indexing
Iterative decoding
MPEG 4 Standard
Streaming media
System performance
Throughput
Video compression
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Variable length decoding (VLD) is one of the most computationally expensive parts in a video decoder. Since VLD is an inherent bit-serial operation and is the first stage of the whole decoding task, the overall decoding system performance is determined by its throughput and efficiency. In this paper, a VLD scheme is presented. The proposed VLD tables need less than 6Kbytes memory space, and the decoding procedures are completed by applying numerical properties to codewords identification and symbol indexing. Compared with the direct indexing method, not only the memory space is reduced for symbol information, but also the code efficiency is improved by enabling the compiling code with the near mode. Experimental results show that the proposed solution can improve the VLD speed by 17-43%. This VLD method has been integrated into the developed embedded MPEG-4 video decoder and can perform real-time decoding under eight channels common intermediate format (CIF) frame size.
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPPW.2007.52