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

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.

DOI

10.1109/ITWF.2015.7360730

Citation

Barreal , A , Pääkkönen , J , Karpuk , D , Hollanti , C & Tirkkonen , O 2015 , A low-complexity message recovery method for Compute-and-Forward relaying . in ITW 2015 - 2015 IEEE Information Theory Workshop . , 7360730 , IEEE , pp. 39-43 , IEEE Information Theory Workshop , Jeju Island , Korea, Republic of , 11/10/2015 . https://doi.org/10.1109/ITWF.2015.7360730

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-201708036405

Collections

[article-cris] Perustieteiden korkeakoulu / SCI

Show all metadata