编码MIMO系统中一种低复杂度次优软检测算法

A Low Complexity Sub-optimal Soft-detection  Algorithm for Coded MIMO System

  • 摘要: 提出了一种低复杂度次优编码MIMO系统软检测算法。在编码MIMO系统的迭代译码中,信道译码需要MIMO检测输出每一比特的软信息,而软信息的计算需要巨大的计算量。本文在不同的迭代次数中分别利用球形译码的硬判决信息和编码比特先验信息得到发射向量的估计值。在这个估计值的基础上计算MIMO检测中每一比特的软信息,从而避免了常规的穷尽搜索检测算法,减少了复杂度。通过分析和仿真,本算法在有限性能损失的前提下使复杂度得到了极大减少。在相同设置下,本算法的一帧数据仿真时间不到原算法的1/20,并且对于不同的调制方式复杂度基本不变,达到了性能和复杂度的较好折中。

     

    Abstract: A low complexity sub-optimal soft-detection algorithm for MIMO system is presented. Usually, the channel decoding needs every bit’s soft-information outputted from the MIMO detection in the iteration decoding for the coded MIMO system, but the calculation of the soft-information causes great complexity. The estimation of transmitted vector is obtained by using the hard decision of sphere decoding for the first iteration and using the sign of the priori information of the coded bits in other iterations in this paper. And then the soft-information is calculated for every bit of MIMO detection based on the estimation of transmitted vector. Therefore, the proposed algorithm avoids the conventional detection algorithm which is the exhaustive search, and decreases the computing complexity. The analysis and the simulation show that this algorithm reduces the complexity greatly at the cost of limited deterioration on performance. As for a frame data, the simulation’s time of the proposed algorithm is less than 1/20 of that of the conventional detection algorithm in the same setting and the complexity of the algorithm is constant on the whole for different modulations, it gets the better tradeoff between the performance and the complexity.

     

/

返回文章
返回