Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Arimoto-Blahut algorithm for the bidirectional broadcast channel with side information
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-0036-9049
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2009 (English)In: 2009 IEEE Information Theory Workshop: ITW 2009, Taormina, Sicily, 2009, Vol. ITW 2009, 394-398 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Keyword [en]
Achievable rate region, Broadcast channels, Channel state, Optimal coding, Random state, Side information, Time-sharing, Information theory, Broadcasting
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-30319DOI: 10.1109/ITW.2009.5351384ISI: 000305809200081Scopus ID: 2-s2.0-76249111558ISBN: 978-142444983-5 (print)OAI: oai:DiVA.org:kth-30319DiVA: diva2:400115
Conference
2009 IEEE Information Theory Workshop, ITW 2009; Taormina, Sicily; 11 October 2009 through 16 October 2009
Note

QC 20110224

Available from: 2011-02-24 Created: 2011-02-23 Last updated: 2013-11-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Oechtering, Tobias J.Skoglund, Mikael

Search in DiVA

By author/editor
Oechtering, Tobias J.Andersson, MattiasSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 47 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf