4.7 Article

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

期刊

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
卷 72, 期 2, 页码 2638-2642

出版社

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

关键词

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据