论文标题
上行链路分布式MIMO C-RAN的基于尺寸降低的信号压缩,较有限
Dimension Reduction-based Signal Compression for Uplink Distributed MIMO C-RAN with Limited Fronthaul Capacity
论文作者
论文摘要
本文提出了一个基于尺寸的基于尺寸的信号压缩方案,用于上行链路分布式MIMO云无线电访问网络(C-RAN),其总体过量接收天线,其中通过分布式的多ANTENNA接收器通过单个有限的可靠性可靠性可靠性fronthaul链接连接到中央处理器。我们首先表明,在量化噪声限制的操作下,在每个接收器上施加线性尺寸降低,然后以均匀的量化噪声水平在本地压缩的总和容量以近似值缩放的量度与fronthaul的容量缩放,并且可以在切割设置结合的固定间隙内。然后,最大化关节互信息的尺寸还原过滤器被证明是条件karhunen-loeve变换的截断形式,具有块坐标上升算法,用于查找给出的固定点。分析和数值结果表明,可以降低信号维度而不会大大丢失信息,尤其是在高信噪比下,可以保留使用过量天线的好处。然后,将该方法适用于接收器中不完美的通道状态信息的情况。该方案在所有领先的速率上都显着优于常规的局部信号压缩,并且在网络尺寸的复杂性线性代表了分布式MIMO C-RAN系统的可扩展解决方案。
This paper proposes a dimension reduction-based signal compression scheme for uplink distributed MIMO cloud radio access networks (C-RAN) with an overall excess of receive antennas, in which users are jointly served by distributed multi-antenna receivers connected to a central processor via individual finite-capacity fronthaul links. We first show that, under quantization noise-limited operation, applying linear dimension reduction at each receiver before compressing locally with a uniform quantization noise level results in a sum capacity that scales approximately linearly with fronthaul capacity, and can come within a fixed gap of the cut-set bound. The dimension reduction filters that maximize joint mutual information are then shown to be truncated forms of the conditional Karhunen-Loeve transform, with a block coordinate ascent algorithm for finding a stationary point given. Analysis and numerical results indicate that the signal dimension can be reduced without significant loss of information, particularly at high signal-to-noise ratio, preserving the benefits of using excess antennas. The method is then adapted for the case of imperfect channel state information at the receivers. The scheme significantly outperforms conventional local signal compression at all fronthaul rates, and with complexity linear in network size represents a scalable solution for distributed MIMO C-RAN systems.