Partial expansion sphere decoder with reduced branching factor for MIMO systems

Multiple-input multiple-output (MIMO) detection could be modeled to a tree search problem. This paper proposes one sphere decoder algorithm called partial expansion sphere decoder (PESD) by pruning the search tree using a reduced branching factor. The main idea of the proposed PESD is to reduce the detection complexity by decreasing the branching factor for the search tree. The trade-off between the performance and complexity can be easily controlled by the branching factor. In order to further improve the PESD, a hybrid PESD is proposed by combining the full enumeration for the first several layers of the search tree and the proposed PESD. The simulation results demonstrate that the PESD achieves a flexible trade-off depending on the branching factor and shows that the hybrid PESD obtains performance gains than the pure PESD with the same branching factor.

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

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

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

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

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

[6]  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 .

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

[8]  Tracey Ho,et al.  Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems , 2007, 2007 IEEE International Conference on Communications.

[9]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

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

[11]  Inkyu Lee,et al.  A New Reduced Complexity ML Detection Scheme for MIMO Systems , 2010, 2009 IEEE International Conference on Communications.

[12]  Wei-Ho Chung,et al.  Reduced Complexity MIMO Detection Scheme Using Statistical Search Space Reduction , 2012, IEEE Communications Letters.

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

[14]  Wei-Ho Chung,et al.  Best-First Tree Search with Probabilistic Node Ordering for MIMO Detection: Generalization and Performance-Complexity Tradeoff , 2012, IEEE Transactions on Wireless Communications.