一种准正交空时分组码的快速译码方法  

A fast decoding algorithm of quasi-orthogonal space-time block codes

作　　者：武萌[1] 尹训锋[2] 曾凡鑫[2] 

机构地区：[1]装甲兵工程学院控制工程系,北京100072 [2]重庆通信学院,重庆400035

出　　处：《重庆邮电学院学报（自然科学版）》2006年第5期585-588,共4页Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)

基　　金：国家自然科学基金资助项目(60272083)

摘　　要：准正交空时分组码可以对天线数大于2的复信号星座进行全速率的编码，但是准正交空时分组码采用成对最大似然译码（DML），其译码复杂性随信号星座数量呈指数增长。针对准正交空时分组码的这种缺点提出了一种快速最大似然译码（FML）算法。仿真及计算结果显示，在信号星座数较大时，采用快速最大似然译码方法可以在保证性能损失很小的前提下，使接收机的译码复杂性减少2～3个数量级，而且该方法可以推广到任意数量的发射天线。Quasi-orthogonal space-time block codes can provide full rate of complex signal constellation when more than two antennas are used at transmitter. Quasi-orthogonal space-time block codes use double maximum likelihood （DML） decoding at receiver~ the decoding complexity increases exponentially. In order to overcome the disadvantage, therefore, a fast maximum likelihook decoding for quasi-orthogonal space-time block codes is proposed. Simulation and calculation results show that the fast detection algorithm can reduce the complexity about two or three quantity under the precondition that DML and the performance reduces slightly, when the signal constellation is large. This fast decoding algorithm may be employed in arbitrary transmitting antennas.

关 键 词：准正交空时分组码 MIMO 成对最大似然译码(DML) 快速最大似然译码(FML) 

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