Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
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
IS - 6
ER -