Distributed source coding using short to moderate length rate-compatible LDPC codes: The entire Slepian-Wolf rate region

被引:40
作者
Sartipi, Mina [1 ]
Fekri, Faramarz [2 ]
机构
[1] Univ Tennessee, Sch Engn & Comp Sci, Chattanooga, TN 37403 USA
[2] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA
基金
美国国家科学基金会;
关键词
Slepian-Wolf theorem; distributed source coding; LDPC codes; rate-compatible codes; non-uniform error correction; unequal error protection;
D O I
10.1109/TCOMM.2008.060006
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we propose a scheme for distributed source coding of correlated sources using a single systematic LDPC code. In particular, since we are interested in wireless sensor network applications, we consider LDPC codes with short to moderate lengths that achieve every arbitrary coding rate on the Slepian-Wolf rate region. We simplify the distributed source coding problem to the rate-compatible LDPC code design with an unequal error protection property. The decoders communicate to each other to exchange information bits prior to decoding. However, thereafter, each performs the decoding independently. Therefore, errors in one decoder do not affect the other one. The simulation results confirm that the gap from the theoretical limit remains almost the same for different rates on the Slepian-Wolf rate region. First, we consider two correlated sources. We show that our proposed scheme improves the performance of distributed source coding of two sources considerably. This benefit is more stressed for application with short to moderate length sequences. Then, we study distributed source coding of three sources. As a special case, we investigate three sources that are pairwise correlated with the same correlation probability. We show that the gap from the theoretical limit is smaller than that of previous work. We also investigate the distributed source coding of correlated sources when there is no prior knowledge of the correlation parameter at the time of code design. We note that although the proposed distributed source coding is well suited for sensor networks (where sequences with less than 10000 bits are used), the method can be generalized to other distributed source coding applications.
引用
收藏
页码:400 / 411
页数:12
相关论文
共 26 条
[1]   Compression with side information using turbo codes [J].
Aaron, A ;
Girod, B .
DCC 2002: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2002, :252-261
[2]  
Bajcsy J, 2001, GLOB TELECOMM CONF, P1400, DOI 10.1109/GLOCOM.2001.965721
[3]  
Cabarcas F, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P330
[4]   Compression of correlated binary sources using turbo codes [J].
Garcia-Frias, J ;
Zhao, Y .
IEEE COMMUNICATIONS LETTERS, 2001, 5 (10) :417-419
[5]   Joint source-channel decoding of correlated sources over noisy channels [J].
Garcia-Frias, J .
DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2001, :283-292
[6]   Symmetric and A-symmetric Slepian-Wolf codes with systematic and non-systematic linear codes [J].
Gehrig, N ;
Dragotti, PL .
IEEE COMMUNICATIONS LETTERS, 2005, 9 (01) :61-63
[7]  
Ha JS, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, P151
[8]  
Hossein PN, 2004, 2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, P215
[9]   A distributed source coding technique for correlated images using turbo-codes [J].
Liveris, AD ;
Xiong, ZX ;
Georghiades, CN .
IEEE COMMUNICATIONS LETTERS, 2002, 6 (09) :379-381
[10]  
Liveris AD, 2002, PROCEEDINGS OF THE 2002 IEEE WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING, P53