Table of Contents Author Guidelines Submit a Manuscript
Journal of Electrical and Computer Engineering
Volume 2011 (2011), Article ID 821407, 4 pages
Research Article

A New Efficient Ordering Scheme for Sphere Detection

1College of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China
2College of Information Engineering, China Jiliang University, Hangzhou 310018, China

Received 6 June 2011; Accepted 16 August 2011

Academic Editor: George Tsoulos

Copyright © 2011 Cao Haiyan and Li Jun. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 , the average number of visited nodes under our proposed ordering is reduced by almost 30% and 33% in 16QAM system and by almost 30% and 50% reduction in 16QAM system, respectively. For 64QAM system, almost 75% and 80% reduction at and more than 40% and 50% reduction at can be achieved, respectively.