New Lookup Tables and Searching Algorithms for Fast H.264/AVC CAVLC Decoding

In this paper, new codeword structures, tables, and searching methods for fast and efficient coeff_token , total_zeros , and run_before decoding are developed. This new achievement is mainly based on the fact that the context-adaptive variable length coding (CAVLC) decoding can be modeled as a finit...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems for video technology Vol. 20; no. 7; pp. 1007 - 1017
Main Authors: LEE, Jun-Young, LEE, Jae-Jin, PARK, SeongMo
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.07.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Applied sciences
Automata
Automatic voltage control
Circuit properties
Coding, codes
Complexity
Concurrent computing
Context-adaptive variable length coding (CAVLC)/decoding
Critical path
Decoding
Delay
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
entropy decoding
Exact sciences and technology
Feedback
H.264/advanced video coding (AVC)
Image processing
Information, signal and communications theory
Integrated circuits
Integrated circuits by function (including memories and processors)
Iterative decoding
Mathematical analysis
Mathematical models
Methods
Multiplexing
Searching
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Signal and communications theory
Signal processing
Streaming media
Switching, multiplexing, switched capacity circuits
Table lookup
Tables
Telecommunications and information theory
Throughput
Video coding
Video coding
Positioning
Multiplexer
Finite state machine
Iterative method
Entropy
Decoding
H.264/advanced video coding (AVC)
Storage access
Implementation
Video signal processing
Search algorithm
Adaptive coding
Look up table
Image quality
entropy decoding
Storage management
Algorithm complexity
Critical path
Syntax
Variable length code
Context-adaptive variable length coding (CAVLC)/decoding
ISSN:1051-8215, 1558-2205
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, new codeword structures, tables, and searching methods for fast and efficient coeff_token , total_zeros , and run_before decoding are developed. This new achievement is mainly based on the fact that the context-adaptive variable length coding (CAVLC) decoding can be modeled as a finite state machine. In order to quantitatively evaluate the proposed method in terms of decoding speed and complexity, we define the iteration bound (1/τ̃) and the complexity ratio ( CR ). Using these gauge variables, we show that the new algorithms reduce τ̃ to about one third and complexity ratio to 0.95. This means that the proposed techniques reduce the decoding time to about one third and memory access count by 90% compared to those of the conventional methods without implementation overheads. Multiple-symbol parallel decoding method for run_before syntax element is proposed based on a bit-positioning with the critical path latency of only one multiplexer for the post-combination process. The proposed methods make it possible to implement a fast and efficient CAVLC decoding without losing video quality on any environments.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1051-8215
1558-2205
DOI:10.1109/TCSVT.2010.2051278