5th International Mobile Multimedia Communications Conference

Research Article

Complexity efficient stopping criterion for LDPC based distributed video coding

Download695 downloads
        author={Jo\"{a}o Ascenso and Fernando Pereira},
        title={Complexity efficient stopping criterion for LDPC based distributed video coding},
        proceedings={5th International Mobile Multimedia Communications Conference},
        keywords={Wyner-Ziv video coding low density parity check codes belief propagation early stopping criterion.},
  • João Ascenso
    Fernando Pereira
    Year: 2010
    Complexity efficient stopping criterion for LDPC based distributed video coding
    DOI: 10.4108/ICST.MOBIMEDIA2009.7353
João Ascenso1,*, Fernando Pereira2,*
  • 1: Instituto Superior de Engenharia de Lisboa – Instituto de Telecomunicações Rua Conselheiro Emídio Navarro, 1 1950-062 Lisboa, Portugal +351 21 8418463
  • 2: Instituto Superior Técnico – Instituto de Telecomunicações Av. Rovisco Pais, 1049-001 Lisboa, Portugal +351 21 8418460
*Contact email: joao.ascenso@lx.it.pt, fp@lx.it.pt


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 requestdecode 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.