The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Xinyue Deng
- 2016

Lenstra-Lenstra-Lovasz (LLL) Algorithm is an approximation algorithm of the shortest vector problem, which runs in polynomial… (More)

Is this relevant?

2014

2014

This paper describes a parallel Jacobi method for lattice basis reduction and a GPU implementation using CUDA. Our experiments… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Ying Hung Gan, Cong Ling, Wai Ho Mow
- IEEE Transactions on Signal Processing
- 2009

Recently, lattice-reduction-aided detectors have been proposed for multiinput multioutput (MIMO) systems to achieve performance… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Mahmoud Taherzadeh, Amin Mobasher, Amir K. Khandani
- IEEE Transactions on Information Theory
- 2007

A new viewpoint for adopting the lattice reduction in communication over multiple-input multiple-output (MIMO) broadcast channels… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Ying Hung Gan, Wai Ho Mow
- GLOBECOM '05. IEEE Global Telecommunications…
- 2005

Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We consider the lattice-reduction-aided detection scheme for 2×2 channels recently proposed by Yao and Wornell [11]. Using an… (More)

Is this relevant?

1998

1998

- Sachar Paulus
- ANTS
- 1998

We present an algorithm for lattice basis reduction in function elds. In contrast to integer lattices, there is a simple… (More)

Is this relevant?

1998

1998

- Christian Heckler, Lothar Thiele
- SIAM J. Comput.
- 1998

Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Claus-Peter Schnorr
- J. Algorithms
- 1988

The famous lattice basis reduction algorithm of Lovasz transforms a given integer lattice basis b,, . . , b, E 2” into a reduced… (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Claus-Peter Schnorr
- Theor. Comput. Sci.
- 1987

We present a hierarchy of polynomial time lattice basis reduction algorithms that stretch from Lenstra, Lenstra, Lovasz reduction… (More)

Is this relevant?