Open AccessLossy Source Compression of Non‐Uniform Binary Source via Reinforced Belief Propagation over GQ‐LDGM Codes
Author(s) -
Zheng Jianping,
Bai Baoming,
Li Ying
Publication year - 2010
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.10.0210.0204
Subject(s) - binary number , lossy compression , code word , quantization (signal processing) , algorithm , distortion (music) , mathematics , source code , coding (social sciences) , computer science , discrete mathematics , topology (electrical circuits) , arithmetic , combinatorics , statistics , telecommunications , decoding methods , bandwidth (computing) , amplifier , operating system
In this letter, we consider the lossy coding of a non‐uniform binary source based on GF(q)‐quantized low‐density generator matrix (LDGM) codes with check degree d c =2. By quantizing the GF(q) LDGM codeword, a non‐uniform binary codeword can be obtained, which is suitable for direct quantization of the non‐uniform binary source. Encoding is performed by reinforced belief propagation, a variant of belief propagation. Simulation results show that the performance of our method is quite close to the theoretic rate‐distortion bounds. For example, when the GF(16)‐LDGM code with a rate of 0.4 and block‐length of 1,500 is used to compress the non‐uniform binary source with probability of 1 being 0.23, the distortion is 0.091, which is very close to the optimal theoretical value of 0.074.