Adaptive Dijkstra’s Search Algorithm for MIMO detection
Keywords:Adaptive Dijkstra’s algorithm, Maximum likelihood (ML) decoding, multiple-input, multiple-output (MIMO) systems, tree- search detection, optimization
Employing Maximum Likelihood (ML) algorithm for signal detection in a large-scale Multiple-Input- Multiple-Output
(MIMO) system with high modulation order is a computationally expensive approach. In this paper an adaptive best first search detection algorithm is proposed. The proposed Adaptive Dijkstra’s Search (ADS) algorithm exploits the resources available in the search procedure to reduce the required number of nodes to be visited in the tree. A tunable parameter is used to control the number of the best possible candidate nodes required. Unlike the conventional DS, the ADS algorithm results in signal detection with low computation complexity and quasi-optimal performance for systems under low and medium SNR regimes. Simulation results demonstrate a 25% computational complexity reduction, compared to the conventional DS.