首页> 外文会议>International Conference on Computing, Networking and Communications >Approximative Matrix Inversion Based Linear Precoding for Massive MIMO Systems
【24h】

Approximative Matrix Inversion Based Linear Precoding for Massive MIMO Systems

机译:适用于大规模MIMO系统的基于近似矩阵求逆的线性预编码

获取原文

摘要

The linear zero-forcing (ZF) precoding has been considered as one of the practical techniques for massive multipleinput multiple-output (MIMO) systems. However, it involves complicated matrix inversion of high dimension. To approximate the channel matrix inversion of ZF precoding, we propose a joint Chebyshev iteration and Neumann series (Joint-CINS) precoding scheme, which is essential to improve the convergence rate of the Neumann series (NS) precoding. In addition, the Chebyshev iteration (CI) method is exploited to efficiently search direction for the Neumann series. Moreover, the iteration result of CI method is employed to reconstruct the Neumann series expansion to further speed up the convergence rate. Theoretical analysis demonstrates that the proposed Joint-CINS precoding scheme exhibits a faster convergence rate than the existing NS precoding. Simulation results indicate that the proposed JointCINS precoding scheme can achieve the satisfactory bit-errorrate (BER) performance and sum-rate approaching performance with smaller number of iterations than some previously proposed schemes.
机译:线性迫零(ZF)预编码已被视为大规模多输入多输出(MIMO)系统的实用技术之一。但是,它涉及复杂的高维矩阵求逆。为了近似ZF预编码的信道矩阵求逆,我们提出了联合Chebyshev迭代和Neumann序列(Joint-CINS)的预编码方案,这对于提高Neumann序列(NS)的收敛速度是必不可少的。另外,利用Chebyshev迭代(CI)方法可以有效地搜索Neumann级数的方向。此外,CI方法的迭代结果被用于重构Neumann级数展开,以进一步加快收敛速度​​。理论分析表明,所提出的联合CINS预编码方案比现有的NS预编码具有更快的收敛速度。仿真结果表明,与某些先前提出的方案相比,所提出的JointCINS预编码方案可以以较少的迭代次数获得令人满意的误码率(BER)性能和总速率逼近性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号