Abstract

We propose a fast new multiple run_before decoding method in context-adaptive variable length coding (CAVLC). The transform coefficients are coded using CAVLC, in which the run_before symbols are generated for a 4×4 block input. To speed up the CAVLC decoding, the run_before symbols need to be decoded in parallel. We implemented a new CAVLC table for simultaneous decoding of up to three run_befores. The simulation results show a Total Speed-up Factor of 205%∼144% over various resolutions and quantization steps.

Highlights

  • Efficient decoding of H.264/advanced video coding (AVC) is quite important in personal computer (PC)-based decoding as well as for application specific integrated circuit (ASIC) implementation

  • The method is composed of five syntax elements: TotalCoef, TrailingOnes and trailing_ones_sign_flag, level, total_zeros, and run_before

  • The authors propose to increase the speed of run_before decoding since in many cases there are multiple run_befores for one 4 × 4 block. This is the case for the levels in context-adaptive variable length coding (CAVLC); as the multiple parallel decoding of levels is quite complex, this paper only focuses on the multiple parallel decoding of run_before

Read more

Summary

Introduction

Efficient decoding of H.264/advanced video coding (AVC) is quite important in personal computer (PC)-based decoding as well as for application specific integrated circuit (ASIC) implementation. For TrailingOnes (or T1s), the trailing_ones_sign_flag is assigned to 0 or 1 to represent the “þ” or “−” sign of the trailing ones, respectively For this syntax element, there is no need for decoding in the calculation or table access. Moon proposed a method to reduce the large number of memory access operations in the decoding process for coeff_token He used new variable-length decoding (VLD)s for coeff_token and a state machine instead of the run_ before decoding table. This method reduced 95% of the memory access, which is quite a good improvement for a low power hardware implementation. Ki and Kim: Fast multiple run_before decoding method for efficient implementation of an H.264/advanced video coding. We found that the average probability of regions [1] and [2] are 87.3% and 12.7%, respectively

Proposed Multiple Decoding Table
Reducing the Multiple Decoding Table
Simulation Results
Comparison of the Number of Table Accesses
Ideal Speed-Up Gain of the Proposed Method
Comparison of the Implementation with Wen
Conclusions
Full Text
Paper version not known

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 call

Disclaimer: 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.