Title :
Near ML detection using Dijkstra’s algorithm with bounded list size over MIMO channels
Author :
Okawado, Atsushi ; Matsumoto, Ryutaroh ; Uyematsu, Tomohiko
Author_Institution :
Dept. of Commun. & Integrated Syst., Tokyo Inst. of Technol., Tokyo
Abstract :
We propose Dijkstrapsilas algorithm with bounded list size after QR decomposition for decreasing the computational complexity of near maximum-likelihood (ML) detection of signals over multiple-input-multiple-output (MIMO) channels. After that, we compare the performances of proposed algorithm, QR decomposition M-algorithm (QRM-MLD), and its improvement. When the list size is set to achieve the almost same symbol error rate (SER) as the QRM-MLD, the proposed algorithm has smaller average computational complexity.
Keywords :
MIMO communication; error statistics; maximum likelihood detection; wireless channels; Dijkstrapsilas algorithm; MIMO channels; ML detection; QR decomposition M-algorithm; QRM-MLD; SER; computational complexity; maximum-likelihood detection; multiple-input-multiple-output channels; symbol error rate; MIMO;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595344