Improved Detection Technique for the Uncoded MIMO Systems Using an Efficient K-best Algorithm.

摘要

This paper presents a new algorithm for spatially multiplexed MIMO detection that exploits the resources available in the search procedure to enhance the error performance of the K-best approach of search. The proposed algorithm exploits the heuristics of the nodes and it is referred as the Heuristic K-best algorithm (HK-best). Unlike the conventional K-best algorithm, the HK-best algorithm sort the visited nodes in each layer based on the path metric and the heuristic. Simulation results shows a gain of 2dB compared to the conventional K-best algorithm for Symbol Error Rate (SER) equal to 10-6 and a 17% computational complexity reduction. In addition, the HK-best conserves the constant computational complexity in contrast to the other variants of the K-best algorithm.