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

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussavertaisarvioitu

Tutkijat

Organisaatiot

Kuvaus

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.

Yksityiskohdat

AlkuperäiskieliEnglanti
OtsikkoITW 2015 - 2015 IEEE Information Theory Workshop
TilaJulkaistu - 17 joulukuuta 2015
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaIEEE Information Theory Workshop - Jeju Island, Etelä-Korea
Kesto: 11 lokakuuta 201515 lokakuuta 2015

Julkaisusarja

Nimi
ISSN (painettu)0018-9448

Workshop

WorkshopIEEE Information Theory Workshop
LyhennettäITW
MaaEtelä-Korea
KaupunkiJeju Island
Ajanjakso11/10/201515/10/2015

Lataa tilasto

Ei tietoja saatavilla

ID: 1964591