Paper Info
Title
A fast convergence LLL algorithm with fixed-complexity for SIC-based MIMO detection.
Abstract
In this paper, we propose a fixed-complexity variant of LLL (Lenstra-Lenstra-Lovasz) algorithm. LLL algorithm is widely used in MIMO signal processing to obtain full diversity gain with low complexity increase. However, because of its non-deterministic nature with varying complexity and high worst-case costs, the real implementation of original LLL algorithm is difficult. Although some fixed-complexity variants of LLL algorithm has been proposed, but still their complexity in large MIMO system is high. The proposed algorithm uses column selection method based on threshold which leads to the fast convergence in fewer iterations. Simulation result shows that the proposed algorithm converges faster than other fixed-complexity variants of LLL algorithms while it saves about 30% complexity in 8 × 8 MIMO system compared to existing fixed-complexity LLL (fc-LLL) algorithm.
Year
DOI
Venue
2016
10.1109/ICOIN.2016.7427154
ICOIN
Keywords
Field
DocType
MIMO communication,computational complexity,diversity reception,interference suppression,radiofrequency interference,signal detection,Lenstra-Lenstra-Lovasz algorithm,MIMO signal processing,SIC-based MIMO detection,diversity gain,fast convergence LLL algorithm,fixed-complexity LLL algorithm,successive interference cancellation,threshold-based column selection method
Convergence (routing),Diversity gain,Signal processing,Algorithm design,Computer science,MIMO,Algorithm,Detector,Signal processing algorithms,Bit error rate
Conference
Citations 
PageRank 
References 
0
0.34
4
Authors
4
Name
Order
Citations
PageRank
Hyukyeon Lee122.06
hyunsub kim242.43
Minjoon Kim3153.88
Jaeseok Kim440558.33