Sciweavers

6129 search results - page 2 / 1226
» A parallel LLL algorithm
Sort
View
ISSAC
1992
Springer
114views Mathematics» more  ISSAC 1992»
13 years 10 months ago
Parallel Lattice Basis Reduction
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
Gilles Villard
LATIN
2010
Springer
14 years 19 days ago
Modelling the LLL Algorithm by Sandpiles
Abstract The LLL algorithm aims at finding a “reduced” basis of a Euclidean lattice. The LLL algorithm plays a primary role in many areas of mathematics and computer science. ...
Manfred Madritsch, Brigitte Vallée
ICC
2009
IEEE
145views Communications» more  ICC 2009»
14 years 16 days ago
Rapid Prototyping of Clarkson's Lattice Reduction for MIMO Detection
—This paper presents the field-programmable gate array (FPGA) implementation of a variant of the LenstraLenstra-Lov´asz (LLL) lattice reduction (LR) algorithm, known as the Cla...
Luis G. Barbero, David L. Milliner, Tharmalingam R...
C3S2E
2008
ACM
13 years 7 months ago
Integer least squares: sphere decoding and the LLL algorithm
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss...
Sanzheng Qiao
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
13 years 9 months ago
An Efficient LLL Gram Using Buffered Transformations
In this paper we introduce an improved variant of the LLL algorithm. Using the Gram matrix to avoid expensive correction steps necessary in the Schnorr-Euchner algorithm and introd...
Werner Backes, Susanne Wetzel