Approximate Lattice Decoding: Primal Versus Dual Basis Reduction

Lattice decoding enables significant complexity reduction in multi-input multi-output (MIMO) communications. Unlike most work on the lattice-reduction-aided decoding technique, this paper is aimed at a comparative study of primal versus dual basis reduction for approximate lattice decoding. We derive the respective proximity factors for the two methods, which measure the performance gap to maximum-likelihood (ML) decoding. It is found that in many cases reducing the dual can result in smaller proximity factors than reducing the primal basis