Probability-Distribution-Based Node Pruning for Sphere Decoding

Node pruning strategies based on probability distributions are developed for maximum-likelihood (ML) detection for spatial-multiplexing multiple-input–multiple-output (MIMO) systems. Uniform pruning, geometric pruning, threshold pruning, hybrid pruning, and depth-dependent pruning are thus developed in detail. By considering the symbol error probability in the high signal-to-noise ratio (SNR) region, the desirable diversity order of uniform pruning and the threshold level for threshold pruning are derived. Simulation results show that threshold pruning saves complexity compared with popular sphere decoder (SD) algorithms, such as the $K$-best SD, the fixed-complexity SD (FSD), and the probabilistic tree pruning SD (PTP-SD), particularly for high SNRs and large-antenna MIMO systems. Furthermore, our proposed node pruning strategies may also be applied to other systems, including coded MIMO systems and relay networks.

[1]  Chiao-En Chen,et al.  A New Lattice Reduction Algorithm for LR-Aided MIMO Linear Detection , 2011, IEEE Transactions on Wireless Communications.

[2]  C. Tellambura,et al.  An efficient generalized sphere decoder for rank-deficient MIMO systems , 2004 .

[3]  Wolfgang Fichtner,et al.  Performance tradeoffs in the VLSI implementation of the sphere decoding algorithm , 2004 .

[4]  Ross D. Murch,et al.  Performance analysis of maximum likelihood detection in a MIMO antenna system , 2002, IEEE Trans. Commun..

[5]  Shuangshuang Han,et al.  Complexity-efficient detection for MIMO relay networks , 2011, 2011 12th Canadian Workshop on Information Theory.

[6]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[7]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

[8]  Wai Ho Mow,et al.  Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection , 2009, IEEE Transactions on Signal Processing.

[9]  Chintha Tellambura,et al.  A Statistical Pruning Strategy for Schnorr-Euchner Sphere Decoding , 2008, IEEE Communications Letters.

[10]  H. Vincent Poor,et al.  Iterative space-time processing for multiuser detection in multipath CDMA channels , 2002, IEEE Trans. Signal Process..

[11]  Weixiong Zhang.  State-space search : algorithms, complexity, and applications , 1999 .

[12]  Gerald Matz,et al.  Achieving a Continuous Diversity-Complexity Tradeoff in Wireless MIMO Systems via Pre-Equalized Sphere-Decoding , 2009, IEEE Journal of Selected Topics in Signal Processing.

[13]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[14]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

[15]  Zhan Guo,et al.  Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.

[16]  G. Matz,et al.  On the Diversity-Complexity Tradeoff in MIMO Spatial Multiplexing Systems , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[17]  Shuangshuang Han,et al.  Improved K-Best Sphere Detection for Uncoded and Coded MIMO Systems , 2012, IEEE Wireless Communications Letters.

[18]  Narayan B. Mandayam,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science Pilot Assisted Estimation of MIMO Fading Channel Response and Achievable Data Rates , 2022 .

[19]  John S. Thompson,et al.  Fixing the Complexity of the Sphere Decoder for MIMO Detection , 2008, IEEE Transactions on Wireless Communications.

[20]  Wei-Ho Chung,et al.  Efficient Tree-Search MIMO Detection with Probabilistic Node Ordering , 2011, 2011 IEEE International Conference on Communications (ICC).

[21]  Reinaldo A. Valenzuela,et al.  Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .

[22]  Kiseon Kim,et al.  Schnorr-Euchner sphere decoder with statistical pruning for MIMO systems , 2009, 2009 6th International Symposium on Wireless Communication Systems.

[23]  Weixiong Zhang,et al.  State-Space Search , 1999, Springer New York.

[24]  Babak Hassibi,et al.  Statistical Pruning for Near-Maximum Likelihood Decoding , 2007, IEEE Transactions on Signal Processing.

[25]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[26]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[27]  Bruno O. Shubert,et al.  Random variables and stochastic processes , 1979 .

[28]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[29]  Shuangshuang Han,et al.  A Complexity-Efficient Sphere Decoder for MIMO Systems , 2011, 2011 IEEE International Conference on Communications (ICC).

[30]  Cong Xiong,et al.  An Efficient Statistical Pruning Algorithm for Fixed-Complexity Sphere Decoder , 2011, IEICE Trans. Commun..

[31]  Byonghyo Shim,et al.  Sphere Decoding With a Probabilistic Tree Pruning , 2008, IEEE Transactions on Signal Processing.

[32]  Byonghyo Shim,et al.  On further reduction of complexity in tree pruning based sphere search , 2010, IEEE Transactions on Communications.

[33]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..