With the development of innovative applications that require high reliability and low latency, ultra-reliable and low latency communications become critical for wireless networks. In this paper, the second-order coding rate of the coherent quasi-static Rayleigh-product MIMO channel is investigated. We consider the coding rate within O(1/\sqrt(Mn)) of the capacity, where M and n denote the number of transmit antennas and the blocklength, respectively, and derive the closed-form upper and lower bounds for the optimal average error probability. This analysis is achieved by setting up a central limit theorem (CLT) for the mutual information density (MID) with the assumption that the block-length, the number of the scatterers, and the number of the antennas go to infinity with the same pace. To obtain more physical insights, the high and low SNR approximations for the upper and lower bounds are also given. One interesting observation is that rank-deficiency degrades the performance of MIMO systems with FBL and the fundamental limits of the Rayleigh-product channel approaches those of the single Rayleigh case when the number of scatterers approaches infinity. Finally, the fitness of the CLT and the gap between the derived bounds and the performance of practical LDPC coding are illustrated by simulations.
翻译:随着需要高可靠性和低延迟的创新应用程序的发展,超可靠和低延迟通信对无线网络至关重要。本文研究了相干拟静态瑞利乘积MIMO信道的二阶编码速率。我们考虑在O(1/\sqrt(Mn))的能力范围内的编码速率,其中M和n分别表示发射天线数和块长度,并导出了最优平均误差概率的闭式上下界。假设块长度、散射体数和天线数与相同速度趋向于无穷大,通过建立互信息密度(MID)的中心极限定理(CLT)来实现此分析。为了获得更深入的物理洞察力,我们还给出了上下界的高和低信噪比近似值。一个有趣的观察是,秩缺失会降低FBL MIMO系统的性能和瑞利乘积通道的基本限制接近于单瑞利情况的限制,当散射体数趋于无穷大时。最后,我们通过模拟展示了CLT的适应性以及推导的界限和实际LDPC编码性能之间的差距。