A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding

2013
*
IEEE Transactions on Information Theory
*

A common method to estimate an unknown integer parameter vector in a linear model is to solve an integer least squares (ILS) problem. A typical approach to solving an ILS problem is sphere decoding. To make a sphere decoder faster, the well-known LLL reduction is often used as preprocessing. The Babai point produced by the Babai nearest plane algorithm is a suboptimal solution of the ILS problem. First, we prove that the success probability of the Babai point as a lower bound on the success

doi:10.1109/tit.2013.2253596
fatcat:3sfekwpa5nehrjwlaqp5uxqxnu