This paper considers the Gaussian half-duplex relay channel (G-HD-RC), i.e., a channel model where a source transmits a message to a destination with the help of a relay that can not transmit and receive at the same time. The generalized Degrees-of-Freedom of the G-HD-RC is exactly characterized. Then it is shown that the cut-set upper bound on the capacity can be achieved to within a constant gap, regardless of the actual value of the channel parameters, by either Partial-Decode-and-Forward or Compress-and-Forward. The performance of these coding strategies is evaluated with both random and deterministic switch at the relay. Numerical evaluations show that the actual gap is less than what analytically obtained, and that random switch achieves higher rates than deterministic switch. In order to get insights into practical schemes for the G-HD-RC that are less complex than Partial-Decode-and-Forward or Compress-and-Forward, the exact capacity of the Linear Deterministic Approximation (LDA) of the G-HD-RC at high-SNR is determined. It is shown that random switch and correlated non-uniform inputs bits are optimal for the LDA. It is then demonstrated that deterministic switch is to within one bit from the optimal LDA capacity. This latter scheme is translated into a coding strategy for the original G-HD-RC and its optimality to within a constant gap is proved. The gap attained by this simpler scheme is larger than that of Partial-Decode-and-Forward, thereby pointing to an interesting practical tradeoff between gap to capacity and complexity.
On the Gaussian half-duplex relay channel
IEEE Transactions on Information Theory, May 2014, Volume 60, N°05
Systèmes de Communication
© 2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PERMALINK : https://www.eurecom.fr/publication/3945