TY - JOUR
T1 - Gaussian orthogonal relay channels
T2 - Optimal resource allocation and capacity
AU - Liang, Yingbin
AU - Veeravalli, Venugopal V.
N1 - Funding Information:
Manuscript received August 17, 2004; revised January 26, 2005. This work was supported by the National Science Foundation under CAREER/PECASE award CCF–0049089 and by a Vodafone Foundation Graduate Fellowship. The material in this correspondence was presented at the 38th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, March 2004.
PY - 2005/9
Y1 - 2005/9
N2 - 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 θ, 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 θ, the common value thus being the capacity of the channel at the optimizing θ. 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 θ is also the maximum capacity of the channel over all possible resource allocation parameters θ. 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.
AB - 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 θ, 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 θ, the common value thus being the capacity of the channel at the optimizing θ. 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 θ is also the maximum capacity of the channel over all possible resource allocation parameters θ. 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.
KW - Achievable rate
KW - Decode-and-forward relay
KW - Parallel relay channel
UR - http://www.scopus.com/inward/record.url?scp=26444451067&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=26444451067&partnerID=8YFLogxK
U2 - 10.1109/TIT.2005.853305
DO - 10.1109/TIT.2005.853305
M3 - Article
AN - SCOPUS:26444451067
SN - 0018-9448
VL - 51
SP - 3284
EP - 3289
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 9
ER -