@inproceedings{1262343cee5841dca132ad7978c17ab8,
title = "Improved MIMO detection based on successive tree approximations",
abstract = "This paper proposes an efficient high-performance detection algorithm for MIMO communication systems that is based on a sequence of optimal tree approximations of the Gaussian density of the unconstrained linear system. The finite-set constraint is then applied to obtain a cycle-free discrete distribution that is suitable for message-passing algorithms. The proposed GTA-SIC algorithm is iterative and is based on first decoding the most reliable symbol, then canceling its contribution and applying the message-passing decoding to the smaller system. The computational complexity of the proposed GTA-SIC algorithm and the MMSE-SIC are comparable. The significantly improved MIMO decoding performance of the algorithm proposed here compared to lattice-reduction aided MMSE-SIC is demonstrated on several examples of large MIMO systems with high-order QAM constellations.",
author = "Jacob Goldberger",
year = "2013",
doi = "10.1109/isit.2013.6620577",
language = "الإنجليزيّة",
isbn = "9781479904464",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "2004--2008",
booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",
note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",
}