By Topic

On the Proximity Factors of Lattice Reduction-Aided Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Cong Ling ; Department of Electrical and Electronic Engineering, Imperial College London, London, United Kingdom

Lattice reduction-aided decoding (LRAD) features reduced decoding complexity and near-optimum performance in multiinput multioutput communications. In this paper, a quantitative error-rate analysis of LRAD is presented. To this aim, the proximity factors are defined to measure the worst-case losses in decoding distances associated with the decision region relative to infinite lattice decoding (ILD), namely, 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. Proximity factors not only imply the same diversity order in fading channels, but also relate the error probabilities of ILD and LRAD.

Published in:

IEEE Transactions on Signal Processing  (Volume:59 ,  Issue: 6 )