ROBUST AND FAST NON ASYMMETRIC DISTRIBUTED SOURCE CODING USING TURBO CODES ON THE SYNDROME TRELLIS

被引:1
作者
Toto-Zarasoa, V. [1 ]
Roumy, A. [1 ]
Guillemot, C. [1 ]
Herzet, C. [1 ]
机构
[1] INRIA, F-35042 Rennes, France
来源
2009 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1- 8, PROCEEDINGS | 2009年
关键词
Distributed source coding; channel coding; linear block codes; turbo codes; INFORMATION;
D O I
10.1109/ICASSP.2009.4960124
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
We consider the distributed compression of two (binary memoryless) correlated sources and propose a unique codec that can reach any point in the Slepian-Wolf region. In a previous method based on channel codes, the decoder multiply the compressed data by an inverse submatrix of the code. This multiplication presents two drawbacks. First, if turbo codes are used, the submatrix has no periodic structure SA. the whole inverse has to be stored and no fast implementation exists for the multiplication. Second, this multiplication may lead to error propagation. In this paper, we propose a method that is both robust and fast.
引用
收藏
页码:2477 / 2480
页数:4
相关论文
共 11 条
[1]   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
[2]   Compression of binary sources with side information at the decoder using LDPC codes [J].
Liveris, AD ;
Xiong, ZX ;
Georghiades, CN .
IEEE COMMUNICATIONS LETTERS, 2002, 6 (10) :440-442
[3]  
Pradhan S. S., 2000, Proceedings DCC 2000. Data Compression Conference, P363, DOI 10.1109/DCC.2000.838176
[4]   Distributed Source Coding Using Syndromes (DISCUS): Design and construction [J].
Pradhan, SS ;
Ramchandran, K .
DCC '99 - DATA COMPRESSION CONFERENCE, PROCEEDINGS, 1999, :158-167
[5]  
ROUMY A, 2007, IEEE J SELECTED TOPI
[6]  
ROUMY A, 2007, 41 AS C SIGN SYST CO
[7]   NOISELESS CODING OF CORRELATED INFORMATION SOURCES [J].
SLEPIAN, D ;
WOLF, JK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (04) :471-480
[8]  
STANKOVIC V, 2004, P IEEE DAT COMPR C, P302
[9]  
TAN P, 2005, P 43 ANN ALL C COMM
[10]   An efficient SF-ISF approach for the Slepian-Wolf source coding problem [J].
Tu, ZY ;
Li, J ;
Blum, RS .
EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, 2005, 2005 (06) :961-971