Gaussian orthogonal relay channels: optimal resource allocation and capacity

A Gaussian orthogonal relay model is investigated, where the source transmits to the relay and destination in channel 1, and the relay transmits to the destination in channel 2, with channels 1 and 2 being orthogonalized in the time-frequency plane in order to satisfy practical constraints. The total available channel resource (time and bandwidth) is split into the two orthogonal channels, and the resource allocation to the two channels is considered to be a design parameter that needs to be optimized. The main focus of the analysis is on the case where the source-to-relay link is better than the source-to-destination link, which is the usual scenario encountered in practice. A lower bound on the capacity (achievable rate) is derived, and optimized over the parameter /spl theta/, which represents the fraction of the resource assigned to channel 1. It is shown that the lower bound achieves the max-flow min-cut upper bound at the optimizing /spl theta/, the common value thus being the capacity of the channel at the optimizing /spl theta/. Furthermore, it is shown that when the relay-to-destination signal-to-noise ratio (SNR) is less than a certain threshold, the capacity at the optimizing /spl theta/ is also the maximum capacity of the channel over all possible resource allocation parameters /spl theta/. Finally, the achievable rates for optimal and equal resource allocations are compared, and it is shown that optimizing the resource allocation yields significant performance gains.

[1]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[2]  Gerhard Kramer,et al.  Capacity Theorems for the Multiple-Access Relay Channel , 2004 .

[3]  A.J. van Wijngaarden,et al.  On the white Gaussian multiple-access relay channel , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[4]  Abbas El Gamal,et al.  On Reliable Communication over Additive White Gaussian Noise Relay Channels , 2004 .

[5]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[6]  Mohammad Ali Khojastepour,et al.  ‘Cheap’ Relay Channel: A Unifying Approach to Time and Frequency Division Relaying , 2004 .

[7]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[8]  Yingbin Liang,et al.  Cooperative Relay Broadcast Channels , 2005, IEEE Transactions on Information Theory.

[9]  Junshan Zhang,et al.  Capacity Bounds and Power Allocation for the Wireless Relay Channel , 1990 .

[10]  G. Kramer.  Models and Theory for Relay Channels with Receive Constraints , 2004 .

[11]  Abbas El Gamal,et al.  Capacity of a class of relay channels with orthogonal components , 2005, IEEE Transactions on Information Theory.

[12]  Helmut Bölcskei,et al.  Fading relay channels: performance limits and space-time signal design , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[14]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[15]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[16]  Ashutosh Sabharwal,et al.  On the Capacity of 'Cheap' Relay Networks , 2003 .

[17]  Michael Gastpar,et al.  The multiple-relay channel: coding and antenna-clustering capacity , 2002, Proceedings IEEE International Symposium on Information Theory,.

[18]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[19]  Yingbin Liang,et al.  The impact of relaying on the capacity of broadcast channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..