Coding Theorems of Information Theory
Coding Theorems of Information Theory
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
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
Coding for the bidirectional broadcast channel with random states known at the encoder
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Coding strategies for bidirectional relaying for arbitrarily varying channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 0.00 |
We consider the broadcast phase of a spectrally efficient two-phase decode-and-forward protocol which is used by a relay node to establish a bidirectional communication between two nodes. In the first phase the two nodes transmit their message to the relay node which decodes the messages. In the succeeding phase the relay node broadcasts a re-encoded composition of them. We consider imperfect channel knowledge and assume that all nodes merely know that the channel used for the transmission belongs to a set of channels. This is called compound bidirectional broadcast channel. We derive a universal strategy which achieves capacity and show that perfect channel state information (CSI) at the receivers does not lead to an increased capacity region. Otherwise, perfect CSI at the transmitter can advantageously be used to enlarge the capacity region. Finally, we give a game-theoretic interpretation as a game against nature.