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
On Cooperative Downlink Transmission with Frequency Reuse
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: IEEE International Symposium on Information Theory - Proceedings, NEW YORK: IEEE , 2009, 849-853 p.Conference paper, Published paper (Refereed)
Abstract [en]

We study a three-node Gaussian relay channel with interference which is non-causally known at the source. It is assumed that the interference affects only the relay destination link. This model is motivated by a downlink scenario, where the source (base station), communicates with two destinations. We present several transmission strategies for this class of relay channels. Our proposed relaying schemes can be divided into two main categories: instantaneous relaying and causal relaying. In the former, the relay functionality is restricted to a memoryless, symbol-by-symbol mapping (linear as well as non-linear). While in the latter, the relay has an infinite memory and utilizes past received blocks to cooperate in the present block. For causal relaying, we investigate decode-and-forward (DF), compress-and-forward (CF), and combined DF and CF. To utilize the knowledge of the interference at the source, superposition coding at the source and Costa encoding at the relay are employed. One interesting observation is that instantaneous relaying can achieve higher rates than those achieved with causal relaying.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 849-853 p.
Keyword [en]
CAPACITY THEOREMS, RELAY, CHANNELS, NETWORKS
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-28932DOI: 10.1109/ISIT.2009.5205613ISI: 000280141400173Scopus ID: 2-s2.0-70449463767ISBN: 978-1-4244-4312-3 (print)OAI: oai:DiVA.org:kth-28932DiVA: diva2:399667
Conference
2009 IEEE International Symposium on Information Theory, ISIT 2009; Seoul; South Korea; 28 June 2009 through 3 July 2009
Note

Q 20150715

Available from: 2011-02-23 Created: 2011-01-25 Last updated: 2015-07-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Skoglund, Mikael

Search in DiVA

By author/editor
Khormuji, Majid NasiriSkoglund, 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: 23 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