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
Achievable rates for embedded bidirectional relaying in a cellular downlink
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
2010 (English)In: 2010 IEEE International Conference On Communications - ICC 2010, 2010, 5502395- p.Conference paper, Published paper (Refereed)
Abstract [en]

In this work we provide an achievable rate region for the cellular downlink with three users where two users want to communicate with each other. Due to the side information from the prior uplink, gains are achievable by combining bidirectional and classical broadcast channel coding strategies. A coding theorem for the bidirectional broadcast channel with random state non-causally known at the encoder is generalized to continuous alphabets and applied to Gaussian channels with an average power constraint. The single-user capacities are achievable if one decoder additionally knows the channel state. Accordingly, we see that a more comprehensive view on the information flow in a multi-user network can lead to a larger achievable rate region.

Place, publisher, year, edition, pages
2010. 5502395- p.
Series
IEEE International Conference on Communications, ISSN 1550-3607
Keyword [en]
Achievable rate, Achievable rate region, Average power, Broadcast channels, Channel state, Coding strategy, Coding theorems, Gaussian channels, Information flows, Multi-user networks, Random state, Side information, Single users, Broadcasting, Packet networks
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-30303DOI: 10.1109/ICC.2010.5502395ISI: 000287029400148Scopus ID: 2-s2.0-77955377977ISBN: 978-1-4244-6404-3 (print)OAI: oai:DiVA.org:kth-30303DiVA: diva2:404737
Conference
2010 IEEE International Conference on Communications Location: Cape Town, South Africa, Date: MAY 23-27, 2010
Note
QC 20110318Available from: 2011-03-18 Created: 2011-02-23 Last updated: 2011-09-28Bibliographically 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.Do, HieuSkoglund, 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: 46 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