Low Complexity Power Allocation Schemes in Regenerative Multi-user Relay Networks
Arvind Chakrapani, Robert Malaney, Jinhong Yuan

TL;DR
This paper introduces low-complexity power allocation schemes for multi-user relay networks that achieve near-optimal rates using statistical-CSI, significantly reducing computational complexity compared to existing methods.
Contribution
The paper develops two low-complexity power allocation schemes with order O(M log M) complexity for M-1-1 relay systems, close to maximum achievable rate under statistical-CSI.
Findings
Proposed schemes achieve rates close to optimal with much lower complexity.
Complexity reduction from O(M^3) to O(M log M).
Suitable for real-time multi-user relay system implementation.
Abstract
In relay assisted wireless communications, the multi-source, single relay and single destination system (an -1-1 system) is of growing importance, due to the increased demand for higher network throughput and connectivity. Previously, power allocation in -1-1 systems have assumed availability of instantaneous channel state information (CSI), which is rather idealistic. In this paper we consider an -1-1 Decode-and-Forward (DF), Full-Duplex, orthogonal frequencey division multiple access (OFDMA) based relay system with statistical-CSI and analyze the achievable rate of such a system. We show how can only be maximized by numerical power allocation schemes which has a high-complexity of order . By introducing a rational approximation in the achievable rate analysis, we develop two low-complexity power allocation schemes that can obtain a system achievable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
