Sciweavers

Share
ICC
2009
IEEE

Rapid Prototyping of Clarkson's Lattice Reduction for MIMO Detection

9 years 4 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 Clarkson’s Algorithm (CA), and its application to uncoded multiple input-multiple output (MIMO) detection. The CA provides practically the same performance as the LLL algorithm while having a considerably lower complexity, especially for MIMO systems with a large number of transmit and receive antennas. The algorithm has been implemented in real-time using a rapid prototyping methodology, greatly reducing its development time. Implementation results indicate that the variable complexity and the sequential nature of LR algorithms, like the CA, remain their main drawbacks from an implementation point of view.
Luis G. Barbero, David L. Milliner, Tharmalingam R
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where ICC
Authors Luis G. Barbero, David L. Milliner, Tharmalingam Ratnarajah, John R. Barry, Colin Cowan
Comments (0)
books