东南大学学报（英文版）2016，Vol.32Issue(1)：1-5,5.DOI:10.3969/j.issn.1003-7985.2016.01.001
基于低复杂度次优译码算法的准正交空时分组码
Low complexity suboptimal decode algorithms for quasi-orthogonal space time block codes
摘要
Abstract
Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing ZF /minimum mean square error MMSE decoding algorithm two low-complexity suboptimal decoding algorithms called pairwise-quasi-ZF and pairwise-quasi-MMSE decoders are proposed.First two transmit signals are detected by the quasi-ZF or the quasi-MMSE algorithm at the receiver.Then the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate BER performance of the proposed algorithms is compared with that of the current known decoding algorithms.Also the number of calculations of ZF MMSE quasi-ZF and quasi-MMSE algorithms is compared with each other.Simulation results show that the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasi-MMSE algorithms. The BER performance of the pairwise-quasi-ZF pairwise-quasi-MMSE decoder is equivalent to the pairwise-ZF pairwise-MMSE decoder while the computational complexity is significantly reduced.关键词
准正交空时分组码/低复杂度译码/pairwise-quasi-ZF/pairwise-quasi-MMSE/误比特率Key words
quasi-orthogonal/space-time/block/code QOSTBC/low-complexity decoding pairwise-quasi-ZF/pairwise-quasi-MMSE bit error rate BER分类
信息技术与安全科学引用本文复制引用
李正权,吴名,沈连丰,王志功,贾子彦..基于低复杂度次优译码算法的准正交空时分组码[J].东南大学学报（英文版）,2016,32(1):1-5,5.基金项目
The National Natural Science Foundation of China No．6157110861201248 the Open Research Fund of National Mo－bile Communications Research Laboratory of China No．2011D18 China Postdoctoral Science Foundation No．2012M511175． （）
