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
Analog Network Coding Mappings in Gaussian Multiple-Access Two-Hop Channels
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: ITW: 2009 IEEE INFORMATION THEORY WORKSHOP ON NETWORKING AND INFORMATION THEORY   , NEW YORK: IEEE , 2009, 276-280 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider the multiple-access two-hop channel where two source nodes transmit to a destination node via a relay node. The relaying function is memoryless, in contrast to the conventional schemes based on coding with long codewords. That is, we model the operation of the relay as a two-to-one deterministic mapping, which combines the two received analog signals from the sources. This procedure resembles the concept of network coding where information combining is applied in the intermediate nodes. However, as our mapping directly combines the received analog signals without decoding, we coin the term (memoryless) analog network coding mapping. In this paper, both linear and non-linear mappings are studied. In particular, the Archimedean spiral is used for the non-linear 2:1 mapping, inspired by similar work in the context of joint source-channel coding. We discuss both the achievable rate regions and sum rates and demonstrate significant gains of applying the proposed analog mappings in the relay.

Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 276-280 p.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-30219DOI: 10.1109/ITWNIT.2009.5158586ISI: 000273966100058Scopus ID: 2-s2.0-77950683816OAI: oai:DiVA.org:kth-30219DiVA: diva2:399113
Conference
IEEE Information Theory Workshop on Networking and Information Theory Volos, GREECE, JUN 10-12, 2009
Note
QC 20110221Available from: 2011-02-21 Created: 2011-02-21 Last updated: 2011-02-21Bibliographically 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
Yao, ShaSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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