Coding Theorems of Information Theory
Coding Theorems of Information Theory
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Duplex schemes in multiple antenna two-hop relaying
EURASIP Journal on Advances in Signal Processing
Multiantenna bidirectional broadcast channels: optimal transmit strategies
IEEE Transactions on Signal Processing
The capacity region of the degraded multiple-input multiple-output compound broadcast channel
IEEE Transactions on Information Theory
Coding strategies for bidirectional relaying for arbitrarily varying channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Reliable communication under channel uncertainty
IEEE Transactions on Information Theory
An information-spectrum approach to capacity theorems for the general multiple-access channel
IEEE Transactions on Information Theory
Uniform power allocation in MIMO channels: a game-theoretic approach
IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
IEEE Transactions on Information Theory
Broadcast Capacity Region of Two-Phase Bidirectional Relaying
IEEE Transactions on Information Theory
Spectral efficient protocols for half-duplex fading relay channels
IEEE Journal on Selected Areas in Communications
Secrecy results for compound wiretap channels
Problems of Information Transmission
Capacity results for arbitrarily varying wiretap channels
Information Theory, Combinatorics, and Search Theory
Hi-index | 0.00 |
Bidirectional relaying is a promising approach to improve the performance in wireless networks such as sensor, ad-hoc, and even cellular systems. Bidirectional relaying applies to three-node networks, where a relay establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. First, the two nodes transmit their messages to the relay which decodes them. Then, the relay broadcasts a reencoded message in such a way that both nodes can decode their intended message using their own message as side information. We consider uncertainty in the channel state information (CSI) and assume that all nodes only know that the channel over which the transmission takes place is from a pre-specified set of channels. In this work, we concentrate on the second phase, which is called the compound bidirectional broadcast channel. We present a robust coding strategy which enables reliable communication under channel uncertainty and show that this strategy actually achieves the compound capacity. Further, we analyze scenarios where either the receivers or the transmitter have perfect CSI. We show that CSI at the receivers does not affect the maximal achievable rates, while CSI at the transmitter improves the capacity region. A numerical example and a game-theoretic interpretation complete this work.