一种低复杂度的MIMO迭代检测算法  

Low complexity MIMO iterative detection algorithm

作　　者：徐琳[1] 吴玉成[1] 李江雯[1] 

机构地区：[1]重庆大学通信工程学院,重庆400044

出　　处：《计算机应用研究》2012年第2期739-740,753,共3页Application Research of Computers

基　　金：中国博士后基金资助项目(20090450787);重庆市教委科技项目(KJ08A09);"211工程"创新人才培养计划(S-09102)

摘　　要：为了降低MIMO系统联合检测算法的计算复杂度并保证系统性能,在球形译码算法的搜索中引入软信息构成改进的FP-MAP算法。该算法在计算信息符号的最大似然解时利用了其软先验信息,并在迭代过程中用以获得软外信息。分析与仿真结果表明,在同等的条件下,FP-MAP与LSD-MAP算法相比性能相当,但复杂度有所降低,且与广泛使用的SIC-MMSE算法相比具有明显的性能增益。In order to reduce complexity of the joint detection algorithm in MIMO system and to guarantee performance of the system,this paper proposed the FP-MAP algorithm,which used the soft information during the searching process of sphere decoding.The algorithm in calculating the maximum likelihood information used its soft priori information,and obtained the soft extrinsic information in the iterative process.Theoretical analysis and simulation shows that,compared with the LSD-MAP algorithm,FP-MAP algorithm has relatively lower complexity,but the BER performance of FP-MAP algorithm is equal to the LSD-MAP algorithm,compared with the SIC-MMSE algorithm,the performance FP-MAP algorithm is superior to SIC-MMSE algorithm.

关 键 词：联合检测 球形译码 软先验信息 最大似然 软外信息 

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