...
首页> 外文期刊>IEEE Transactions on Information Theory >Generalized Compression Strategy for the Downlink Cloud Radio Access Network
【24h】

Generalized Compression Strategy for the Downlink Cloud Radio Access Network

机译:下行云无线接入网的通用压缩策略

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper studies the downlink of a cloud radio access network (C-RAN) in which a centralized processor (CP) communicates with mobile users through base stations (BSs) that are connected to the CP via finite-capacity fronthaul links. Information theoretically, the downlink of a C-RAN is modeled as a two-hop broadcast-relay network. Among the various transmission and relaying strategies for such model, this paper focuses on the compression strategy, in which the CP centrally encodes the signals to be broadcast jointly by the BSs, then compresses and sends these signals to the BSs through the fronthaul links. We characterize an achievable rate region for a generalized compression strategy with Marton's multicoding for broadcasting and multivariate compression for fronthaul transmission. We then compare this rate region with the distributed decode-forward (DDF) scheme, which achieves the capacity of the general relay networks to within a constant gap, and show that the difference lies in that DDF performs Marton's multicoding and multivariate compression jointly as opposed to successively as in the compression strategy. A main result of this paper is that under the assumption that the fronthaul links are subject to a sum capacity constraint, this difference is immaterial; so, for the Gaussian network, the compression strategy based on successive encoding can already achieve the capacity region of the C-RAN to within a constant gap, where the gap is independent of the channel parameters and the power constraints at the BSs. As a further result, for C-RAN under individual fronthaul constraints, this paper also establishes that the compression strategy can achieve to within a constant gap to the sum capacity.
机译:本文研究了云无线电接入网络(C-RAN)的下行链路,其中中央处理器(CP)通过通过有限容量前传链路连接到CP的基站(BS)与移动用户进行通信。信息理论上,C-RAN的下行链路被建模为两跳广播中继网络。在这种模型的各种传输和中继策略中,本文着重于压缩策略,其中CP对要由BS共同广播的信号进行集中编码,然后将这些信号压缩并通过前传链路发送给BS。我们用广播的Marton多编码和前传传输的多变量压缩来表征广义压缩策略可达到的速率区域。然后,我们将该速率区域与分布式解码前馈(DDF)方案进行比较,该方案可将常规中继网络的容量保持在恒定的差距之内,并显示出差异在于DDF联合执行Marton的多编码和多变量压缩就像压缩策略一样本文的主要结果是,在假设前传链路受到总和容量约束的前提下,这种差异并不重要。因此,对于高斯网络,基于连续编码的压缩策略已经可以将C-RAN的容量区域达到恒定的间隙,其中间隙与信道参数和BS的功率约束无关。进一步的结果是,对于单个前传约束下的C-RAN,本文还确定了压缩策略可以在总容量的恒定范围内实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号