Arimoto-Blahut algorithm for the bidirectional broadcast channel with side information
2009 (English)In: 2009 IEEE Information Theory Workshop: ITW 2009, Taormina, Sicily, 2009, Vol. ITW 2009, 394-398 p.Conference paper (Refereed)
The bidirectional broadcast channel with random states known at the encoder denotes a broadcast channel with two receivers where each receiver knows the message intended for the other and the transmitter knows the channel state. For such a channel we derive an Arimoto-Blahut-like algorithm to compute the weighted-rate sum maxima. To this end we provide an equivalent characterization of the achievable rate region using Shannon's method of transmit strategies, which we use to show that the optimal coding does not gain from time-sharing. Finally, the trade-off of the input distribution and the impact of the random state is discussed in two examples.
Place, publisher, year, edition, pages
Taormina, Sicily, 2009. Vol. ITW 2009, 394-398 p.
Achievable rate region, Broadcast channels, Channel state, Optimal coding, Random state, Side information, Time-sharing, Information theory, Broadcasting
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-30319DOI: 10.1109/ITW.2009.5351384ISI: 000305809200081ScopusID: 2-s2.0-76249111558ISBN: 978-142444983-5OAI: oai:DiVA.org:kth-30319DiVA: diva2:400115
2009 IEEE Information Theory Workshop, ITW 2009; Taormina, Sicily; 11 October 2009 through 16 October 2009
QC 201102242011-02-242011-02-232013-11-18Bibliographically approved