...
首页> 外文期刊>Selected Topics in Signal Processing, IEEE Journal of >Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 $times$ 2 and 4 $times$ 2 MIMO Systems
【24h】

Low ML-Decoding Complexity, Large Coding Gain, Full-Rate, Full-Diversity STBCs for 2 $times$ 2 and 4 $times$ 2 MIMO Systems

机译:低ML解码复杂度,大编码增益,全速率,全分集STBC,适用于2 $ times $ 2和4 $ times $ 2 MIMO系统

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

This paper deals with low maximum-likelihood (ML)-decoding complexity, full-rate and full-diversity space-time block codes (STBCs), which also offer large coding gain, for the 2 transmit antenna, 2 receive antenna (2 $times$ 2) and the 4 transmit antenna, 2 receive antenna (4 $times$ 2) MIMO systems. Presently, the best known STBC for the 2 $times$ 2 system is the Golden code and that for the 4 $times$ 2 system is the DjABBA code. Following the approach by Biglieri, Hong, and Viterbo, a new STBC is presented in this paper for the 2 $times$ 2 system. This code matches the Golden code in performance and ML-decoding complexity for square QAM constellations while it has lower ML-decoding complexity with the same performance for non-rectangular QAM constellations. This code is also shown to be information-lossless and diversity-multiplexing gain (DMG) tradeoff optimal. This design procedure is then extended to the 4 $times$ 2 system and a code, which outperforms the DjABBA code for QAM constellations with lower ML-decoding complexity, is presented. So far, the Golden code has been reported to have an ML-decoding complexity of the order of $M^{4}$ for square QAM of size $M$ . In this paper, a scheme that reduces its ML-decoding complexity to $M^{2}sqrt{M}$ is presented.
机译:本文针对2个发射天线,2个接收天线(2美元)处理低的最大似然(ML)解码复杂度,全速率和全分集的空时分组码(STBC),它们也提供较大的编码增益。 2个接收天线(2个接收天线)(4个2美元)和MIMO系统。当前,最著名的2 $ times $ 2系统的STBC是黄金代码,而4 $ times $ 2系统的STBC是DjABBA代码。遵循Biglieri,Hong和Viterbo的方法,本文针对2 x 2的系统提出了一种新的STBC。此代码在方形QAM星座图的性能和ML解码复杂度上与Golden代码匹配,而在非矩形QAM星座图的ML解码复杂度较低且性能相同的情况下。该代码还被证明是无损信息和分集多路复用增益(DMG)的最佳折衷方案。然后,将该设计过程扩展到4 x 2系统,并给出了一种代码,该代码在ML解码复杂度较低的情况下优于Qj星座的DjABBA代码。到目前为止,据报道,对于大小为$ M $的方形QAM,Golden代码的ML解码复杂度约为$ M ^ {4} $。在本文中,提出了一种将其ML解码复杂度降低到$ M ^ {2} sqrt {M} $的方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号