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.
|Title of host publication||30th International Conference on Information Networking, ICOIN 2016|
|Publisher||IEEE Computer Society|
|Number of pages||3|
|Publication status||Published - 2016 Mar 7|
|Event||30th International Conference on Information Networking, ICOIN 2016 - Kota Kinabalu, Malaysia|
Duration: 2016 Jan 13 → 2016 Jan 15
|Name||International Conference on Information Networking|
|Other||30th International Conference on Information Networking, ICOIN 2016|
|Period||16/1/13 → 16/1/15|
Bibliographical noteFunding Information:
This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government( MSIP) (No. NRF-2015R1A2A2A01004883)
© 2016 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Information Systems