Search

There exist two issues among popular lattice reduction algorithms that should cause our concern. The first one is Korkine–Zolotarev (KZ) and Lenstra–Lenstra–Lovász (LLL) algorithms may increase the lengths of basis vectors. The other is KZ reduction suffers worse performance than Minkowski reduction in terms of providing short basis vectors, despite its superior theoretical upper bounds. To address these limitations, we improve the size reduction steps in KZ and LLL to set up two new efficient algorithms, referred to as boosted KZ and LLL, for solving the shortest basis problem with exponential and polynomial complexity, respectively. Both of them offer better actual performance than their classic counterparts, and the performance bounds for KZ are also improved. We apply them to designing integer-forcing (IF) linear receivers for multi-input multioutput communications. Our simulations confirm their rate and complexity advantages. [ABSTRACT FROM PUBLISHER]