URLLC in IRS-Aided MIMO Systems: Finite Blocklength Analysis and Design

Xin Zhang, Shenghui Song

Abstract

This paper investigates the ultra reliable and low latency communication (URLLC) performance of the IRS-aided MIMO system. The upper and lower bounds of the optimal average error probability (OAEP) for the coding rate $1/\sqrt{Mn}$ of the capacity are derived, where $n$ and $M$ represent the blocklength and the number of transmit antennas, respectively. To achieve this goal, a new central limit theorem (CLT) for the mutual information density over the IRS-aided MIMO system is derived in the asymptotic regime where the block-length, the IRS size, and number of the antennas go to infinity with the same pace. The CLT is then utilized to derive the closed form upper and lower bounds for the OAEP. Based on the analysis result, a gradient-based algorithm is proposed to minimize the lower bound of the OAEP by optimizing the phase shift of the IRS. Simulation results validate the fitness of the CLT and the effectiveness of the proposed algorithm in optimizing the theoretical bound, as well as the performance of practical LDPC code.

Introduction

The emergence of 6G networks necessitates the integration of Intelligent Reflecting Surfaces (IRS) and Ultra-Reliable Low-Latency Communication (URLLC). While IRS provides a means to reconfigure the wireless propagation environment, URLLC demands extreme reliability within tight latency constraints, often requiring short-packet transmissions. Traditional information theory, based on Shannon's capacity, assumes infinite blocklengths and is thus inadequate for URLLC. Finite blocklength (FBL) analysis is required to account for the rate penalty associated with short codewords. However, characterizing the FBL performance of IRS-aided MIMO systems is mathematically challenging due to the complex cascaded channel structure (transmitter-IRS-receiver). This work bridges this gap by providing a comprehensive FBL analysis and optimization framework.

Methods and Theoretical Framework

The authors utilize Random Matrix Theory (RMT) to analyze the system's fundamental limits. A core contribution is the derivation of a new Central Limit Theorem (CLT) for the Mutual Information Density (MID). They prove that as the number of antennas, IRS elements, and the blocklength grow to infinity proportionally, the MID converges to a Gaussian distribution. This result is pivotal as it simplifies the complex, non-linear channel characterization into a manageable Gaussian model defined by its mean and variance.

Validation of the Central Limit Theorem (CLT) for Mutual Information Density.

Building on this CLT, closed-form upper and lower bounds for the Optimal Average Error Probability (OAEP) are derived. To further enhance performance, a gradient-based algorithm (Algorithm 1) is proposed to optimize IRS phase shifts by minimizing the theoretical lower bound of the OAEP. The approach is validated using Monte-Carlo simulations and practical 1/2-rate LDPC codes from the WiMAX standard.

Key Results

Numerical evaluations confirm the theoretical findings. The derived bounds for error probability are shown to be tight, accurately capturing system behavior. A key finding is the strong correlation between the theoretical lower bound and the performance of practical coding schemes. As shown in the results, the proposed optimization algorithm significantly reduces the packet error rate (PER).

Packet Error Rate (PER) performance comparison between optimized and unoptimized IRS configurations.

For a target PER, the optimized IRS configuration provides a substantial power gain (several dBm) over unoptimized setups. Furthermore, the asymptotic analysis remains remarkably accurate even for finite-sized systems, demonstrating its practical utility for current hardware designs.

Conclusion

This research provides the first FBL analysis for IRS-aided MIMO systems, offering tight performance bounds and an effective optimization algorithm. While the current model assumes perfect channel state information (CSI) and ideal hardware, it establishes a foundational framework. Future work will address the challenges of imperfect CSI, hardware impairments like quantized phase shifts, and multi-user scenarios to further advance the deployment of IRS in URLLC-enabled 6G networks.

Summary updated

Abstract

This paper investigates the ultra reliable and low latency communication (URLLC) performance of the IRS-aided MIMO system. The upper and lower bounds of the optimal average error probability (OAEP) for the coding rate 1/sqrt(Mn) of the capacity are derived, where n and M represent the blocklength and the number of transmit antennas, respectively. To achieve this goal, a new central limit theorem (CLT) for the mutual information density over the IRS-aided MIMO system is derived in the asymptotic regime where the block-length, the IRS size, and number of the antennas go to infinity with the same pace. The CLT is then utilized to derive the closed form upper and lower bounds for the OAEP. Based on the analysis result, a gradient-based algorithm is proposed to minimize the lower bound of the OAEP by optimizing the phase shift of the IRS. Simulation results validate the fitness of the CLT and the effectiveness of the proposed algorithm in optimizing the theoretical bound, as well as the performance of practical LDPC code.
BibTeX
@inproceedings{zhang2023urllc,
  author = {Xin Zhang and Shenghui Song},
  title = {{URLLC in IRS-Aided MIMO Systems: Finite Blocklength Analysis and Design}},
  booktitle = {ACSSC},
  year = {2023},
  url = {https://openreview.net/forum?id=VF1257EY1T},
}
Figure