2021
DOI: 10.1109/tit.2021.3093454
|View full text |Cite
|
Sign up to set email alerts
|

Compute-and-Forward in Large Relaying Systems: Limitations and Asymptotically Optimal Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 39 publications
0
5
0
Order By: Relevance
“…Forwarding strategy optimization is an important branch of CoF (see Table 1). In [15], a new scheduling mechanism (SCoF) is proposed. The SCoF proposes an asymptotically optimal, polynomial-time algorithm that allows the transmitting nodes to have better coding opportunities, thus maintaining the superior CoF capability without degrading with the increase in network size.…”
Section: Related Workmentioning
confidence: 99%
“…Forwarding strategy optimization is an important branch of CoF (see Table 1). In [15], a new scheduling mechanism (SCoF) is proposed. The SCoF proposes an asymptotically optimal, polynomial-time algorithm that allows the transmitting nodes to have better coding opportunities, thus maintaining the superior CoF capability without degrading with the increase in network size.…”
Section: Related Workmentioning
confidence: 99%
“…In [96], the authors investigate the feasibility of CP&F systems at dense networks. The performance of traditional CP&F methods tend to reduce as the number of transmitters increase.…”
Section: Sum Ratesmentioning
confidence: 99%
“…In this regard, CF strategy makes use of interferences to obtain significantly higher rates between users in a network. The CF technique can be utilized in the massive MIMO system and is envisioned to support the demands of fifth-generation (5G) and beyond mobile system [4,5].…”
Section: Introductionmentioning
confidence: 99%