Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

C3S2E
2011
ACM

favoriteEmaildiscussreport

256views Software Engineering» more C3S2E 2011»

A parallel LLL algorithm

12 years 8 months ago

A parallel LLL algorithm

Download www.cas.mcmaster.ca

The LLL algorithm is a well-known and widely used lattice basis reduction algorithm. In many applications, its speed is critical. Parallel computing can improve speed. However, the original LLL is sequential in nature. In this paper, we present a multi-threading LLL algorithm based on a recently improved version: an LLL algorithm with delayed size reduction. Categories and Subject Descriptors G.4 [Mathematical Software]: Parallel and vector im

Yixian Luo, Sanzheng Qiao

Real-time Traffic

C3S2E 2011 | Lattice Basis Reduction | LLL Algorithm | Reduction Algorithm | Software Engineering |

claim paper

Related Content

» Parallel Lattice Basis Reduction Using a Multithreaded SchnorrEuchner LLL Algorithm

» WorstCase Complexity of the Optimal LLL Algorithm

» Complex Lattice Reduction Algorithm for LowComplexity MIMO Detection

» Worst and averagecase complexity of LLL lattice reduction in MIMO wireless systems

» Parallel Lattice Basis Reduction

» Modelling the LLL Algorithm by Sandpiles

» Rapid Prototyping of Clarksons Lattice Reduction for MIMO Detection

» Integer least squares sphere decoding and the LLL algorithm

» An Efficient LLL Gram Using Buffered Transformations

Post Info
More Details (n/a)

Added	24 Aug 2011
Updated	24 Aug 2011
Type	Journal
Year	2011
Where	C3S2E
Authors	Yixian Luo, Sanzheng Qiao

Comments (0)