TY - JOUR
T1 - Resource allocation for wireless fading relay channels
T2 - Max-min solution
AU - Liang, Yingbin
AU - Veeravalli, Venugopal V.
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received August 15, 2006; revised January 16, 2007. This work was supported by the National Science Foundation under CAREER/PECASE Grant CCR-00-49089 and Grants ANI-03-38807 and CNS-06-25637, and by a Vodafone Foundation Graduate Fellowship. The material in this paper was presented in part at the Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, November 2004.
PY - 2007/10
Y1 - 2007/10
N2 - Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, which consists of multiple independent three-terminal relay channels as subchannels. Lower and upper bounds on the capacity are derived, and are shown to match, and thus establish the capacity for the parallel relay channel with degraded subchannels. This capacity theorem is further demonstrated via the Gaussian parallel relay channel with degraded subchannels, for which the synchronized and asynchronized capacities are obtained. The capacity-achieving power allocation at the source and relay nodes among the subchannels is partially characterized for the synchronized case and fully characterized for the asynchronized case. The fading relay channel is then studied, which is based on the three-terminal relay channel with each communication link being corrupted by a multiplicative fading gain coefficient as well as an additive Gaussian noise term. For each link, the fading state information is assumed to be known at both the transmitter and the receiver. The source and relay nodes are allowed to allocate their power adaptively according to the instantaneous channel state information. The source and relay nodes are assumed to be subject to separate power constraints. For both the full-duplex and half-duplex cases, power allocations that maximize the achievable rates are obtained. In the half-duplex case, the power allocation needs to be jointly optimized with the channel resource (time and bandwidth) allocation between the two orthogonal channels over which the relay node transmits and receives. Capacities are established for fading relay channels that satisfy certain conditions.
AB - Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, which consists of multiple independent three-terminal relay channels as subchannels. Lower and upper bounds on the capacity are derived, and are shown to match, and thus establish the capacity for the parallel relay channel with degraded subchannels. This capacity theorem is further demonstrated via the Gaussian parallel relay channel with degraded subchannels, for which the synchronized and asynchronized capacities are obtained. The capacity-achieving power allocation at the source and relay nodes among the subchannels is partially characterized for the synchronized case and fully characterized for the asynchronized case. The fading relay channel is then studied, which is based on the three-terminal relay channel with each communication link being corrupted by a multiplicative fading gain coefficient as well as an additive Gaussian noise term. For each link, the fading state information is assumed to be known at both the transmitter and the receiver. The source and relay nodes are allowed to allocate their power adaptively according to the instantaneous channel state information. The source and relay nodes are assumed to be subject to separate power constraints. For both the full-duplex and half-duplex cases, power allocations that maximize the achievable rates are obtained. In the half-duplex case, the power allocation needs to be jointly optimized with the channel resource (time and bandwidth) allocation between the two orthogonal channels over which the relay node transmits and receives. Capacities are established for fading relay channels that satisfy certain conditions.
KW - Capacity
KW - Max-min
KW - Parallel relay channels
KW - Resource allocation
KW - Wireless relay channels
UR - http://www.scopus.com/inward/record.url?scp=35148864632&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35148864632&partnerID=8YFLogxK
U2 - 10.1109/TIT.2007.904996
DO - 10.1109/TIT.2007.904996
M3 - Article
AN - SCOPUS:35148864632
SN - 0018-9448
VL - 53
SP - 3432
EP - 3453
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 10
ER -