空间调制信号的低复杂度球形译码算法  

Low complexity sphere decoding algorithm for spatial modulation signals

作　　者：王奔[1] 张文彬[1] 赵洪林[1] 

机构地区：[1]哈尔滨工业大学通信技术研究所,哈尔滨150080

出　　处：《哈尔滨工业大学学报》2017年第5期22-30,共9页Journal of Harbin Institute of Technology

基　　金：中央高校基本科研业务费专项资金资助(HIT.MKSTISP.201613)

摘　　要：为进一步降低球型译码算法(SM-SD)的复杂度,同时不影响算法的误比特性能,提出一种SM-SD算法,采用了不同于目前存在的SM-SD算法的复变量实数化方式,具有独特的搜索树结构,搜索树的相邻两层相互独立.分析了新算法的原理及搜索过程,通过矩阵运算理论分析了几种SM-SD算法的运算复杂度,然后在不同的空间调制系统中对SM-SD算法的误比特性能和运算复杂度进行仿真.理论分析和仿真结果表明:新算法的性能接近于最大似然算法,运算复杂度低于已有的各种类型的球型译码算法,因此更加适合于检测空间调制信号.In order to reduce more complexity while maintaining a good bit error rate performance,a new SM-SD algorithm is proposed. The new SM-SD algorithm employs a different real-valued equivalent transformation from existing sphere decoding algorithms,and it has a unique search tree structure,the adjacent two layers of the search tree are independent of each other. The principle and process of the new algorithm are analyzed, and the computation complexity of SM-SD algorithms is compared by the matrix analysis. Then,the bit error rate and computational complexity of SM-SD algorithms are compared by simulation in different SM systems. Theoretical analysis and simulation results show that the new SM-SD algorithm has a very close performance to MaximumLikelihood optimum detection,with lower computational complexity than other existing SM-SD algorithms. Thus,the new SM-SD algorithm is more suitable for SM signals detection.

关 键 词：空间调制 球形译码算法 SM-SD算法 最大似然检测 多输入多输出系统 

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