Paper Info
Title
A computationally efficient soft-output Lattice Reduction-aided Selective Spanning Sphere Decoder for wireless MIMO systems
Abstract
In recent years, the algorithmic optimizations and implementations of near-optimal Multiple-Input Multiple-Output (MIMO) detectors have been an area of active research. Lattice Reduction (LR) has shown to be a promising technique to improve the performance of linear MIMO detectors. However, LR-aided linear hard-output MIMO detection is still far from optimal. Practical systems use soft-output information to exploit gains from coded systems in order to yield near-optimal performance. In this paper, the LR-aided Selective Spanning Sphere Detection algorithm is proposed as a reduced-complexity candidate list generation method for soft-output MIMO detection, specifically optimized for practical MIMO-OFDM systems. This algorithm uses efficient and scalable heuristics based on simple processor-friendly operations that significantly contribute to lowering the computational complexity of the MIMO detection problem. Results from Monte Carlo simulations reveal that LR-aided SSSD is a promising algorithm that is capable of providing near-optimal performance whilst being especially computationally efficient, in comparison to other algorithms.
Year
DOI
Venue
2013
10.1109/PIMRC.2013.6666243
PIMRC
Keywords
Field
DocType
lr-aided sssd,lr-aided linear hard-output mimo detection algorithm,monte carlo simulations,soft-output information,channel coding,wireless mimo systems,lattice reduction,near-optimal multiple-input multiple-output detectors,computational complexity,soft-output lattice reduction-aided selective spanning sphere decoder,mimo communication,reduced-complexity candidate list generation method,scalable heuristics,sphere decoder,linear mimo detectors,signal detection,decoding,mimo detection
Mathematical optimization,3G MIMO,Detection theory,Computer science,MIMO,Real-time computing,Decoding methods,Computer engineering,Spatial multiplexing,Lattice reduction,Scalability,Computational complexity theory
Conference
ISSN
Citations 
PageRank 
2166-9570
0
0.34
References 
Authors
7
6
Name
Order
Citations
PageRank
Hoang Duy Nguyen121.41
Ubaid Ahmad284.70
Min Li316023.21
Liesbet Van Der Perre41013108.24
R. Lauwereins52336220.18
Sofie Pollin61041113.94