Code Design for the Noisy Slepian-Wolf Problem

  title={Code Design for the Noisy Slepian-Wolf Problem},
  author={Arvind Yedla and Henry D. Pfister and Krishna R. Narayanan},
  journal={IEEE Transactions on Communications},
We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded (using codes of fixed rate) and transmitted over two independent binary memoryless symmetric channels. The capacity of each channel is characterized by a single parameter that is not known at the transmitter. System performance is evaluated by computing the set of channel parameters for which the system can successfully decode. This set is called the achievable channel parameter region (ACPR). The goal… 

Figures from this paper

Design of Capacity Approaching Ensembles of LDPC Codes for Correlated Sources using EXIT Charts
This paper provides asymptotic performance analysis using the concept of extrinsic information transfer (EXIT) charts and shows that as the average degree of the designed ensembles grow, the thresholds corresponding to the designedEnsembles approach the capacity.
Orthogonal Multiple Access With Correlated Sources: Achievable Region and Pragmatic Schemes
The ultimate achievable performance limits in terms of a multi-dimensional feasible region in the space of channel parameters are investigated, deriving insights on the impact of the number of sources and the design of pragmatic schemes, where the sources use “off-the-shelf” channel codes.
Orthogonal Multiple Access with Correlated Sources: Feasible Region and Pragmatic Schemes
In this paper, we consider orthogonal multiple access coding schemes, where correlated sources are encoded in a distributed fashion and transmitted, through additive white Gaussian noise (AWGN)
On the Construction of Polar Codes for Rate Adaptive Distributed Source Coding
The proposed polar distributed source coding with successive cancellation list decoding performs closer to the Slepian-Wolf bound than the low density parity check accumulate (LDPCA) codes in the same framework.
A Decentralized Receiver in Gaussian Interference
Bounds are developed on the maximum communications rate between a transmitter and a fusion node aided by a cluster of distributed receivers with limited resources for cooperation, all in the presence of an additive Gaussian interferer and are proven to be achievable and be tight with capacity when LAN resources are either ample or limited.
Achievable Rates for a LAN-Limited Distributed Receiver in Gaussian Interference
Bounds are found on the capacity of such a system with channel state information available at the helpers and in interference environments where the receivers experience correlated noise and demonstrate that such systems are robust in mitigating low-rank interferers.
Bounds on the information capacity of a broadcast channel with quantizing receivers
A base node seeks to receive to a broadcast. The base is too far away to observe the broadcast itself, and instead listens through a LAN to several helper nodes which can hear the broadcast. The
Distributed cooperative spatial multiplexing system
This thesis proposes a novel C-SM system design which includes a transmitter with two antennas, a single antenna receiver and a relay group with two single antenna relays, and discovers an error floor in this design.
Optimal Rate for Joint Source-Channel Coding of Correlated Sources Over Orthogonal Channels
Joint source-channel coding of multiple correlated sources transmitted over orthogonal channels is considered. Two optimization problems related to coding schemes are formulated: maximal common rate,
Models, statistics, and rates of binary correlated sources


Universality for the noisy Slepian-Wolf problem via spatial coupling
A noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels is considered and an area theorem for the joint decoder is derived and empirically show that threshold saturation occurs for this problem.
On code design for the Slepian-Wolf problem and lossless multiterminal networks
This work addresses the problem of practical code design for general multiterminal lossless networks where multiple memoryless correlated binary sources are separately compressed and sent; each decoder receives a set of compressed sources and attempts to jointly reconstruct them.
Can iterative decoding for erasure correlated sources be universal?
This paper considers a few iterative decoding schemes for the joint source-channel coding of correlated sources and shows that optimized LT codes can achieve the extremal symmetric point of the capacity region and that LT codes are not universal under iterative decode for this problem.
A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding
Simulations reveal encouraging joint decoding gain especially at low signal-to-noise ratios, and the scheme is attractive since separate refining of compression rate and error protection power makes the design easy and the performance controllable.
Universal codes for the Gaussian MAC via spatial coupling
This work derives an area theorem for the joint decoder and empirically show that threshold saturation occurs for this problem, and demonstrates near-universal performance for the problem using the proposed spatially-coupled coding system.
Slepian-Wolf Code Design via Source-Channel Correspondence
It is shown that, under density evolution, design of binary LDPC coset codes for Slepian-Wolf coding of an arbitrary memoryless source-side information pair reduces to design ofbinary LDPC codes for binary-input output-symmetric channels without loss of optimality.
Joint source-channel coding of binary sources with side information at the decoder using IRA codes
This work uses systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the decoder and simulated performance results are better than the recently published solutions using turbo codes and very close to the theoretical limit.
Slepian-Wolf type problems on the erasure channel
  • M. Luby, A. Shokrollahi
  • Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
This work provides an optimal solution to the simultaneous erasure Slepian-Wolf problem using rank-metric codes, provided that the field size is not too large.
A simple proof of threshold saturation for coupled scalar recursions
A simple proof of threshold saturation that applies to a broad class of coupled scalar recursions is presented and is surprisingly simple when compared to previous methods.
LDPC code design for transmission of correlated sources across noisy channels without CSIT
The main contribution of this paper is to demonstrate that properly designed LDPC can perform well simultaneously over a wide range of channel parameters.