Results 101 to 110 of about 160 (137)

Coding for the Slepian-Wolf problem with turbo codes

GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002
This paper proposes a practical coding scheme for the Slepian-Wolf problem of separate encoding of correlated sources. Finite-state machine (FSM) encoders, concatenated in parallel, are used at the transmit side and an iterative turbo decoder is applied at the receiver.
J. Bajcsy, P. Mitran
openaire   +1 more source

LDPC codes for the Slepian-Wolf coding

2012 National Conference on Communications (NCC), 2012
LDPC codes are among the few FEC schemes that have been used for distributed data compression schemes, like the Slepian-Wolf encoding. An LDPC code having good degree distribution polynomials, along with a large girth and large minimum distance, can compress close to the Slepian-Wolf limit.
openaire   +1 more source

On Universal Variable-Rate Slepian-Wolf Coding

2008 IEEE International Conference on Communications, 2008
Lower and upper bounds on the reliability region of universal variable-rate Slepian-Wolf coding are derived.
J. Chen, D.-K. He, A. Jagmohan, L. A. Lastras-Montano   +3 more
openaire   +1 more source

Linear code duality between channel coding and Slepian-Wolf coding

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015
We study the duality between channel coding and Slepian-Wolf coding in the linear coding framework. We show how a code (both its encoder and decoder) for a symmetric channel coding problem can be used to design a code for a general Slepian-Wolf problem. Conversely, we show how a code for a symmetric Slepian-Wolf problem can be used to design a code for
Lele Wang, Young-Han Kim
openaire   +1 more source

On the Redundancy of Slepian–Wolf Coding

IEEE Transactions on Information Theory, 2009
In this paper, the redundancy of both variable and fixed rate Slepian-Wolf coding is considered. Given any jointly memoryless source-side information pair {(Xi, Yi)}i=1 infin with finite alphabet, the redundancy Rn(isinn) of variable rate Slepian-Wolf coding of X1 n with decoder only side information Y1 n depends on both the block length n and the ...
Da-ke He, Luis A. Lastras-Montano, En-hui Yang, Ashish Jagmohan, Jun Chen   +4 more
openaire   +1 more source

Rate-adaptive turbo-syndrome scheme for Slepian-Wolf Coding

2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, 2007
No ...
Roumy, Aline, Lajnef, Khaled, Guillemot, Christine   +2 more
openaire   +2 more sources

Slepian-Wolf coding over broadcast channels

IEEE Transactions on Information Theory, 2006
We discuss reliable transmission of a discrete memoryless source over a discrete memoryless broadcast channel, where each receiver has side information (of arbitrary quality) about the source unknown to the sender. When there are K=2 receivers, the optimum coding strategy using separate and stand-alone source and channel codes is to build two ...
openaire   +1 more source

Slepian-Wolf coding for nonuniform sources using turbo codes

Data Compression Conference, 2004. Proceedings. DCC 2004, 2004
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem (Z. Tu et al., 2003). This paper studies the case when sources are i.i.d. but nonuniformly distributed. It is firstly shown that any algebraic binning scheme based on linear codes is optimal for nonuniform sources only ...
null Jing Li, null Zhenyu Tu, R.S. Blum
openaire   +1 more source

Slepian-Wolf Polar Coding with Unknown Correlation

2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2019
We consider the source coding problem of a binary discrete memoryless source with correlated side information available only at the receiver whose conditional distribution given the source is unknown to the encoder. We propose two methods based on polar codes to attain the achievable rates under this setting.
Karthik Nagarjuna Tunuguntla, Paul H. Siegel   +1 more
openaire   +1 more source

Slepian-Wolf coding with a mismatched decoder

2008 IEEE International Symposium on Information Theory, 2008
Slepian-Wolf coding with a mismatched decoding metric is studied. Two different dualities between Slepian-Wolf coding and channel coding under mismatched decoding are established. These two dualities provide a systematic framework for comparing linear Slepian-Wolf codes, nonlinear Slepian-Wolf codes, and variable-rate Slepian-Wolf codes.
Jun Chen, Da-ke He, Ashish Jagmohan
openaire   +1 more source