DocumentCode :
2651235
Title :
Arimoto-Blahut algorithm for the bidirectional broadcast channel with side information
Author :
Oechtering, Tobias J. ; Andersson, Mattias ; Skoglund, Mikael
Author_Institution :
Sch. of Electr. Eng., R. Inst. of Technol. (KTH), Stockholm, Sweden
fYear :
2009
fDate :
11-16 Oct. 2009
Firstpage :
394
Lastpage :
398
Abstract :
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.
Keywords :
broadcast channels; information theory; Arimoto-Blahut algorithm; Shannon method; bidirectional broadcast channel; side information; weighted-rate sum maxima; Bidirectional control; Broadcast technology; Broadcasting; Conferences; Decoding; Information theory; Iterative algorithms; Probability distribution; Relays; Time sharing computer systems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2009. ITW 2009. IEEE
Conference_Location :
Taormina
Print_ISBN :
978-1-4244-4982-8
Electronic_ISBN :
978-1-4244-4983-5
Type :
conf
DOI :
10.1109/ITW.2009.5351384
Filename :
5351384
Link To Document :
بازگشت