Joint Source-Channel Coding with Correlated Interference

IEEE Transactions on Communications (Impact Factor: 1.98). 09/2010; 60(5). DOI: 10.1109/TCOMM.2012.032012.110185
Source: arXiv

ABSTRACT We study the joint source-channel coding problem of transmitting a
discrete-time analog source over an additive white Gaussian noise (AWGN)
channel with interference known at transmitter.We consider the case when the
source and the interference are correlated. We first derive an outer bound on
the achievable distortion and then, we propose two joint source-channel coding
schemes. The first scheme is the superposition of the uncoded signal and a
digital part which is the concatenation of a Wyner-Ziv encoder and a dirty
paper encoder. In the second scheme, the digital part is replaced by the hybrid
digital and analog scheme proposed by Wilson et al. When the channel
signal-tonoise ratio (SNR) is perfectly known at the transmitter, both proposed
schemes are shown to provide identical performance which is substantially
better than that of existing schemes. In the presence of an SNR mismatch, both
proposed schemes are shown to be capable of graceful enhancement and graceful
degradation. Interestingly, unlike the case when the source and interference
are independent, neither of the two schemes outperforms the other universally.
As an application of the proposed schemes, we provide both inner and outer
bounds on the distortion region for the generalized cognitive radio channel.

  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider the transmission of a Gaussian source over the two-user Gaussian broadcast channel in the presence of interference that is known to the transmitter. The interference is assumed to be correlated to the source and each user is interested in estimating the source signal. We propose a hybrid digital-analog (HDA) scheme based on proper combinations of power splitting, Wyner-Ziv and HDA Costa coding. The achievable (square-error) distortion region (inner bound) of this scheme is analyzed under source-channel bandwidth expansion; the matched bandwidth is treated as a special case. An outer bound on the distortion region is also derived by assuming full/partial knowledge of the interference at both users and by adapting the approach of Reznic et al. (2006). This outer bound can be tighter than the “trivial” outer bound found by assuming point-to-point communication.
    2014 27th Biennial Symposium on Communications (QBSC); 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: We investigate the problem of sending a Gaussian source over a Rayleigh fading channel with Gaussian correlated interference known to the transmitter using low-latency codes. For the matched bandwidth case between the source and the channel, we show that among all single-letter codes, the uncoded scheme achieves the lowest mean square error distortion under full correlation between source and interference, and hence it is optimal. To benefit from nonlinear strategies for other scenarios, we derive the necessary conditions for optimality and propose an iterative algorithm based on joint optimization between the encoder and the decoder. A reduced-complexity approach for the implementation of the design algorithm is presented based on Monte-Carlo (at the encoder side) and importance sampling (at the decoder side) techniques. Furthermore, the scalability of our low-latency scheme is improved by modifying the search process at the encoder side using a targeted search method.
    11/2014; 3(2):137-140. DOI:10.1109/WCL.2013.120513.130680
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we characterize the capacity regions of the Gaussian doubly dirty two-way channel (DD-TWC) in the presence of noise-dependent interference as well as input-dependent interference, and thereby we quantify the impact of such dependencies on the capacity region of the Gaussian DD-TWC. We also show that for the Gaussian DD-TWC with noise/input-dependent interference, adaptation (the use of formerly received signals in encoding process) is useless from a capacity point of view. The above-mentioned claims are proved by obtaining a capacity outer bound in the adaptive mode which is coincided with capacity inner bound derived in the non-adaptive mode.
    IEEE IWCIT 2014, Iran Workshop on Communication and Information Theory; 05/2014

Full-text (2 Sources)

Available from
Sep 19, 2014