Semi-Probabilistic Repetition Schemes for Sporadic URLLC Traffic in Multiuser Massive MIMO Systems

Abstract

Massive multiple-input multiple-output (MIMO) assisted grant-free access is a compelling approach to support uplink ultra-reliable low-latency communications (URLLCs). It is a natural idea to combine massive MIMO and repetition transmission to further improve the reliability. However, excessive repetitions may increase the collision probability in multiuser scenarios and thus limit the reliability improvement. In this paper, we propose a novel semi-probabilistic repetition (SPRe) scheme for the massive multiuser MIMO (MU-MIMO) systems with grant-free access. By introducing a transmission probability for the replicas, the SPRe is more flexible than the popular repetition scheme, i.e., <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -repetition, and covers the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -repetition as a special case. Considering practical MU-MIMO systems with finite block-length coding, channel estimation errors, pilot collisions and the sporadic arrivals of URLLC traffic, the reliability of the proposed SPRe is thoroughly analyzed and derived in closed form. Through further asymptotic analysis, the optimal transmission probability to maximize the reliability of MU-MIMO is derived for the high-SNR regime and low-load scenarios. Moreover, the diversity gain of the proposed SPRe is also analyzed and it is proved that the optimal SPRe is superior to the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -repetition in terms of reliability. The analysis and superiority of the SPRe are finally verified through computer simulations.