Modified LLL algorithm with shifted start column

TL;DR

This paper proposes a modified LLL algorithm that exploits the structure of the upper triangular matrix in MIMO systems to reduce computational complexity with minimal impact on performance.

Contribution

The paper introduces a novel modification to the LLL algorithm that leverages zero elements in the matrix to lower computational operations without significant performance loss.

Findings

Reduced computational complexity demonstrated

Performance remains nearly unchanged

Effective exploitation of matrix structure

Abstract

Multiple-input multiple-output (MIMO) systems are playing an important role in the recent wireless communication. The complexity of the different systems models challenge different researches to get a good complexity to performance balance. Lattices Reduction Techniques and Lenstra-Lenstra-Lovasz (LLL) algorithm bring more resources to investigate and can contribute to the complexity reduction purposes. In this paper, we are looking to modify the LLL algorithm to reduce the computation operations by exploiting the structure of the upper triangular matrix without big performance degradation. Basically, the first columns of the upper triangular matrix contain many zeroes, so the algorithm will perform several operations with very limited income. We are presenting a performance and complexity study and our proposal show that we can gain in term of complexity while the performance results remains almost the same.