On the Proximity Factors of Lattice Reduction-Aided Decoding

Details On the Proximity Factors of Lattice Reduction-Aided Decoding On the Proximity Factors of Lattice Reduction-Aided Decoding

2010-06-08

arxiv.org/abs/1006.1666v2

Computer Science

Information Theory

remove redundant figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Proximity Factors of Lattice Reduction-Aided Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Proximity Factors of Lattice Reduction-Aided Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Proximity Factors of Lattice Reduction-Aided Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39139