混合的深度优先及宽度优先球形译码算法

结合深度优先及宽度优先算法,提出了一种混合算法,将搜索树分成两部分:一部分进行深度优先搜索；另一部分进行宽度优先搜索.利用深度优先搜索的结果裁剪宽度优先搜索中那些距离较大的点,以降低搜索复杂度.该算法合理地综合了2种算法的优点,具有较低的计算复杂度及较高的性能.仿真结果表明,该算法的性能与最优算法相比差别非常小,与宽度优先算法相比节省了大量的计算复杂度,在高信噪比的情况下,计算复杂度的节省尤其明显.

Hybrid algorithm of depth-first and breadth-first sphere decoding

A hybrid algorithm is proposed to combine the depth-first and breadth-first sphere decoding. The proposed algorithm divides the search tree into two parts. Depth-first search and breadth-first search are executed in these two parts respectively. The result of the depth-first search is used in the nodes pruning of the breadth-first search. The proposed algorithm takes advantages of merits of two algorithms and has lower calculation complexity and high performance. Simulation results show that the difference of the proposed algorithm and the optimal algorithm is neglectable. Much calculation complexity is saved, especially in high SNR.