一种低复杂度的酉空时编译码方案  

Low-complexity encoding and decoding algorithm for the unitary space-time scheme

作　　者：姜艳平[1] 李晓辉[1] 寇卫东[1] 黄振华[1] 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071

出　　处：《西安电子科技大学学报》2009年第2期211-215,232,共6页Journal of Xidian University

基　　金：国家自然科学基金项目资助(60702060);西安电子科技大学研究生院创新基金资助(创05014)

摘　　要：提出了四副发射天线时的酉空时编码新方案,通过合并单位阵和空时分组编码矩阵,将接收端的最大似然译码简化为最大欧氏距离译码,从而大大降低了译码复杂度;根据瑞利衰落下的接收信噪比,推导出了信道容量下界.分析和仿真结果表明,该方案能够保证满分集增益,在误码性能接近最大似然译码的同时,译码时复数运算次数降低了85.6%,且信道容量下界与理论推导相一致.The new encoding algorithm for the unitary space-time scheme with four transmit antennas is proposed.By combining the unit matrix with the space-time block code matrix,maximum likelihood decoding at the receiver is simplified to maximum Euclidean distance decoding so that complexity for decoding is reduced greatly.On the basis of analysis on the receive SNR in the Rayleigh channel,the lower bound of the capacity is deduced.Analysis and simulation results show that full diversity gain is guaranteed by the scheme,the number of times of complex number calculation for decoding is reduced by 85.6% while the bit error rate of this scheme is approximate to that of the maximum likelihood decoding algorithm.And the lower bound of channel capacity coincides with the one deduced theoretically.

关 键 词：多输入多输出 酉空时码 奇异值 容量 

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