Papers
Topics
Authors
Recent
Search
2000 character limit reached

Two-Way Relay Channels: Error Exponents and Resource Allocation

Published 14 Jan 2009 in cs.IT and math.IT | (0901.1954v2)

Abstract: In a two-way relay network, two terminals exchange information over a shared wireless half-duplex channel with the help of a relay. Due to its fundamental and practical importance, there has been an increasing interest in this channel. However, surprisingly, there has been little work that characterizes the fundamental tradeoff between the communication reliability and transmission rate across all signal-to-noise ratios. In this paper, we consider amplify-and-forward (AF) two-way relaying due to its simplicity. We first derive the random coding error exponent for the link in each direction. From the exponent expression, the capacity and cutoff rate for each link are also deduced. We then put forth the notion of the bottleneck error exponent, which is the worst exponent decay between the two links, to give us insight into the fundamental tradeoff between the rate pair and information-exchange reliability of the two terminals. As applications of the error exponent analysis, 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 quasi-optimal solution that requires only knowledge of the capacity and cutoff rate of each link; and ii) the optimal power allocation under a total power constraint, which is formulated as a quasi-convex optimization problem. Numerical results verify our analysis and the effectiveness of the optimal rate and power allocations in maximizing the bottleneck error exponent.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.