TY - GEN
T1 - Reliable amplify-and-forward two-way relay networks (Invited Paper)
AU - Ngo, Hien Quoc
AU - Quek, Tony Q.S.
AU - Shin, Hyundong
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
N2 - In a two-way relay network, two terminals exchange information with the help of a relay. Due to its fundamental and practical importance, there has been an increasing interest in this channel. Recently, the notation of bottleneck error exponent has been introduced which is the worst exponent decay between the two links, gives us insight into the fundamental tradeoff between the rate pair and the information-exchange reliability of the two terminals. For its applications to the design of reliable twoway relay networks, we present two optimal resource allocations to maximize the bottleneck error exponent: i) the optimal rate allocation under a sum-rate constraint and its closed-form quasioptimal solution that requires only the knowledge of the capacity and cutoff rate of each link; and ii) the optimal power allocation under a total power constraint of two terminals in the presence of global channel state information, which can be efficiently determined via a sequence of convex feasibility problems in the form of second-order cone programs. Numerical results verify the effectiveness of the optimal rate and power allocations in maximizing the bottleneck error exponent.
AB - In a two-way relay network, two terminals exchange information with the help of a relay. Due to its fundamental and practical importance, there has been an increasing interest in this channel. Recently, the notation of bottleneck error exponent has been introduced which is the worst exponent decay between the two links, gives us insight into the fundamental tradeoff between the rate pair and the information-exchange reliability of the two terminals. For its applications to the design of reliable twoway relay networks, we present two optimal resource allocations to maximize the bottleneck error exponent: i) the optimal rate allocation under a sum-rate constraint and its closed-form quasioptimal solution that requires only the knowledge of the capacity and cutoff rate of each link; and ii) the optimal power allocation under a total power constraint of two terminals in the presence of global channel state information, which can be efficiently determined via a sequence of convex feasibility problems in the form of second-order cone programs. Numerical results verify the effectiveness of the optimal rate and power allocations in maximizing the bottleneck error exponent.
UR - http://www.scopus.com/inward/record.url?scp=77749340950&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77749340950&partnerID=8YFLogxK
U2 - 10.1109/WCSP.2009.5371755
DO - 10.1109/WCSP.2009.5371755
M3 - Conference contribution
AN - SCOPUS:77749340950
SN - 9781424456680
T3 - 2009 International Conference on Wireless Communications and Signal Processing, WCSP 2009
BT - 2009 International Conference on Wireless Communications and Signal Processing, WCSP 2009
T2 - 2009 International Conference on Wireless Communications and Signal Processing, WCSP 2009
Y2 - 13 November 2009 through 15 November 2009
ER -