WSEAS Transactions on Communications
Print ISSN: 1109-2742, E-ISSN: 2224-2864
Volume 15, 2016
A Low Complexity Individual Process Fix-LLL Algorithm for MIMO System
Authors: , ,
Abstract: The Lenstra-Lenstra-Lovász (LLL) algorithm is an effective lattice reduction method in multi-inputmulti-output (MIMO) systems. Its modified version Fix-LLL (F-LLL)unilaterally aims to largely decrease the computation complexity in size reduction, but size reduction in LLL algorithm is closely associated with column swap procedure. This characteristic is harmful to independently design an optimum proposal for these two algorithmic parts. In this paper, a novel individual process F-LLL algorithm divides the overall process of LLL algorithm into two individual procedures. The column swap procedure of the novel algorithm is modified by searching for the potential column swaps through the whole basis. Until no basis is selected, the procedure terminates and global size reduction is achieved. We mainly design two schemes for selecting potential column swaps: offset coefficient selection criterion (OCSC) and maximum slope selection criterion (MSSC). Simulation results show both OCSC-F-LLL and MSSC-F-LLL can reduce computation complexity and performance loss compared to the LLL algorithm.
Search Articles
Pages: 105-113
WSEAS Transactions on Communications, ISSN / E-ISSN: 1109-2742 / 2224-2864, Volume 15, 2016, Art. #13