Compression of correlated binary sources using turbo codes

被引:266
作者
Garcia-Frias, J [1 ]
Zhao, Y [1 ]
机构
[1] Univ Delaware, Dept Elect & Comp Engn, Newark, DE 19716 USA
关键词
correlated sources; Slepian-Wolf theorem; source coding; turbo codes;
D O I
10.1109/4234.957380
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We propose the use of punctured turbo codes for compression of correlated binary sources. Compression is achieved because of puncturing. The resulting performance is close to the theoretical limit provided by the Slepian-Wolf theorem. No information about the correlation between sources is required in the encoding process. The proposed source decoder utilizes iterative schemes, and performs well even when the correlation between the sources is not known in the decoder, since it can be estimated jointly with the iterative decoding process.
引用
收藏
页码:417 / 419
页数:3
相关论文
共 11 条
[1]  
ALJABRI AK, 1997, P CRYPT CIR UK DEC, P17
[2]  
[Anonymous], 1993, PROC IEEE INT C COMM, DOI 10.1109/ICC.1993.397441
[3]   ENCODING OF CORRELATED OBSERVATIONS [J].
FLYNN, TJ ;
GRAY, RM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (06) :773-787
[4]   Joint source-channel decoding of correlated sources over noisy channels [J].
Garcia-Frias, J .
DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2001, :283-292
[5]   UNIVERSAL CODING FOR THE SLEPIAN-WOLF DATA-COMPRESSION SYSTEM AND THE STRONG CONVERSE THEOREM [J].
OOHAMA, Y ;
HAN, TS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (06) :1908-1919
[6]   A constructive approach to distributed source coding with symmetric rates [J].
Pradhan, SS ;
Ramchandran, K ;
Koetter, R .
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, :178-178
[7]   NOISELESS CODING OF CORRELATED INFORMATION SOURCES [J].
SLEPIAN, D ;
WOLF, JK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (04) :471-480
[8]  
TAN YO, 2000, P ISIT 00 JUN, P344
[9]   ZERO-ERROR SIDE INFORMATION PROBLEM AND CHROMATIC NUMBERS [J].
WITSENHAUSEN, HS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (05) :592-593
[10]  
Zhao Q, 2001, IEEE DATA COMPR CONF, P263, DOI 10.1109/DCC.2001.917157