A low-complexity message recovery method for Compute-and-Forward relaying

Amaro Barreal, Joonas Pääkkönen, David Karpuk, Camilla Hollanti, Olav Tirkkonen

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)
107 Downloads (Pure)

Abstract

The Compute-and-Forward relaying strategy aims to achieve high computation rates by decoding linear combinations of transmitted messages at intermediate relays. However, if the involved relays independently choose which combinations of the messages to decode, there is no guarantee that the overall system of linear equations is solvable at the destination. In this article it is shown that, for a Gaussian fading channel model with two transmitters and two relays, always choosing the combination that maximizes the computation rate often leads to a case where the original messages cannot be recovered. It is further shown that by limiting the relays to select from carefully designed sets of equations, a solvable system can be guaranteed while maintaining high computation rates. The proposed method has a constant computational complexity and requires no information exchange between the relays.

Original languageEnglish
Title of host publicationITW 2015 - 2015 IEEE Information Theory Workshop
PublisherIEEE
Pages39-43
Number of pages5
ISBN (Print)9781467378529
DOIs
Publication statusPublished - 17 Dec 2015
MoE publication typeA4 Article in a conference publication
EventIEEE Information Theory Workshop - Jeju Island, Korea, Republic of
Duration: 11 Oct 201515 Oct 2015

Publication series

Name
ISSN (Print)0018-9448

Workshop

WorkshopIEEE Information Theory Workshop
Abbreviated titleITW
CountryKorea, Republic of
CityJeju Island
Period11/10/201515/10/2015

Fingerprint Dive into the research topics of 'A low-complexity message recovery method for Compute-and-Forward relaying'. Together they form a unique fingerprint.

Cite this