首页> 外文会议>IEEE 6th Wireless and Mobile Computing, Networking and Communications >Computationally efficient lattice reduction for MIMO-OFDM systems
【24h】

Computationally efficient lattice reduction for MIMO-OFDM systems

机译:计算有效的MIMO-OFDM系统晶格简化

获取原文

摘要

We propose a computationally efficient lattice reduction (LR) algorithm for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in frequency-selective fading channels. In our proposed algorithm, we exploit the inherent feature of unimodular transformation matrix P that remains the same for frequency components which have relatively high amplitude correlation. We eliminate the redundant calculations by reducing brute-force LR iterations among adjacent subcarriers. We simulate the error performance and complexity of the proposed algorithm under various MIMO-OFDM system configurations. The results demonstrate that the proposed algorithm could significantly reduce the LR complexity by up to 90% multiplications and 99% divisions of brute-force LR while maintaining the system performance.
机译:我们为选频衰落信道中的多输入多输出(MIMO)正交频分复用(OFDM)系统提出了一种计算有效的晶格缩减(LR)算法。在我们提出的算法中,我们利用了单模变换矩阵P的固有特征,该固有特征对于振幅相关性相对较高的频率分量保持不变。通过减少相邻子载波之间的蛮力LR迭代,我们消除了冗余计算。我们在各种MIMO-OFDM系统配置下模拟了该算法的错误性能和复杂度。结果表明,所提出的算法可以在保持系统性能的同时,将LR的复杂度降低90%,从而使LR的复杂度大大降低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号