Abstract
This letter presents a technique to reduce the complexity of the soft-output multiple-input multiple-output symbol detection based on Dijkstra's algorithm. By observing that the greedy behavior of Dijkstra's algorithm can entail unnecessary tree-visits for the symbol detection, this letter proposes a technique to evict non-promising candidates early from the search space. The early eviction technique utilizes layer information to determine if a candidate is promising, which is simple but effective. When the SNR is 30dB for 6×6 64-QAM systems, the average number of tree-visits in the proposed method is reduced by 72.1% in comparison to that in the conventional Dijkstra's algorithm-based symbol detection without the early eviction.
