Simplified ordering for fixed-complexity sphere decoder

Authors:
X. G. Dai;S. W. Cheung;T. I. Yuk
Affiliations:
The University of Hong Kong;The University of Hong Kong;The University of Hong Kong
Venue:
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Year:
2010

Citing 6
Cited 0

The error probability of the fixed-complexity sphere decoder

IEEE Transactions on Signal Processing
A simple and optimum geometric decoding algorithm for MIMO systems

ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection

IEEE Transactions on Signal Processing
Fixing the Complexity of the Sphere Decoder for MIMO Detection

IEEE Transactions on Wireless Communications
A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory
Closest point search in lattices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.