4.7 Article

Decentralized Coordinated Precoding Design in Cell-Free Massive MIMO Systems for URLLC

Journal

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 72, Issue 2, Pages 2638-2642

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2022.3210253

Keywords

Cell-free massive MIMO; nonconvex optimization; precoding; URLLC

Ask authors/readers for more resources

Cell-free massive MIMO is a promising network that offers a significant improvement in achievable rate compared to conventional cellular massive MIMO systems. However, the commonly used Shannon-type achievable rate is not applicable for short-packet communication. In order to achieve ultra-reliable and low-latency communication in cell-free massive MIMO systems, we optimize the precoding vector at the access points to maximize the minimum user rate in both centralized and decentralized fashion.
Cell-free massive multiple-input multiple-output (MIMO) is a promising network to offer huge improvement of the achievable rate compared with conventional cellular massive MIMO systems. However, the commonly adopted Shannon-type achievable rate is only valid in the long block length regime that is not applicable to the emerging short-packet communication. To realize ultra-reliable and low-latency communication (URLLC) in cell-free massive MIMO systems, we optimize the precoding vector at the access points (APs) to maximize the minimum user rate in both the centralized and decentralized fashion. The design takes into account the impact of URLLC and we propose path-following algorithms (PFA) to address the considered problem which generates a sequence of advanced feasible points and converges to at least a locally optimal solution of the design problem. Moreover, we investigate the requirement of the precoding schemes, the length of the transmission duration, the number of antennas equipped at each AP, and the size of each AP cluster on the URLLC rate. Numerical results show that the decentralized PFA precoding can achieve 80% of the 95%-likely URLLC rate of the centralized precoding and 89% of the average URLLC rate with only 12% computational complexity of the centralized precoding.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available