A Binary Wyner-Ziv Code Design Based on Compound LDGM-LDPC Structures

TL;DR

This paper presents a practical binary Wyner-Ziv coding scheme using nested LDGM and LDPC codes, achieving near-optimal compression bounds through iterative message-passing algorithms.

Contribution

It introduces a novel compound LDGM-LDPC structure for binary Wyner-Ziv coding, demonstrating asymptotic optimality with practical encoding and decoding algorithms.

Findings

Achieves the Wyner-Ziv bound asymptotically

Uses nested LDGM-LDPC codes for efficient coding

Employs iterative message-passing algorithms for encoding and decoding

Abstract

In this paper, a practical coding scheme is designed for the binary Wyner-Ziv (WZ) problem by using nested low-density generator-matrix (LDGM) and low-density parity-check (LDPC) codes. This scheme contains two steps in the encoding procedure. The first step involves applying the binary quantization by employing LDGM codes and the second one is using the syndrome-coding technique by utilizing LDPC codes. The decoding algorithm of the proposed scheme is based on the Sum-Product (SP) algorithm with the help of a side information available at the decoder side. It is theoretically shown that the compound structure has the capability of achieving the WZ bound. The proposed method approaches this bound by utilizing the iterative message-passing algorithms in both encoding and decoding, although theoretical results show that it is asymptotically achievable.