2014
DOI: 10.1109/lwc.2014.2362927
|View full text |Cite
|
Sign up to set email alerts
|

Compute-and-Forward on a Multi-User Multi-Relay Channel

Abstract: In this paper, we consider a system in which multiple users communicate with a destination with the help of multiple half-duplex relays. Based on the compute-and-forward scheme, each relay, instead of decoding the users' messages, decodes an integer-valued linear combination that relates the transmitted messages. Then, it forwards the linear combination towards the destination. Given these linear combinations, the destination may or may not recover the transmitted messages since the linear combinations are not… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
2

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 13 publications
0
6
0
2
Order By: Relevance
“…The authors propose an iterative coordinate descent method that focuses on the power allocation and integer coefficient selection processes for the optimization problem. The results reveal that CP&F shows better performance than lattice-based C&F. This work is later extended to a multi-user multi-relay cooperative scenario in [62]. Cooperative networks are also considered in [63]- [67].…”
Section: Sum Ratesmentioning
confidence: 95%
“…The authors propose an iterative coordinate descent method that focuses on the power allocation and integer coefficient selection processes for the optimization problem. The results reveal that CP&F shows better performance than lattice-based C&F. This work is later extended to a multi-user multi-relay cooperative scenario in [62]. Cooperative networks are also considered in [63]- [67].…”
Section: Sum Ratesmentioning
confidence: 95%
“…The optimization of the sum rate is partially dealt with in [26], [27] and [28]. In [26], [27], relay and user selection for a CBS employing C&F and its low complexity version, named Quantized C&F [29], are investigated.…”
Section: A Motivationmentioning
confidence: 99%
“…Although cooperative and centralized approaches decrease the probability of rank failure significantly, they require additional signaling overhead, feedback channels, or global CSI [19]- [21]. Assuming global CSI at the users, [22], [23], and [24] design transmit precoders for the users, to reduce the probability of selecting dependent equations by the relays. However, none of the mentioned methods remove the rank failure problem completely within the practical constraints of the system.…”
Section: Introductionmentioning
confidence: 99%