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
Rate-Maximizing Mappings for Memoryless Relaying
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.
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 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, NEW YORK: IEEE , 2009, 694-698 p.Conference paper, Published paper (Refereed)
Abstract [en]

We study the problem of optimal design of relay mappings for the Gaussian relay channel in order to maximize the reliable transmission rate. We consider both Gaussian and modulation constrained signaling at the source. To optimize the relay mapping, we use an iterative integral equation as a necessary condition for optimality. The optimized relay mappings demonstrate significant rate improvement over conventional linear relaying (amplify-and-forward). The optimized mappings allow an efficient utilization of the side information received via the source destination link at the destination. Hence, the proposed mappings can be considered as an analog, memoryless approach to implementing compress-and-forward relaying with Wyner-Ziv compression in the relay.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 694-698 p.
Keyword [en]
CAPACITY THEOREMS, NETWORKS, CHANNEL
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-28930DOI: 10.1109/ISIT.2009.5205671ISI: 000280141400142Scopus ID: 2-s2.0-70449490898ISBN: 978-1-4244-4312-3 (print)OAI: oai:DiVA.org:kth-28930DiVA: diva2:399686
Conference
IEEE International Symposium on Information Theory (ISIT 2009) Seoul, SOUTH KOREA, JUN 28-JUL 03, 2009
Note
QC 20110223Available from: 2011-02-23 Created: 2011-01-25 Last updated: 2011-02-23Bibliographically 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
Zaidi, Ali AbbasNasir Khormuji, MajidYao, ShaSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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