Memory-efficient H.264/AVC CAVLC for fast decoding

Kim, Yonghwan; Yoo, Yoonjong; Shin, Jeongho; Choi, Byeongho; Paik, Joonki

doi:10.1109/tce.2006.1706492

Cited by 33 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[1][2][3][4][5][6][7][8] Coeff_token decoding has been improved by using new coeff_token VLD, 1 and total_zeros decoding has been improved and memory access reduced by 80~90%. 4 Trailing_ones_sign_flag is simply assigned as "0" or "1."…”

Section: Discussionmentioning

confidence: 99%

“…Previous research on run_before decoding used an arithmetic operation to reduce the table accesses. 2 But this is efficient when GPP or DSP is used. Our aim is to develop a new algorithm for improving run_before decoding for hardware implementation.…”

Section: Discussionmentioning

confidence: 99%

“…This method reduced 95% of the memory access, which is quite a good improvement for a low power hardware implementation. Kim et al 2 used conventional digital signal processor (DSP) or general purpose processor (GPP) instructions for CAVLC decoding. As shown in Fig.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast multiplerun_beforedecoding method for efficient implementation of an H.264/advanced video coding context-adaptive variable length coding decoder

Kim

2013

Opt. Eng

View full text Add to dashboard Cite

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. © The Authors. Published by SPIE under a Creative Commons Attribution 3.0 Unported License. Distribution or reproduction of this work in whole or in part requires full attribution of the original publication, including its DOI.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Fast multiplerun_beforedecoding method for efficient implementation of an H.264/advanced video coding context-adaptive variable length coding decoder

Kim

2013

Opt. Eng

View full text Add to dashboard Cite

show abstract

“…However, these methods show relatively lower performance for real-time decoding. 22,23 As a study to reduce the number of memory accesses in CAVLD, an arithmetic operation-based method 24 is proposed. However, this method causes many conditional statements instead of memory accesses and repeated comparisons, compared to the table look-up methods.…”

Section: Entropy Decoding Process Of Video Codecs and Conventional Famentioning

confidence: 99%

“…Table 9 shows the MCPS required by the proposed and conventional algorithms for the "coeff_token" syntax element of H.264/AVC (CAVLC mode) and cycle reduction ratio (CRR) of the proposed algorithm, compared with the conventional algorithms. We counted the number of cycles only for decoding of CAVLC by applying the proposed instructions to Kim's method 23 and Iqbal's method. 15 The proposed method and Iqbal's method are based on table mapping, while Kim's method is based on arithmetic operations.…”

Section: Performance Evaluation Of the Developed Bitstream Processingmentioning

confidence: 99%

Bitstream decoding processor for fast entropy decoding of variable length coding–based multiformat videos

Sim

2014

Opt. Eng

View full text Add to dashboard Cite

We present a bitstream decoding processor for entropy decoding of variable length coding-based multiformat videos. Since most of the computational complexity of entropy decoders comes from bitstream accesses and table look-up process, the developed bitstream processing unit (BsPU) has several designated instructions to access bitstreams and to minimize branch operations in the table look-up process. In addition, the instruction for bitstream access has the capability to remove emulation prevention bytes (EPBs) of H.264/AVC without initial delay, repeated memory accesses, and additional buffer. Experimental results show that the proposed method for EPB removal achieves a speed-up of 1.23 times compared to the conventional EPB removal method. In addition, the BsPU achieves speed-ups of 5.6 and 3.5 times in entropy decoding of H.264/AVC and MPEG-4 Visual bitstreams, respectively, compared to an existing processor without designated instructions and a new table mapping algorithm. The BsPU is implemented on a Xilinx Virtex5 LX330 field-programmable gate array. The MPEG-4 Visual (ASP, Level 5) and H.264/AVC (Main Profile, Level 4) are processed using the developed BsPU with a core clock speed of under 250 MHz in real time.

show abstract

References

2016

Multimedia Networks

View full text Add to dashboard Cite

Memory-efficient H.264/AVC CAVLC for fast decoding

Cited by 33 publications

References 8 publications

Fast multiplerun_beforedecoding method for efficient implementation of an H.264/advanced video coding context-adaptive variable length coding decoder

Fast multiplerun_beforedecoding method for efficient implementation of an H.264/advanced video coding context-adaptive variable length coding decoder

Bitstream decoding processor for fast entropy decoding of variable length coding–based multiformat videos

References

Contact Info

Product

Resources

About