Factorization Approaches in Lattice-Reduction-Aided and Integer-Forcing Equalization

Abstract

In this paper, lattice-reduction-aided and integerforcing equalization are contrasted. In both approaches, the determination of an integer matrix is essential. The different criteria for this calculation available in the literature are summarized in a unified way. A new factorization algorithm for obtaining the integer matrix is proposed. Via extensive numerical simulations the gains of the respective optimization criterion and the gain of the new algorithm over the classical Lenstra-LenstraLovasz algorithm are assessed. In particular, the gains achieved by dropping the constraint that the integer matrix has to be unimodular are identified.