Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels
Information Theory
2008-09-02 v1 math.IT
Abstract
We propose Dijkstra's 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 (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.
Cite
@article{arxiv.0802.1785,
title = {Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels},
author = {Atsushi Okawado and Ryutaroh Matsumoto and Tomohiko Uyematsu},
journal= {arXiv preprint arXiv:0802.1785},
year = {2008}
}
Comments
8 pages, two column, 14 figures, LaTeX2e