arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.3602cs.ITmath.IT
收藏

用于云无线接入网络的鲁棒高效分布式压缩

Robust and Efficient Distributed Compression for Cloud Radio Access Networks

Seok-Hwan Park, Osvaldo Simeone, Onur Sahin, Shlomo Shamai

摘要:

这项工作研究分布式压缩的云无线接入网络的上行链路,其中多个多天线基站(BS)连接到一个中央单元,也被称为云解码器,通过容量受限的回程链路。由于在不同BS处接收的信号是相关的,所以分布式信源编码策略是潜在有益的,并且可以经由具有边信息的顺序信源编码来实现。针对带边信息的压缩问题,首先回顾了现有的基于最大可达速率和最小均方误差准则的压缩策略。观察到,在任一情况下,每个BS需要关于特定协方差矩阵的信息,以便实现分布式信源编码的优点。由于该协方差矩阵取决于与其他BS相对应的信道实现,因此针对其中关于在每个BS处可用的协方差的信息不完美的实际场景提出了鲁棒压缩方法。该问题是制定使用一个确定性的最坏情况下的方法,并提出了一种算法,实现了一个固定点的问题。然后,BS选择的目的是减少活动BS的数量,从而提高网络的能量效率。一个优化问题,其中压缩和BS选择联合执行引入一个稀疏诱导项的目标函数。一个迭代算法,提出了收敛到一个局部最优点。从数值结果中可以看出,所提出的鲁棒压缩方案补偿了由不完美的统计信息引起的大部分性能损失。此外,所提出的BS选择算法被视为执行接近更复杂的穷举搜索解决方案。

英文摘要:

This work studies distributed compression for the uplink of a cloud radio access network where multiple multi-antenna base stations (BSs) are connected to a central unit, also referred to as cloud decoder, via capacity-constrained backhaul links. Since the signals received at different BSs are correlated, distributed source coding strategies are potentially beneficial, and can be implemented via sequential source coding with side information. For the problem of compression with side information, available compression strategies based on the criteria of maximizing the achievable rate or minimizing the mean square error are reviewed first. It is observed that, in either case, each BS requires information about a specific covariance matrix in order to realize the advantage of distributed source coding. Since this covariance matrix depends on the channel realizations corresponding to other BSs, a robust compression method is proposed for a practical scenario in which the information about the covariance available at each BS is imperfect. The problem is formulated using a deterministic worst-case approach, and an algorithm is proposed that achieves a stationary point for the problem. Then, BS selection is addressed with the aim of reducing the number of active BSs, thus enhancing the energy efficiency of the network. An optimization problem is formulated in which compression and BS selection are performed jointly by introducing a sparsity-inducing term into the objective function. An iterative algorithm is proposed that is shown to converge to a locally optimal point. From numerical results, it is observed that the proposed robust compression scheme compensates for a large fraction of the performance loss induced by the imperfect statistical information. Moreover, the proposed BS selection algorithm is seen to perform close to the more complex exhaustive search solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑