首页> 外文会议>Information Theory Workshop, 2003. Proceedings. 2003 IEEE >Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction
【24h】

Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction

机译:使用晶格约简的MIMO系统的低复杂度接近最大似然检测和预编码

获取原文

摘要

We consider the lattice-reduction-aided detection scheme for 2/spl times/2 channels recently proposed by H. Yao and G.W. Wornell (see Proc. IEEE Globecom, 2002). By using an equivalent real-valued substitute MIMO channel model, their lattice reduction algorithm can be replaced by the well-known LLL (Lenstra-Lenstra-Lovasz) algorithm (Lenstra, A.K. et al., 1982), which enables the application of the algorithm to MIMO systems with arbitrary numbers of dimensions. We show how lattice reduction can also be favourably applied in systems that use precoding and give simulation results that underline the usefulness of this approach.
机译:我们考虑了H. Yao和G.W最近提出的针对2 / spl times / 2通道的晶格简化辅助检测方案。 Wornell(请参阅Proc。IEEE Globecom,2002年)。通过使用等效的实值替代MIMO信道模型,可以用众所周知的LLL(Lenstra-Lenstra-Lovasz)算法(Lenstra,AK等人,1982)代替其晶格缩减算法,从而能够应用任意维数的MIMO系统的算法。我们展示了晶格简化还可以如何很好地应用到使用预编码的系统中,并给出了强调此方法有用性的仿真结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号