Home > Research > Publications & Outputs > Stopping criterion for complexity reduction of ...
View graph of relations

Stopping criterion for complexity reduction of sphere decoding

Research output: Contribution to journalJournal articlepeer-review

Published

Standard

Stopping criterion for complexity reduction of sphere decoding. / Ma, Zheng; Honary, Bahram; Fan, Pingzhi; Larsson, Erik G.

In: IEEE Communications Letters, Vol. 13, No. 6, 01.06.2009, p. 402-404.

Research output: Contribution to journalJournal articlepeer-review

Harvard

Ma, Z, Honary, B, Fan, P & Larsson, EG 2009, 'Stopping criterion for complexity reduction of sphere decoding', IEEE Communications Letters, vol. 13, no. 6, pp. 402-404. https://doi.org/10.1109/LCOMM.2009.090112

APA

Ma, Z., Honary, B., Fan, P., & Larsson, E. G. (2009). Stopping criterion for complexity reduction of sphere decoding. IEEE Communications Letters, 13(6), 402-404. https://doi.org/10.1109/LCOMM.2009.090112

Vancouver

Ma Z, Honary B, Fan P, Larsson EG. Stopping criterion for complexity reduction of sphere decoding. IEEE Communications Letters. 2009 Jun 1;13(6):402-404. https://doi.org/10.1109/LCOMM.2009.090112

Author

Ma, Zheng ; Honary, Bahram ; Fan, Pingzhi ; Larsson, Erik G. / Stopping criterion for complexity reduction of sphere decoding. In: IEEE Communications Letters. 2009 ; Vol. 13, No. 6. pp. 402-404.

Bibtex

@article{2931eb3092964ca296ce6935b0076d24,
title = "Stopping criterion for complexity reduction of sphere decoding",
abstract = "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.",
keywords = "Lattice reduction, MIMO , sphere decoding",
author = "Zheng Ma and Bahram Honary and Pingzhi Fan and Larsson, {Erik G.}",
year = "2009",
month = jun,
day = "1",
doi = "10.1109/LCOMM.2009.090112",
language = "English",
volume = "13",
pages = "402--404",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

RIS

TY - JOUR

T1 - Stopping criterion for complexity reduction of sphere decoding

AU - Ma, Zheng

AU - Honary, Bahram

AU - Fan, Pingzhi

AU - Larsson, Erik G.

PY - 2009/6/1

Y1 - 2009/6/1

N2 - 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.

AB - 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.

KW - Lattice reduction

KW - MIMO

KW - sphere decoding

U2 - 10.1109/LCOMM.2009.090112

DO - 10.1109/LCOMM.2009.090112

M3 - Journal article

VL - 13

SP - 402

EP - 404

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

ER -