Compression of binary sources with side information at the decoder using LDPC codes

被引：421

作者：

Liveris, AD ^{[1
]}

Xiong, ZX ^{[1
]}

Georghiades, CN ^{[1
]}

机构：

[1] Texas A&M Univ, Dept Elect Engn, College Stn, TX 77843 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2002年 / 6卷 / 10期

关键词：

channel coding; distributed source coding; LDPC codes; Slepian-Wolf theorem;

D O I：

10.1109/LCOMM.2002.804244

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We show how low-density parity-check (LDPC) codes can be used to compress close to the Slepian-Wolf limit for correlated binary sources. Focusing on the asymmetric case of compression of an equiprobable memoryless binary source with side information at the decoder, the approach is based on viewing the correlation as a channel and applying the syndrome concept. The encoding and decoding procedures are explained in detail. The performance achieved is seen to be better than recently published results using turbo codes and very close to the Slepian-Wolf limit.

引用

页码：440 / 442

页数：3

共 13 条

[11] Design of capacity-approaching irregular low-density parity-check codes [J].

Richardson, TJ ;

Shokrollahi, MA ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :619-637

[12] NOISELESS CODING OF CORRELATED INFORMATION SOURCES [J].

SLEPIAN, D ;

WOLF, JK .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (04) :471-480

[13] Nested linear/lattice codes for structured multiterminal binning [J].

Zamir, R ;

Shamai, S ;

Erez, U .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (06) :1250-1276

← 1 2 →