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 the capacity of the binary symmetric relay channel with a finite memory relay
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
2010 (English)In: IEEE Information Theory Workshop 2010, Cairo, 2010, Vol. ITW 2010Conference paper, Published paper (Refereed)
Abstract [en]

We investigate capacity bounds for two instances of the binary symmetric relay channels. For one of these, we establish the capacity, and for the other one we present various capacity bounds. We first evaluate the cut-set bound and the rates achievable using decode-and-forward (DF) and compressand-forward (CF) relaying. We then focus on relaying strategies with finite memory-length and present an efficient algorithm for optimizing the relay functions. We use the boolean Fourier transform to unveil the structure of the optimized mappings. Interestingly, the optimized relay functions exhibit a simple structure. The numerical results show that the rates achieved using the optimized low-dimensional functions are either comparable or superior to those achieved by DF and CF 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 the quality of other links.

Place, publisher, year, edition, pages
Cairo, 2010. Vol. ITW 2010
Keyword [en]
Capacity bound, Compress and forward, Cut-set bound, Decode-and-forward, Dimensional functions, Efficient algorithm, Finite memory, Numerical results, Relay channels, Relay functions, Relay links, Relaying schemes, Relaying strategy, Simple structures, Algorithms, Fourier transforms, Information theory, Numerical analysis, Wavelet transforms, Optimization
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-30313DOI: 10.1109/ITWKSPS.2010.5503205Scopus ID: 2-s2.0-77954826719ISBN: 9781424463725 (print)OAI: oai:DiVA.org:kth-30313DiVA: diva2:404678
Conference
IEEE Information Theory Workshop 2010, ITW 2010; Cairo; 6 January 2010 through 8 January 2010
Note

QC 20110318

Available from: 2011-03-18 Created: 2011-02-23 Last updated: 2016-05-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
Nasiri Khormuji, MajidSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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