A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A low-complexity message recovery method for Compute-and-Forward relaying
2015
2015 IEEE Information Theory Workshop - Fall (ITW)
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
doi:10.1109/itwf.2015.7360730
dblp:conf/itw/BarrealPKHT15
fatcat:qxudvp7spbcqvdjo7gzadkpug4