Rapid prototyping of Clarksons lattice reduction for MIMO detection

  • Authors:

  • Luis G. Barbero;David L. Milliner;T. Ratnarajah;John R. Barry;Colin Cowan

  • Affiliations:

  • ECIT Institute, Queen's University, Belfast, UK;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta;ECIT Institute, Queen's University, Belfast, UK;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta;ECIT Institute, Queen's University, Belfast, UK

  • Venue:
  • ICC'09 Proceedings of the 2009 IEEE international conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the field-programmable gate array (FPGA) implementation of a variant of the Lenstra-Lenstra-Lovász (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.