Compute-and-Forward in Large Relaying Systems: Limitations and Asymptotically Optimal Scheduling
- 29 June 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (9) , 6243-6265
Abstract
Compute and Forward (CF) is a coding scheme which enables receivers to decode linear combinations of simultaneously transmitted messages while exploiting the linear properties of lattice codes and the additive nature of a shared medium. The scheme was originally designed for relay networks, yet, it was found useful in other communication problems, such as MIMO communication. Works in the current literature assume a fixed number of transmitters and receivers in the system. However, following the increase in communication networks density, it is interesting to investigate the performance of CF when the number of transmitters is large. In this work, we show that as the number of transmitters, L, grows, CF becomes degenerated, in the sense that a relay prefers to decode only one (strongest) user instead of any other linear combination of the transmitted codewords, treating the other users as noise. Moreover, the system's sum-rate tends to zero as well. This makes scheduling necessary in order to maintain the superior abilities CF provides. We thus examine the problem of scheduling for CF. We start with insights on why good scheduling opportunities can be found. Then, we provide an asymptotically optimal, polynomial-time scheduling algorithm and analyze its performance. We conclude that with proper scheduling, CF is not merely non-degenerated, but, in fact, provides a gain for the system sum-rate, up to the optimal scaling law of O(loglogL).Keywords
All Related Versions
Funding Information
- European Union’s Horizon 2020 Research and Innovation Program through Superfluidity Project (671566)
- MAFAT
This publication has 39 references indexed in Scilit:
- Semantically Secure Lattice Codes for the Gaussian Wiretap ChannelIEEE Transactions on Information Theory, 2014
- Scenarios for 5G mobile and wireless communications: the vision of the METIS projectIEEE Communications Magazine, 2014
- Update-Efficiency and Local Repairability Limits for Capacity Approaching CodesIEEE Journal on Selected Areas in Communications, 2014
- The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference ChannelIEEE Transactions on Information Theory, 2014
- On the Capacity of Large Gaussian Relay NetworksIEEE Transactions on Information Theory, 2005
- Towards an information theory of large networks: an achievable rate regionIEEE Transactions on Information Theory, 2003
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Dependent Sets of Constant Weight Binary VectorsCombinatorics, Probability and Computing, 1997
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982