Journal
IEEE INTERNET OF THINGS JOURNAL
Volume 9, Issue 12, Pages 10327-10339Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2021.3122026
Keywords
Decoding; Power control; Channel estimation; Antennas; Interference; Uplink; Programming; Cell-free (CF) massive MIMO (mMIMO); fractional programming; partial cooperative zero-forcing (PCZF) decoding; power control; target-SINR-tracking (TST)
Categories
Funding
- Shandong Provincial Natural Science Foundation [ZR2020QF002]
- National Science Foundation of China [61561046]
- Key Research & Development and Transformation Plan of Science and Technology Program for Tibet Autonomous Region [XZ201901GB-16]
Ask authors/readers for more resources
In this paper, a partial cooperative zero-forcing (PCZF) decoding scheme is proposed for the uplink cell-free massive MIMO system. Power control algorithms are introduced based on two criteria: maximizing the minimum achievable rate and maximizing the sum rate.
We propose a partial cooperative zero-forcing (PCZF) decoding scheme for the uplink cell-free massive MIMO system, wherein the neighboring access points (APs) around each user equipment (UE) share the channel state information (CSI) and jointly suppress the interference using the zero-forcing technique. Using asymptotic analysis, we derive a closed-form asymptotic expression for a lower bound on the achievable rates. Considering the unique and complex form of the achievable rates, we propose power control schemes according to two criteria. The first criterion is to maximize the minimum achievable rate. For this criterion, we propose a target-SINR-tracking (TST)-based bisection algorithm. Since the power control update functions are standard interference functions, the TST-based bisection method always converges to the optimal solution. The second criterion is to maximize the sum rate, for which we propose two power control algorithms: 1) randomization and scaling algorithm (RSA) and 2) fractional programming algorithm (FPA). In each iteration of the RAS algorithm, we first exploit the randomization technique to transform the sum-rate maximization problem into a series of power minimization problems, and then improve the sum rate by scaling. In the FP algorithm, we derive a lower bound on the sum rate, and then propose an iterative approach based on the Lagrangian dual transform and fractional programming to maximize the sum-rate lower bound. Numerical results validate the theoretical analysis and verify the efficiency of the proposed power control algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available