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
Bidirectional Broadcast Channel With Random States Noncausally Known at the Encoder
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.ORCID iD: 0000-0002-7926-5081
2013 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 59, no 1, 64-75 p.Article in journal (Refereed) Published
Abstract [en]

In this work, coding for a discrete memoryless broadcast channel with random states and two receivers is studied. Each receiver knows one of the two information messages at the sender and wants to know the other one. Assuming the channel state sequence is noncausally known at the sender, an achievable rate region based on the Gel'fand-Pinsker coding strategy is derived and an outer bound to the capacity region is presented. Further, the capacity region for the special case where in addition one receiver knows the channel state is established. An equivalent characterization of an achievable rate region characterizing convex set is derived using Shannon's concept of transmit strategies. This characterization is used to derive an Arimoto-Blahut-like algorithm including a stopping criterion to compute the weighted rate-sum maxima, which can be used to characterize the whole achievable rate region. The tradeoff between the input distribution and the impact of the channel state, the necessity of the time-sharing operation, and the additive Gaussian channel case assuming Costa's choice of auxiliary random variables are discussed by examples.

Place, publisher, year, edition, pages
2013. Vol. 59, no 1, 64-75 p.
Keyword [en]
Achievable rates, broadcast channel, channel state, input optimization algorithm, receiver message cognition
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-99203DOI: 10.1109/TIT.2012.2217074ISI: 000312896600005Scopus ID: 2-s2.0-84871778586OAI: oai:DiVA.org:kth-99203DiVA: diva2:541647
Funder
ICT - The Next Generation
Note

QC 20130114

Available from: 2012-07-20 Created: 2012-07-20 Last updated: 2017-12-07Bibliographically 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.Skoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Information Theory
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 126 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