几种准正交空时分组码的编码方案分析  

An analysis of several quasi-orthogonal space-time block codes

作　　者：邵朝[1] 李维霞[1] 杨艳[1] 姚琼[1] 

机构地区：[1]西安邮电学院通信与信息工程学院,陕西西安710121

出　　处：《西安邮电学院学报》2012年第1期5-12,共8页Journal of Xi'an Institute of Posts and Telecommunications

基　　金：教育部新世纪优秀人才支持计划(NCET-08-0891);陕西省科技厅基金资助项目(2010JQ8030)

摘　　要：讨论了几种准正交空时码的编码及解码问题;分析了准正交空时码编码矩阵的缺秩问题及最大似然解码时至少有两个符号相关联的现象,即分析了准正交空时码的分集增益减小特性与最大似然解码复杂度的增加问题;阐释了通过星座图旋转固然可以保证准正交空时码的分集增益但却无法克服其最大似然解码复杂度的增加,因此,必须从编码矩阵本身出发来解决算法复杂度,为研究以"面向单符号"的最大似然解码算法奠定基础。最后给出了一定的计算机模拟结果以说明理论分析的有效性。A detail analysis of several quasi-orthogonal space-time coding and decoding schemes are provided.Both the quasi-orthogonal space-time coding matrices with rank deficiency and the maximum likelihood decoding being related to with at least two symbols are analyzed,i.e.,quasi-orthogonal space-time codes reduce the diversity gain and increasing the maximum likelihood decoding complexity.Rotating the constellation could guarantee the diversity gain but can not overcome the increasing complexities of the maximum likelihood decoding.Therefore,it is necessary to research ＂symbol orientated＂ decoding algorithm for the quasi-orthogonal space-time coding.Some results of computer simulations are given to illustrate the validity of theoretical analysis.

关 键 词：准正交空时码 分集增益 最大似然解码复杂度 星座图旋转 

分 类 号：TN911.23[电子电信—通信与信息系统]