The error probability of the fixed-complexity sphere decoder

Authors:
Joakim Jaldén;Luis G. Barbero;Björn Ottersten;John S. Thompson
Affiliations:
Institute of Communications and Radio-Frequency Engineering, Vienna University of Technology, Vienna, Austria and KTH Signal Processing Laboratory, School of Electrical Engineering, Royal Institut ...;ECIT, Queens University of Belfast, Belfast, U.K. and Institute for Digital Communications, Joint Research Institute for Signal and Image Processing, The University of Edinburgh, Edinburgh, U.K.;ACCESS Linnaeus Center, KTH Signal Processing Laboratory, Royal Institute of Technology, Stockholm, Sweden and Securityandtrust.lu, University of Luxembourg, Luxembourg;Institute for Digital Communications, Joint Research Institute for Signal and Image Processing, The University of Edinburgh, Edinburgh, U.K.
Venue:
IEEE Transactions on Signal Processing
Year:
2009

Citing 16
Cited 4

Matrix analysis

Matrix analysis
Lattice basis reduction: improved practical algorithms and solving subset sum problems

Mathematical Programming: Series A and B
Fundamentals of wireless communication

Fundamentals of wireless communication
On the complexity of sphere decoding in digital communications

IEEE Transactions on Signal Processing
Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection

IEEE Transactions on Signal Processing
High-SNR Analytical Performance of Spatial Multiplexing MIMO Systems With CSI

IEEE Transactions on Signal Processing
Fast antenna subset selection in MIMO systems

IEEE Transactions on Signal Processing
Reduced complexity closest point decoding algorithms for random lattices

IEEE Transactions on Wireless Communications
Fixing the Complexity of the Sphere Decoder for MIMO Detection

IEEE Transactions on Wireless Communications
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory
Analysis of decision feedback detection for MIMO Rayleigh-fading channels and the optimization of power and rate allocations

IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder

IEEE Transactions on Information Theory
On the Diversity Order of Spatial Multiplexing Systems With Transmit Antenna Selection: A Geometrical Approach

IEEE Transactions on Information Theory
On the Maximal Diversity Order of Spatial Multiplexing With Transmit Antenna Selection

IEEE Transactions on Information Theory
Algorithm and implementation of the K-best sphere decoding for MIMO detection

IEEE Journal on Selected Areas in Communications

Simplified ordering for fixed-complexity sphere decoder

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Parallel High Throughput Soft-Output Sphere Decoding Algorithm

Journal of Signal Processing Systems
Adaptive Parallel and Iterative QRDM Detection Algorithms for MIMO Multiplexing Systems

Wireless Personal Communications: An International Journal
An efficient GPU implementation of fixed-complexity sphere decoders for MIMO wireless systems

Integrated Computer-Aided Engineering

Quantified Score

Hi-index	35.68

Visualization

Abstract

The fixed-complexity sphere decoder (FSD) has been previously proposed for multiple-input multiple-output (MIMO) detection in order to overcome the two main drawbacks of the sphere decoder (SD), namely its variable complexity and its sequential structure. Although the FSD has shown remarkable quasi-maximum-likelihood (ML) performance and has resulted in a highly optimized real-time implementation, no analytical study of its performance existed for an arbitrary MIMO system. Herein, the error probability of the FSD is analyzed, proving that it achieves the same diversity as the maximum-likelihood detector (MLD) independent of the constellation used. In addition, it can also asymptotically yield ML performance in the high-signal-to-noise ratio (SNR) regime. Those two results, together with its fixed complexity, make the FSD a very promising algorithm for uncoded MIMO detection.