Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks

Compute-and-forward (C&F) relaying in a multisource multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2016-05, Vol.20 (5), p.926-929
Main Authors: Molu, Mehdi M., Cumanan, Kanapathippillai, Burr, Alister
Format: Article
Language:English
Subjects:
Algorithms
Computation Rate
Computational modeling
Compute-and-Forward
Decoding
Encoding
Frame relay
Lattices
Mathematical model
Network coding
Physical layer Network Coding
Relays
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Compute-and-forward (C&F) relaying in a multisource multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes for choosing proper integer vectors in the relay nodes; this method is referred to as "blind C&F" and an algorithm is proposed which guarantees that each relay chooses the best integer vector that contains information from at least m source nodes. In the second algorithm that is described as "partially coordinated C&F," we assume that partial cooperation between the relay nodes and propose to exchange a single variable with which the relays are sorted for transmission. The performance of the proposed algorithm is nearly equivalent with optimal relaying, which requires significant overhead signaling.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2016.2537810