Binary Wyner–Ziv code design based on compound LDGM–LDPC structures

In this study, 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 quantisation...

Full description

Saved in:
Bibliographic Details
Published in:IET communications 2018-03, Vol.12 (4), p.375-383
Main Authors: Nangir, Mahdi, Ahmadian-Attari, Mahmoud, Asvadi, Reza
Format: Article
Language:English
Subjects:
binary codes
binary quantisation
binary Wyner‐Ziv code design
codecs
coding scheme
compound LDGM‐LDPC structures
decoding
encoding
iterative message‐passing algorithms
LDPC codes
low‐density generator‐matrix
low‐density parity‐check codes
message passing
parity check codes
Research Article
syndrome‐coding technique
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this study, 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 quantisation by employing LDGM codes and the second one is using the syndrome-coding technique by utilising LDPC codes. The decoding algorithm of the proposed scheme is based on the sum-product 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 utilising the iterative message-passing algorithms in both encoding and decoding, although theoretical results show that it is asymptotically achievable.
ISSN:1751-8628
1751-8636
1751-8636
DOI:10.1049/iet-com.2017.0032