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
Capacity bounds and mapping design for binary symmetric relay 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
2012 (English)In: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 14, no 12, 2589-2610 p.Article in journal (Refereed) Published
Abstract [en]

Capacity bounds for a three-node binary symmetric relay channel with orthogonal components at the destination are studied. The cut-set upper bound and the rates achievable using decode-and-forward (DF), partial DF and compress-and-forward (CF) relaying are first evaluated. Then relaying strategies with finite memory-length are considered. An efficient algorithm for optimizing the relay functions is presented.The Boolean Fourier transform is then employed to unveil the structure of the optimized mappings. Interestingly, the optimized relay functions exhibit a simple structure. Numerical results illustrate that the rates achieved using the optimized low-dimensional functions are either comparable to those achieved by CF orsuperior to those achieved by DF relaying.In particular, the optimized low-dimensional relaying scheme can improve on DF relaying when the quality of the source-relay link is worse than or comparable to that of other links.

Place, publisher, year, edition, pages
2012. Vol. 14, no 12, 2589-2610 p.
Keyword [en]
Binary fourier transform, Binary symmetric relay channel, Capacity bounds, Compress-and-forward, Decode-and-forward, Linear relaying
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-115483DOI: 10.3390/e14122589ISI: 000312606300013Scopus ID: 2-s2.0-84871602365OAI: oai:DiVA.org:kth-115483DiVA: diva2:588791
Funder
Swedish Research Council
Note

QC 20130116

Available from: 2013-01-16 Created: 2013-01-15 Last updated: 2017-12-06Bibliographically 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
Nasiri Khormuji, MajidSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
Entropy
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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