Stopping criterion for complexity reduction of sphere decoding

Authors:
Zheng Ma;Bahram Honary;Pingzhi Fan;Erik G. Larsson
Affiliations:
Provincial Key Lab of Information Coding and Transmission, Southwest Jiaotong University, Chengdu, China and Department of Communications Systems, Lancaster University, UK and State Key Lab of Mob ...;Dept. of Communication Systems, Lancaster University, UK;Provincial Key Lab of Information Coding and Transmission, Southwest Jiaotong University, Chengdu, China;Dept. of Electrical Engineering, Linköping University, Linköping, Sweden
Venue:
IEEE Communications Letters
Year:
2009

Citing 4
Cited 0

Lattice basis reduction: improved practical algorithms and solving subset sum problems

Mathematical Programming: Series A and B
On the complexity of sphere decoding in digital communications

IEEE Transactions on Signal Processing
Fixed-Complexity Soft MIMO Detection via Partial Marginalization

IEEE Transactions on Signal Processing - Part I
Reduced complexity closest point decoding algorithms for random lattices

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

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.