12 search results - page 1 / 3 » Practical Lattice Basis Sampling Reduction |
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behav...
FCT
1991
Springer
13 years 8 months ago
1991
Springer
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
AFRICACRYPT
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...
ICIP
2005
IEEE
14 years 6 months ago
2005
IEEE
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...