2015/04/13 by Amaro Barreal, Joonas Pääkkönen, Barreal, Amaro +7
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #Distributed Control Multi-Agent Systems #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1504.03182
5 figures, 5 pages, submitted
openalex publication_date 2015/04/13 · arxiv created 2015/04/20 · arxiv updated 2015/04/21 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
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.