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
Noisy analog network coding for the two-way relay channel
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
2011 (English)In: Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 2011, 2065-2069 p.Conference paper, Published paper (Refereed)
Abstract [en]

An achievable rate region based on Shannon’s inner bound is given for the two-way relay channel. The relaying scheme operates on noisy received signals and generates new analog values to be transmitted to a destination. The scheme is therefore referred to as noisy analog network coding. The achievable rates are then optimized for a Gaussian two-way relay channel, when the relay is memoryless (this type of relaying is also known as instantaneous relaying). For one particular instance of the channel when the received signal at the relay is noiseless, it is shown that instantaneous noisy analog network coding can be optimal. For the noisy case, a numerical optimization algorithm is presented in order to optimize the instantaneous coding strategy. The optimized analog mapping turns out to be nonlinear and periodic. Finally, it is demonstrated that the achievable rates associated with optimized mappings can outperform those achieved by linear relaying, compress-and-forward, and can operate close to the recently proposed noisy network coding scheme.

Place, publisher, year, edition, pages
2011. 2065-2069 p.
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-59957DOI: 10.1109/ISIT.2011.6033919ISI: 000297465102069Scopus ID: 2-s2.0-80054823727ISBN: 978-1-4577-0596-0 (print)OAI: oai:DiVA.org:kth-59957DiVA: diva2:476789
Conference
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011; St. Petersburg; 31 July 2011 through 5 August 2011
Note
QC 20120113Available from: 2012-01-12 Created: 2012-01-12 Last updated: 2012-04-03Bibliographically 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
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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