首页> 外文会议>IEEE International Conference on Computer and Communications >Conjugate Gradient Method Based Linear Precoding with Low-Complexity for Massive MIMO Systems
【24h】

Conjugate Gradient Method Based Linear Precoding with Low-Complexity for Massive MIMO Systems

机译:大规模MIMO系统中基于共轭梯度法的低复杂度线性预编码

获取原文

摘要

In massive multiple-input multiple-output (MIMO) systems, when the number of base station (BS) antennas is tremendous, regularized zero-forcing (RZF) precoding can achieve the near-optimal performance, but at the cost of high complexity due to the required matrix inversion of large size. To solve this problem, this paper proposes a precoding scheme based on conjugate gradient (CG) method, which avoids the channel matrix inversion in an iterative way. Compared with RZF precoding, this proposed precoding scheme is able to reduce the computational complexity by about one order of magnitude. Furthermore, the computational complexity of the proposed precoding scheme is lower than the previously proposed linear approximate Neumann series expansion (NSE) precoding scheme. Simulation results indicate that the proposed CG-based precoding outperforms the NSE precoding both in BER performance and achievable channel capacity performance. Moreover, it can approach the performance of RZF precoding after few iterations.
机译:在大规模多输入多输出(MIMO)系统中,当基站(BS)天线的数量巨大时,规则归零强制(RZF)预编码可以实现接近最佳的性能,但以高复杂度为代价到所需的大尺寸矩阵求逆。为了解决这个问题,本文提出了一种基于共轭梯度法的预编码方案,该方法避免了信道矩阵的迭代迭代。与RZF预编码相比,该提议的预编码方案能够将计算复杂度降低大约一个数量级。此外,提出的预编码方案的计算复杂度低于先前提出的线性近似诺伊曼级数展开(NSE)预编码方案。仿真结果表明,所提出的基于CG的预编码在BER性能和可实现的信道容量性能上均优于NSE预编码。而且,它可以在几次迭代后达到RZF预编码的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号