Change search
ReferencesLink to record
Permanent link

Direct link
On Instantaneous Relaying
KTH, School of Electrical Engineering (EES), Communication Theory.
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 Transactions on Information Theory, ISSN 0018-9448, Vol. 56, no 7, 3378-3394 p.Article in journal (Refereed) Published
Abstract [en]

The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) is investigated. For such channels, linear relaying is a suboptimal strategy in general. This is because a linear scheme merely repeats the received noisy signal and does not utilize the available degrees of freedom efficiently. At this background, nonlinear, symbol-wise (as opposed to block-wise) relaying strategies are developed to compensate for the shortcomings of the linear strategy. Optimal strategies are presented for two special cases of the general scenario, and it is shown that memoryless relaying can achieve the capacity. Furthermore, for the general Gaussian relay channel, a parametric piecewise linear (PL) mapping is proposed and analyzed. The achievable rates obtained by the PL mapping are computed numerically and optimized for a certain number of design parameters. It is concluded that optimized PL relaying always outperforms conventional instantaneous linear relaying (amplify-and-forward). It is also illustrated that the proposed PL relaying scheme can improve on sophisticated block Markov encoding (i.e., decode-and-forward) when the source-relay link is ill-conditioned (relative to other links). Furthermore, PL relaying can work at rates close to those achieved by side-information encoding (i.e., compress-and-forward), but at a much lower complexity.

Place, publisher, year, edition, pages
2010. Vol. 56, no 7, 3378-3394 p.
Keyword [en]
Achievable rates, instantaneous relaying, nonlinear relaying, piecewise linear (PL) mapping, relay channel
National Category
Computer Science
URN: urn:nbn:se:kth:diva-27301DOI: 10.1109/TIT.2010.2048444ISI: 000278812000028ScopusID: 2-s2.0-77953763719OAI: diva2:376695
QC 20101213Available from: 2010-12-13 Created: 2010-12-09 Last updated: 2011-12-14Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Khormuji, Majid NasiriSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Information Theory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link