VLSI implementation of a low-complexity LLL lattice reduction algorithm for MIMO detection

Lattice-reduction (LR)-aided successive interference cancellation (SIC) is able to achieve close-to optimum error-rate performance for data detection in multiple-input multiple-output (MIMO) wireless communication systems. In this work, we propose a hardware-efficient VLSI architecture of the Lenstra-Lenstra-Lovász (LLL) LR algorithm for SIC-based data detection. For this purpose, we introduce various algorithmic modifications that enable an efficient hardware implementation. Comparisons with existing FPGA implementations show that our design outperforms state-of-the-art LR implementations in terms of hardware-efficiency and throughput. We finally provide reference ASIC implementation results for 130nm CMOS technology.

[1]  D. Wubben,et al.  On the Performance of Lattice Reduction Schemes for MIMO Data Detection , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[2]  Cong Ling,et al.  Effective LLL Reduction for Lattice Decoding , 2007, 2007 IEEE International Symposium on Information Theory.

[3]  Andreas Peter Burg,et al.  VLSI Implementation of a High-Speed Iterative Sorted MMSE QR Decomposition , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[4]  Helmut Bölcskei,et al.  Space-Time Wireless Systems: From Array Processing to MIMO Communications , 2008 .

[5]  Xiaoli Ma,et al.  VLSI Implementation of a Lattice Reduction Algorithm for Low-Complexity Equalization , 2008, 2008 4th IEEE International Conference on Circuits and Systems for Communications.

[6]  Tharmalingam Ratnarajah,et al.  Rapid Prototyping of Clarkson's Lattice Reduction for MIMO Detection , 2009, 2009 IEEE International Conference on Communications.

[7]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[8]  Wolfgang Fichtner,et al.  Hardware-efficient steering matrix computation architecture for MIMO communication systems , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[9]  I. Vaughan L Clarkson,et al.  Approximation of linear forms by lattice points with applications to signal processing , 1997 .

[10]  Peter A. Hoeher,et al.  Fixed Complexity LLL Algorithm , 2009, IEEE Transactions on Signal Processing.

[11]  Earl E. Swartzlander,et al.  Computer Arithmetic , 1980 .

[12]  Robert F. H. Fischer,et al.  Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[13]  C. Siegel,et al.  Lectures on the Geometry of Numbers , 1989 .

[14]  Gerald Matz,et al.  Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[15]  D.V. Anderson,et al.  Single newton-raphson iteration for integer-rounded divider for lattice reduction algorithms , 2008, 2008 51st Midwest Symposium on Circuits and Systems.

[16]  Mircea Vladutiu,et al.  Computer Arithmetic , 2012, Springer Berlin Heidelberg.

[17]  Gerald Matz,et al.  VLSI Implementation of a Lattice-Reduction Algorithm for Multi-Antenna Broadcast Precoding , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[18]  Gregory W. Wornell,et al.  Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.