...
首页> 外文期刊>Wireless Communications, IEEE Transactions on >Decentralized Coordinated Precoding for Dense TDD Small Cell Networks
【24h】

Decentralized Coordinated Precoding for Dense TDD Small Cell Networks

机译:密集TDD小型蜂窝网络的分散式协调预编码

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

摘要

Cellular networks need the densification of small eNBs (SeNBs) to face the tremendous data traffic demand growth, implying an interference increase and making transmit coordination a key enabler. This article proposes a decentralized coordinated precoding (D-CoP) for downlink (DL) weighted sum-rate maximization in dense MIMO TDD small cell networks (SCNs). Each SeNB designs its own precoding matrices based on channel state information (CSI) of the served users and knowledge of the interference-cost matrix that allows managing interference towards unintended users. A protocol is proposed to acquire the interference-cost matrix by processing the uplink (UL) received signal provided that: 1) channel reciprocity can be assumed and 2) all users participating in DL can transmit in UL with an adequate transmit filter. In contrast to existing transmit coordination techniques, D-CoP is fully scalable, avoids estimation of the interfering channels, and does not require information exchange between SeNBs. In case all parameters are perfectly acquired, an iterative algorithm is presented with demonstrated monotonic convergence when all SeNBs update its transmit precoders simultaneously. Further, the problem is reformulated in order to derive a robust D-CoP under imperfect CSI conditions. Finally, simulations in 3GPP LTE-Advanced SCNs show significant user packet throughput gains, without increasing the complexity associated to transmit coordination. Robustness to imperfect CSI and non-ideal channel reciprocity is shown through simulations.
机译:蜂窝网络需要小型eNB(SeNB)的密集化,以应对巨大的数据流量需求增长,这意味着干扰增加,并使传输协调成为关键的推动因素。本文提出了一种用于密集MIMO TDD小蜂窝网络(SCN)中的下行链路(DL)加权总和速率最大化的分散式协调预编码(D-CoP)。每个SeNB基于服务用户的信道状态信息(CSI)和干扰成本矩阵的知识来设计自己的预编码矩阵,该知识允许管理针对非预期用户的干扰。提出了一种协议,该协议通过处理上行链路(UL)接收信号来获取干扰代价矩阵,条件是:1)可以假定信道互易性; 2)所有参与DL的用户都可以在UL中使用适当的发送滤波器进行发送。与现有的传输协调技术相比,D-CoP具有完全可伸缩性,避免了干扰信道的估计,并且不需要SeNB之间的信息交换。如果完美地获取了所有参数,则当所有SeNB同时更新其发送预编码器时,将展示一种迭代算法,该算法具有已证明的单调收敛性。此外,为了在不完善的CSI条件下得出鲁棒的D-CoP,重新构造了问题。最后,在3GPP LTE高级SCN中的仿真显示了显着的用户数据包吞吐量增益,而没有增加与传输协调相关的复杂性。通过仿真显示了不完美的CSI的鲁棒性和非理想的信道互易性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号