J4 ›› 2009, Vol. 36 ›› Issue (3): 563-572.

• 研究论文 • 上一篇    下一篇

4天线准正交空时分组码的设计与性能分析

解武1;曹家年1;王立莹2
  

  1. (1. 哈尔滨工程大学 信息与通信工程学院,黑龙江 哈尔滨  150001;
    2. 中国电子科技集团公司第54所,河北 石家庄  050081)
  • 收稿日期:2008-03-28 修回日期:2008-06-26 出版日期:2009-06-20 发布日期:2009-07-04
  • 通讯作者: 解武
  • 基金资助:

    国家部委基金资助(51401040703CB0102)

Design and performance analysis of quasi-orthogonal space-time block codes for four antennas

XIE Wu1;CAO Jia-nian1;WANG Li-ying2
  

  1. (1. School of Infor. and Comm. Eng., Harbin Eng. Univ., Harbin  150001, China;
    2. The 54th Research Institute of CETC, Shijiazhuang  050081,  China)
  • Received:2008-03-28 Revised:2008-06-26 Online:2009-06-20 Published:2009-07-04
  • Contact: XIE Wu

摘要:

分析了几种准正交空时分组码的结构及特点,提出两种新的4天线准正交分组码编码方案,增加了4天线准正交空时分组码的可用码字.在不增加译码复杂度的情况下,新的编码方案性能接近于TBH码和Jafarkhani码.比较了最大似然译码算法和QR分解译码算法.仿真结果表明,QR分解译码算法对新的准正交分组码具有较好的检测性能,译码复杂度降低.

关键词: MIMO系统, 准正交空时分组码, 最大似然译码, QR分解

Abstract:

This paper analyzes the structure and characteristics of several types of quasi-orthogonal space-time block codes (QSTBC). It proposes two new methods for QSTBC for four antennas which enrich the family of QSTBC. Experimental results indicate that the two new QSTBC have good performance as in TBH and Jafarkhani cases, while the decoding complexity is the same as that of other QSTBC. This paper has compared the Maximum Likelihood (ML) decoding algorithm and QR decomposition decoding algorithm for the new QSTBC. Simulation results indicate that the QR decoding algorithm has good performance and can reduce the computation complexity.

Key words: MIMO systems, QSTBC, Maximum Likelihood decoding, Matrix QR decomposition

中图分类号: 

  • TN911.22