Achievable rates and capacity for Gaussian relay channels with correlated noises

Authors:
Jinhua Jiang;Andrea Goldsmith;Shuguang Cui
Affiliations:
Dept. of EE, Stanford University, Stanford, CA;Dept. of EE, Stanford University, Stanford, CA;Dept. of ECE, Texas A&M University, College Station, TX
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 4
Cited 0

Capacity of a class of relay channels with orthogonal components

IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks

IEEE Transactions on Information Theory
Bounds on capacity and minimum energy-per-bit for AWGN relay channels

IEEE Transactions on Information Theory
Generalized Backward Decoding Strategies for the Relay Channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the Gaussian relay channel where the additive noises at the relay and destination are correlated. We obtain achievable rates for the compress-and-forward and decode-and-forward relaying strategies, and compare them to each other and to the capacity upper bound. We show that neither scheme is uniformly best over all channel gains and correlation coefficients. We also derive specific relationships between the channel gains and noise correlations for which one of these schemes is capacity-achieving, thereby increasing the class of relay channels for which capacity is known.