@article{barreal_pääkkönen_karpuk_tirkkonen_2015, 
  title={A Low-Complexity Message Recovery Method for Compute-and-Forward
  Relaying}, 
  abstractNote={The Compute-and-Forward relaying strategy achieves 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.}, 
  author={Barreal and Pääkkönen and Karpuk and Tirkkonen}, 
  year={2015}, 
  month={Apr}
  }