Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels
نویسندگان
چکیده
We propose Dijkstra’s algorithm with bounded list size after QR decomposition for decreasing the computational complexity of near maximumlikelihood (ML) detection of signals over multipleinput-multiple-output (MIMO) channels. After that, we compare the performances of proposed algorithm, QR decomposition M-algorithm (QRD-MLD), and its improvement. When the list size is set to achieve the almost same symbol error rate (SER) as the QRD-MLD, the proposed algorithm has smaller average computational complexity.
منابع مشابه
A Low-complexity Near-ML Decoding Via Reduced Dimension Maximum Likelihood Search
In this paper, we consider a low-complexity ML detection technique referred to as reduced dimension ML search (RD-MLS). RD-MLS directly refers the division of symbols into two groups viz. strong and weak group for searching over vector space with strong symbols instead of whole symbols. The inevitable performance loss, due to the exclusion of weak symbols, is compensated by 1) the list tree sea...
متن کاملNear-ML Signal Detection in Large-Dimension Linear Vector Channels Using Reactive Tabu Search
Low-complexity near-optimal signal detection in large dimensional communication systems is a challenge. In this paper, we present a reactive tabu search (RTS) algorithm, a heuristic based combinatorial optimization technique, to achieve low-complexity near-maximum likelihood (ML) signal detection in linear vector channels with large dimensions. Two practically important large-dimension linear v...
متن کاملA Random-List Based LAS Algorithm for Near-Optimal Detection in Large-Scale Uplink Multiuser MIMO Systems
Massive Multiple-input Multiple-output (MIMO) systems offer exciting opportunities due to their high spectral efficiencies capabilities. On the other hand, one major issue in these scenarios is the high-complexity detectors of such systems. In this work, we present a low-complexity, near maximumlikelihood (ML) performance achieving detector for the uplink in large MIMO systems with tens to hund...
متن کاملEfficient near-ML detection for MIMO channels: the sphere-projection algorithm
It is well known that suboptimal detection schemes for MIMO spatial multiplexing systems (equalization-based as well as nulling-and-cancelling detectors) cannot exploit all of the available diversity. In this paper, we show that this inferior performance is primarily caused by poorly conditioned channel realizations. We then present the novel sphere-projection algorithm (SPA) that is robust to ...
متن کاملA List Based Detection Technique for MIMO Systems 15
It is well known that multiple transmit and receive antennas can significantly increase the data carrying capacity of wireless systems (1) (3). Usually a multiple-input multiple-output (MIMO) system requires a channel code to approach capacity (4). However, for such MIMO systems, the optimal joint maximum-likelihood (ML) detection using exhaustive search is too complex and is almost impossible....
متن کامل