A New Efficient Ordering Scheme for Sphere Detection

The decoding order has a deep impact in the complexity of sphere detection. A new ordering scheme for sphere detection is presented in this paper, which is based on SIC (serial interference canceling) and the gradient defined by the accumulated probability of the absolute difference between symbol e...

Full description

Saved in:
Bibliographic Details
Main Authors: Cao Haiyan, Li Jun
Format: Article
Language:English
Published: Wiley 2011-01-01
Series:Journal of Electrical and Computer Engineering
Online Access:http://dx.doi.org/10.1155/2011/821407
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The decoding order has a deep impact in the complexity of sphere detection. A new ordering scheme for sphere detection is presented in this paper, which is based on SIC (serial interference canceling) and the gradient defined by the accumulated probability of the absolute difference between symbol element and the zero-forcing solution. The simulation results show that the proposed ordering scheme can achieve a significant complexity reduction, especially for high numbers of antennas and large constellation sizes in the low SNR region. Compared with sphere detection complexity under BSQR (balanced sorted QR) decomposition and GB (gradient-based) orderings at SNR=5 dB, the average number of visited nodes under our proposed ordering is reduced by almost 30% and 33% in 4×4 16QAM system and by almost 30% and 50% reduction in 6×6 16QAM system, respectively. For 4×4 64QAM system, almost 75% and 80% reduction at SNR=0 dB and more than 40% and 50% reduction at SNR=5 dB can be achieved, respectively.
ISSN:2090-0147
2090-0155