On the Proximity Factors of Lattice Reduction-Aided Decoding

DOI10.1109/TSP.2011.2123889zbMATH Open1392.94021arXiv1006.1666OpenAlexW2109671164MaRDI QIDQ4573002FDOQ4573002

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this aim, the proximity factors are defined to measure the worst-case losses in distances relative to closest point search (in an infinite lattice). Upper bounds on the proximity factors are derived, which are functions of the dimension

n

of the lattice alone. The study is then extended to the dual-basis reduction. It is found that the bounds for dual basis reduction may be smaller. Reasonably good bounds are derived in many cases. The constant bounds on proximity factors not only imply the same diversity order in fading channels, but also relate the error probabilities of (infinite) lattice decoding and lattice reduction-aided decoding.

Full work available at URL: https://arxiv.org/abs/1006.1666

Mathematics Subject Classification ID

Communication theory (94A05) Bounds on codes (94B65) Decoding (94B35)

Cited In (3)

This page was built for publication: On the Proximity Factors of Lattice Reduction-Aided Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573002)