应用于空间调制的低复杂度A~*检测算法

A Low Complexity A~* Detection Algorithm for Spatial Modulation

针对A~*检测算法复杂度仍然较高的问题,提出了一种将接收天线重排序的检测算法。在现有A~*检测算法的基础上增加接收天线分层排序的处理过程,使A~*检测算法中最先选择的节点所在的分支更有可能包含最优路径,更早地将不对的节点排除,大大减少树搜索时需要访问的节点数。所提算法能够获得近似最优的检测性能,同时,与最大似然检测算法相比复杂度降低了73%~89%。

In order to solve the high complexity problem of A＊ detection algorithm,a novel detection algo-rithm is proposed to order the received antennas. Based on the existing A＊ detection algorithms,it adds thehierarchical order process of received antennas,which is more likely to include the optimal path for thebranch of the first selected node in the A＊ detection algorithm and exclude the wrong nodes earlier. The al-gorithm can greatly reduce the number of nodes that need to be accessed when the tree search is per-formed. The complexity is reduced by about 73% - 89% compared with the maximum likelihood detectionalgorithm.