Fixed Complexity von Algorithm

A common technique to perform lattice basis reduction is the Lenstra, Lenstra, Lovasz (LLL) algorithm. An implementation of this algorithm in real-time systems suffers from the problem of variable run-time and complexity. This correspondence proposes a modification of the von algorithm. The signal f...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 57; no. 4; pp. 1634 - 1637
Main Authors Vetter, H, Ponnampalam, V, Sandell, M, Hoeher, P A
Format Journal Article
LanguageEnglish
Published 01.04.2009
Online AccessGet full text

Cover

More Information
Summary:A common technique to perform lattice basis reduction is the Lenstra, Lenstra, Lovasz (LLL) algorithm. An implementation of this algorithm in real-time systems suffers from the problem of variable run-time and complexity. This correspondence proposes a modification of the von algorithm. The signal flow is altered to follow a deterministic structure, which promises to obtain an easier implementation as well as a fixed execution time known in advance. In the case of a maximum number of iterations as it is likely in real-time systems, our modification clearly outperforms the original von algorithm as far as the quality of the reduced lattice basis is concerned.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
content type line 23
ObjectType-Feature-1
ISSN:1053-587X
DOI:10.1109/TSP.2008.2011827