首页> 外文会议>IEEE International Conference on Progress in Informatics and Computing >An improved precoding of Approximative Matrix Inverse Computations based on norm minimization algorithm in massive MIMO system
【24h】

An improved precoding of Approximative Matrix Inverse Computations based on norm minimization algorithm in massive MIMO system

机译:基于常见MIMO系统中规范最小化算法的近似矩阵逆计算的改进预编码

获取原文

摘要

In massive multiple-input multiple-output (MIMO) system, scaling up the antennas of base station (BS) has a clear benefit on sum rate and energy efficiency, but the signal processing complexity can be very high and many algorithms cannot be implemented in practice for high hardware cost. Approximative Matrix Inverse Computations (AMIC) algorithm is a kind of low-complexity precoding for large multiuser MIMO systems, but the Bite Error Rate (BER) performance is shown to be not better than the classical MMSE precoding. To improve the BER performance of AMIC algorithm, in this paper, we use norm minimization algorithm to change the coefficient of the precoding matrix to improve the BER performance of AMIC algorithm. It can verify that the proposed algorithm can achieve better BER performance than the AMIC algorithm by using only a limited number of Neumann series iterations, and keep lower complexity. The proposed scheme is a compromise solution between complexity and BER performance.
机译:在大量多输入多输出(MIMO)系统中,缩放基站(BS)的天线对总和速率和能量效率有明显的益处,但信号处理复杂性可以非常高,并且无法实现许多算法练习高硬件成本。近似矩阵逆计算(AMIC)算法是大型多用户MIMO系统的一种低复杂性预编码,但是咬合误差率(BER)性能被示出不优于古典MMSE预编码。为了提高AMIC算法的BER性能,在本文中,我们使用规范最小化算法来改变预编码矩阵的系数来提高AMIC算法的BER性能。它可以验证所提出的算法可以通过仅使用有限数量的Neumann系列迭代来实现比AMIC算法更好的BER性能,并保持更低的复杂性。该方案是复杂性和BER性能之间的折衷解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号