首页> 外文期刊>IEEE communications letters >Low-Complexity Near-Optimal Iterative Sequential Detection for Uplink Massive MIMO Systems
【24h】

Low-Complexity Near-Optimal Iterative Sequential Detection for Uplink Massive MIMO Systems

机译:上行大规模MIMO系统的低复杂度近最优迭代顺序检测

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

摘要

A novel low-complexity iterative sequential detection algorithm is proposed for near-optimal detection in uplink massive multiple-input multiple-output systems. In every iteration of the proposed algorithm, symbol transmitted from each user is detected sequentially while nulling the interference from all the other users. In contrast with recently proposed methods such as polynomial expansion, dual band Newton iteration, and Jacobi iteration, the proposed algorithm performs superior in terms of precision and computational complexity, and achieves better performance when the number of users increases. Simulation results validate superiority of the proposed algorithm over the recently reported methods.
机译:提出了一种新颖的低复杂度迭代顺序检测算法,用于上行大规模多输入多输出系统的近最优检测。在提出的算法的每次迭代中,从每个用户发送的符号都会被顺序检测,同时消除所有其他用户的干扰。与最近提出的诸如多项式展开,双频带牛顿迭代和雅可比迭代的方法相反,所提出的算法在精度和计算复杂度方面表现优异,并且当用户数量增加时实现更好的性能。仿真结果验证了所提出算法相对于最近报道的方法的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号