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.Official URL: http://dx.doi.org/10.1109/LCOMM.2009.090112
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | IEEE Communications Letters |
| Uncontrolled Keywords: | Lattice reduction ; MIMO ; sphere decoding |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Departments: | Faculty of Science and Technology > School of Computing & Communications |
| ID Code: | 57987 |
| Deposited By: | ep_importer_pure |
| Deposited On: | 30 Aug 2012 10:28 |
| Refereed?: | Yes |
| Published?: | Published |
| Last Modified: | 30 Aug 2012 10:28 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/57987 |
Actions (login required)
| View Item |
