H.264 Deblocking Speedup
- 7 April 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 19 (8) , 1178-1182
Abstract
This letter tackles the problem of reducing the complexity of H.264 decoding. Since deblocking accounts for a significant percentage of H.264 decoding time, our focus is on the H.264 in-loop deblocking filter. Observing that branch operations are costly and that in the deblocking process there are events with significantly high probability of occurrence, we regroup and simplify the branch operations. We apply the idea of Huffman tree optimization to speed up the boundary strength derivation and the true-edge detection by taking advantage of the biased statistical distribution. Our analyses and experiments show that the proposed techniques can reduce the deblocking computation time typically by a factor of more than seven times, while maintaining the bit-exact output.Keywords
This publication has 4 references indexed in Scilit:
- Generating H.264/AVC Compliant Bitstreams for Lightweight Decoding Operation Suitable for Mobile Multimedia Systems2006
- Real-Time Software Implementation of H.264 Baseline Profile Video Encoder for Mobile and Handheld Devices2006
- Encoder optimization for H.264/AVC fidelity range extensions2005
- Adaptive deblocking filterIEEE Transactions on Circuits and Systems for Video Technology, 2003