Achieving H.264like compression efficiency with distributed video coding Recently, a new class of distributed source coding (DSC) based video coders has been proposed to enable lowcomplexity encoding. However, to date, these lowcomplexity DSCbased video encoders have been unable to compress as efficiently as motioncompensated predictive coding based video codecs, such as H.264AVC, due to insufficiently accurate modeling of video data. In this work, we examine achieving H.264like high compression efficiency with a DSCbased approach without the encoding complexity constraint. The success of H.264AVC highlights the importance of accurately modeling the highly nonstationary video data through finegranularity motion estimation. This motivates us to deviate from the popular approach of approaching the WynerZiv bound with sophisticated capacityachieving channel codes that require long block lengths and high decoding complexity, and instead focus on accurately modeling video data. Such a DSCbased, compressioncentric encoder is an important first step towards building a robust DSCbased video coding framework.

Distributed video coding based on constrained rate adaptive low density parity check Codes Distributed video coding is an emerging area of research for digital video driven partly by the widespread use of video acquisition devices by the consumers. In this paper, we present a distributed video coding scheme based on zero motion identification at the decoder and constrained rate adaptive low density parity check (LDPC) codes. Zeromotionblock identification mechanism is introduced at the decoder, which takes the characters of video sequence into account. The constrained error control decoder can use the bits in the zero motion blocks as a constraint to achieve a better decoding performance and further improve the overall video compression efficiency. It is only at the decoder side that the proposed scheme exploits temporal and spatial redundancy without introducing any additional processing at the encoder side, which keeps the complexity of the encoding as low as possible with certain compression efficiency. As a powerful alternative to Turbo codes, LDPC codes have been applied to our scheme. Since video data are highly nonergodic, we use rateadaptive LDPC codes to fit this variation of the achievable compression rate in our scheme. But one most basic difference between LDPC codes in our scheme and conventional channel coding is that in our scheme, we can make sure some bits are known. Those bits can work as constraints to the decoder and improve the decoding performance. We propose a constrained LDPC decoder not only to improve the decoder efficiency but also to speed the convergence of the iterative decoding. Simulation demonstrates that the scheme has significant improvement in the performances. In addition, the proposed constrained LDPC decoder may benefit other application.