...
首页> 外文期刊>IEEE communications letters >Worst-Case Robust MIMO Transmission Based on Subgradient Projection
【24h】

Worst-Case Robust MIMO Transmission Based on Subgradient Projection

机译:基于子学平投影的最坏情况鲁棒MIMO传输

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

摘要

This letter studies robust multi-input multi-ouput (MIMO) transmission strategies, where the transmitter only has imperfect channel state information (CSI) and the transmission covariance matrix is designed to maximize the worst system capacity. We first extend Danskin's Theorem to complex spaces by the aid of Wirtinger's subgradients. Then, with the extended theorem, we propose a subgradient projection (SP) based algorithm to solve the covariance matrix, in which finding the worst channel error is key and can be formulated as a nonconvex minimization problem. We deploy the successive convex approximation (SCA) technique and create a sequence of convex problems to solve this problem. Simulation results demonstrate the robustness of the proposed algorithm.
机译:这封信研究强大的多输入多-oupt(MIMO)传输策略,其中发射机仅具有不完美的信道状态信息(CSI),并且传输协方差矩阵旨在最大化最差的系统容量。我们首先借助丝网的子分析将Danskin的定理扩展到复杂的空间。然后,利用扩展定理,我们提出了一种基于子缩影投影(SP)算法来解决协方差矩阵,其中找到最差信道错误是键,并且可以将其标准为非凸显最小化问题。我们部署连续凸近似(SCA)技术,并创建一系列凸面问题以解决此问题。仿真结果展示了所提出的算法的鲁棒性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号