低复杂度信道矩阵排序的MIMO固定复杂度球译码  

MIMO Fixed-Complexity Sphere Decoding with Low-Complexity Channel Matrix Ordering

作　　者：王世良[1] 孙松林[1] 景晓军[1] 黄海[1] 

机构地区：[1]北京邮电大学信息与通信工程学院,北京100876

出　　处：《北京邮电大学学报》2013年第5期41-45,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：中央高校基本科研业务费专项资金项目;国家高技术研究发展计划项目(2011AA01A204)

摘　　要：提出了一种多输入多输出通信系统中,根据最小均方误差(MMSE)译码器判决变量的可靠性进行信道矩阵排序的固定复杂度球译码(FSD)算法.首先进行MMSE译码,然后计算MMSE判决变量的可靠性,并将其作为信道矩阵排序的依据.该排序算法不仅能够有效降低传统FSD预处理阶段的复杂度,而且避免了FSD预处理阶段的串行特性,使得排序依据可并行计算,显著改善了译码实时性.仿真结果表明,低复杂度排序算法引起的性能损失很小,误符号率仍能接近最大似然译码.A multiple-input multiple-output fixed-complexity sphere decoder （FSD） with low-complexity channel matrix ordering is proposed based on reliabilities of the minimum mean square error （MMSE） de- coder＇ s decision variables. The proposed ordering algorithm first performs MMSE decoding, computes the reliabilities of MMSE decoder＇s decision variables, and finally orders channel matrix based on the relia- bilities. The algorithm not only effectively reduces the complexity of FSD in preprocessing stage, but also overcomes its sequential nature, more suitable for applications. Simulation result shows that the perform- ance loss caused by the low-complexity ordering algorithm is negligible and quasi-maximum likelihood performance can be achieved.

关 键 词：多输入多输出 球译码 固定复杂度球译码 

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