A new efficient ordering scheme for sphere detection

Authors:
Cao Haiyan;Li Jun
Affiliations:
College of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China;College of Information Engineering, China Jiliang University, Hangzhou, China
Venue:
Journal of Electrical and Computer Engineering
Year:
2011

Citing 3
Cited 0

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

Mathematical Programming: Series A and B
Efficient Ordering Schemes for High-Throughput MIMO Detectors

Journal of Signal Processing Systems
Fixing the Complexity of the Sphere Decoder for MIMO Detection

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.