Reference : The Error Probability of the Fixed-Complexity Sphere Decoder
Scientific journals : Article
Engineering, computing & technology : Computer science
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/7572
The Error Probability of the Fixed-Complexity Sphere Decoder
English
Jalden, Joakim [> >]
Barbero, Luis G. [> >]
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Thompson, John S. [> >]
Jul-2009
IEEE Transactions on Signal Processing
IEEE
57
7
2711-2720
Yes
International
1053-587X
[en] Download Citation
Email
Print
Request Permissions
Save to Project

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.
Others
http://hdl.handle.net/10993/7572
10.1109/TSP.2009.2017574

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
The Error Probability of the Fixed-Complexity Sphere Decoder.pdfPublisher postprint606.25 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.