In this paper, we propose a new column swapping traverse Lenstra-Lenstra-Lovasz algorithm (LLL) for low-complexity lattice reduction aided multiple-input multiple-output (MIMO) detection. The original LLL algorithm performs a swapping with an adjacent column progressively when it doesn't satisfy Lovasz condition. However, this algorithm has a trouble in hardware implementation because its complexity and run-time are variable. This correspondence proposes the modified LLL algorithm which performs a swapping only with the column apart from predefined number of leaping. In the case of the modified column swapping traverse, it clearly decreases the number of iterations and execution time especially for the worst-case situations. Simulation result shows that the proposed LLL algorithm aided MIMO detection achieves more reduced complexity while maintaining similar performance compared to the original algorithm for hardware implementation.
|Title of host publication||Proceedings of the 2016 IEEE Region 10 Conference, TENCON 2016|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||4|
|Publication status||Published - 2017 Feb 8|
|Event||2016 IEEE Region 10 Conference, TENCON 2016 - Singapore, Singapore|
Duration: 2016 Nov 22 → 2016 Nov 25
|Name||IEEE Region 10 Annual International Conference, Proceedings/TENCON|
|Other||2016 IEEE Region 10 Conference, TENCON 2016|
|Period||16/11/22 → 16/11/25|
Bibliographical notePublisher Copyright:
© 2016 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Electrical and Electronic Engineering