Compress-and-forward strategy for the relay channel with non-causal state information

Authors:
Bahareh Akhbari;Mahtab Mirmohseni;Mohammad Reza Aref
Affiliations:
Information Systems and Security Lab, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Information Systems and Security Lab, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Information Systems and Security Lab, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 4
Cited 1

Channel Coding in the Presence of Side Information

Foundations and Trends in Communications and Information Theory
Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information

IEEE Transactions on Information Theory
Capacity With Causal and Noncausal Side Information: A Unified View

IEEE Transactions on Information Theory
Cooperative Multiple-Access Encoding With States Available at One Transmitter

IEEE Transactions on Information Theory

On the capacity of a class of relay channels with orthogonal components and noncausal state information at source

ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a discrete memoryless state-dependent relay channel with non-causal Channel State Information (CSI). We investigate three different cases in which perfect channel states can be known non-causally: i) only to the source, ii) only to the relay or iii) both to the source and to the relay node. For these three cases we establish lower bounds on the channel capacity (achievable rates) based on using Gel'fand-Pinsker coding at the nodes where the CSI is available and using Compress-and-Forward (CF) strategy at the relay. Furthermore, for the general Gaussian relay channel with additive independent and identically distributed (i.i.d) states and noise, we obtain lower bounds on the capacity for the cases in which CSI is available at the source or at the relay. We also compare our derived bounds with the previously obtained results which were based on Decode-and-Forward (DF) strategy, and we show the cases in which our derived lower bounds outperform DF based bounds, and can achieve the rates close to the upper bound.