Stopping criterion for complexity reduction of sphere decoding

Ma, Zheng and Honary, Bahram and Fan, Pingzhi and Larsson, Erik G. (2009) Stopping criterion for complexity reduction of sphere decoding. IEEE Communications Letters, 13 (6). pp. 402-404.

Full text not available from this repository.


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.

Item Type:
Journal Article
Journal or Publication Title:
IEEE Communications Letters
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
30 Aug 2012 09:28
Last Modified:
01 Jan 2022 10:47