Complexity efficient stopping criterion for LDPC based distributed video coding

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In several distributed video coding architectures, a well-known complexity trade-off exists, where the low encoding benefits are paid with a higher decoding complexity. In a feedback channel based DVC architecture, the high decoding complexity is mainly due to the Slepian–Wolf decoding and the repetitive request-decode operation, especially when there is no initial encoder rate estimation or iterative motion refinement is employed. In this paper, an early stopping criterion for the LDPC syndrome belief propagation decoder is proposed that is able to reduce the number of decoding iterations. As a consequence, a significant reduction of the DVC decoder complexity can be observed with negligible losses in RD performance. The experimental results show reductions up to about 4 times in decoding complexity with a maximum of 0.15dB loss at high bitrates while for low and medium bitrates the RD performance loss is negligible.

Cite

CITATION STYLE

APA

Ascenso, J., & Pereira, F. (2009). Complexity efficient stopping criterion for LDPC based distributed video coding. In Proceedings of the 5th International Conference on Mobile Multimedia Communications, MobiMedia 2009. ICST Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. https://doi.org/10.4108/ICST.MOBIMEDIA2009.7353

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free