Simplified ordering for fixed-complexity sphere decoder

This paper proposes a simplified ordering algorithm for the fixed-complexity sphere decoder (FSD). The new algorithm is developed from the analysis of the ordering for FSD from a geometrical point of view. Computer simulation is used to assess the improvements in bit-error rate (BER) performances of MIMO systems using the FSD with the original and the simplified ordering. Simulation results show that the new ordering method can achieve nearly the same BER as the original ordering method but with much less complexity.

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

[2]  Franz Hlawatsch,et al.  Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection , 2003, IEEE Trans. Signal Process..

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

[4]  Michael P. Fitz,et al.  Geometric Decoding Of PAM and QAM Lattices , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[5]  Björn E. Ottersten,et al.  The Error Probability of the Fixed-Complexity Sphere Decoder , 2009, IEEE Transactions on Signal Processing.

[6]  John S. Thompson,et al.  Rapid Prototyping of a Fixed-Throughput Sphere Decoder for MIMO Systems , 2006, 2006 IEEE International Conference on Communications.

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

[8]  S. W. Cheung,et al.  A Simple and Optimum Geometric Decoding Algorithm for MIMO Systems , 2009, 2009 4th International Symposium on Wireless Pervasive Computing.

[9]  U. Fincke,et al.  Improved methods for calculating vectors of short length in a lattice , 1985 .