| Summary: | The paper proposes a low-complexity detection algorithm for spatial modulation. The proposed algorithm reduces the total complexity by reordering the receiving antennas. The algorithm combines the existing A-Star algorithm to layer and sort the receiving antennas, change the tree search structure and eliminate the wrong nodes, so that the selected branches include the optimal path as much as possible, which greatly reduces the number of required access nodes. The algorithm has approximately optimal BER performance and lower computational complexity. Compared with the maximum likelihood detection algorithm, the complexity is reduced by about 80%.
|
|---|