Stopping Criterion for Complexity Reduction of Sphere Decoding
2009 (English)In: IEEE Communications Letters, ISSN 1089-7798, Vol. 13, no 6, 402-404 p.Article in journal (Refereed) Published
Maximum-likelihood detection in MIMO communications amounts to solving a least-squares problem with a constellation (alphabet) constraint. One popular method that can be used to solve this problem is sphere decoding. We show in this letter that by employing a simple stopping criterion, it is possible to significantly reduce the complexity of sphere decoding over a wide range of SNRs, without a noticeable performance degradation. Specifically, simulation results demonstrate that a 10%-90% reduction of the average complexity could be achieved.
Place, publisher, year, edition, pages
2009. Vol. 13, no 6, 402-404 p.
Lattice reduction, MIMO, sphere decoding
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-19623DOI: 10.1109/LCOMM.2009.090112OAI: oai:DiVA.org:liu-19623DiVA: diva2:226728
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Zheng Ma, Bahram Honary, Pingzhi Fan and Erik G. Larsson, Stopping Criterion for Complexity Reduction of Sphere Decoding, 2009, IEEE Communications Letters, (13), 6, 402-404.