• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.3-10
• /
• 2015

Application of polar codes to rate-adaptive asymmetric Slepian-Wolf coding is considered. We propose a method of constructing polar codes which supports rate adaptivity. The proposed polar distributed source coding with successive cancellation list decoding performs closer to the Slepian-Wolf bound than the low density parity check accumulate (LDPCA) codes in the same framework.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.10-17
• /
• 2009

Wyner-Ziv video coding is a new video compression paradigm based on distributed source coding theory of Slepian-Wolf and Wyner-Ziv. Wyner-Ziv coding enables light-encoder/heavy-decoder structure by shifting complex modules including motion estimation/compensation task to the decoder. Instead of performing the complicated motion estimation process in the encoder, the Wyner-Ziv decoder performs the motion estimation for the generation of side information in order to make the predicted signal of the Wyner-Ziv frame. The efficiency of side information generation deeply affects the overall coding performance, since the bit-rates of the Wyner-Ziv coding is directly dependent on side information. In this paper, an improved side information generation method using field coding is proposed. In the proposed method, top fields are coded with the existing SI generation method and bottom fields are coded with new SI generation method using the information of the top fields. Simulation results show that the proposed method improves the quality of the side information and rate-distortion performance compared to the conventional method.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.585-595
• /
• 2007

Distributed video coding is a new video coding paradigm based on Slepian-Wolf and Wyner-Ziv's information theory Distributed video coding whose decoder exploits side information transfers its computational burden from encoder to decoder, so that encoding with light computational power can be realized. RD performance is superior than that of standard video coding without motion compensation process but still has a gap with that of coding with motion compensation process. This parer introduces basic theory of distributed video coding and its structure and then shows RD performances of DVCs whose coding style is different from each other and of a DVC as a spatial scalable video coder.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.20-28
• /
• 2012

DVC(Distributed Video Coding) technique is a new paradigm, which is based on the Slepian-Wolf and Wyner-Ziv theorems. DVC offers not only flexible partitioning of the complexity between the encoder and decoder, but also robustness to channel errors due to intrinsic joint source-channel coding. Many conventional research works have been focused on the light video encoder and its rate-distortion performance improvement. However, in this paper, we propose a new DVC codec which is effectively applicable for error-prone environment. The proposed method adopts a quantiser without dead-zone and symmetric Gray code around zero value. Through computer simulations, the proposed method is evaluated by the bit errors position as well as the number of burst bit errors. Additionally, it is shown that the maximum and minimum transmission rate for the given application can be linearly determined by the number of bit errors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.329-336
• /
• 2010

Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.