Low complexity complex matrix inversion method for MIMO communication systems

In multiple-input multiple-output (MIMO) communication systems, complex matrix inversion is a very computationally demanding operation. Especially when the number of antennas increases, i.e., in a massive MIMO system, the complexity of matrix inversion becomes very high. Motivated by this observation, a new low complexity complex matrix inversion method, called SDF-SGR (Square root and Division Free Squared Givens' Rotations) based algorithm, is designed for MIMO channels. Square root operation is avoided in the whole algorithm, and division operation is replaced by shift operation during the Givens' rotations phase. Besides, since the scale factor z, involved in the traditional SGR, has little influence on the whole algorithm, it is removed in this SDF-SGR algorithm. Considering a 4×4 complex matrix inversion, the SDF-SGR based algorithm could reduce the multiplication operations by 13.07% compared with the traditional SGR algorithm, and the division operation is reduced by almost 52.94%.

[1]  S. Althoen,et al.  Gauss-Jordan reduction: a brief history , 1987 .

[2]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[3]  M. Ylinen,et al.  A fixed-point implementation of matrix inversion using Cholesky decomposition , 2003, 2003 46th Midwest Symposium on Circuits and Systems.

[4]  Yuan-Hao Huang,et al.  A Hybrid RF/Baseband Precoding Processor Based on Parallel-Index-Selection Matrix-Inversion-Bypass Simultaneous Orthogonal Matching Pursuit for Millimeter Wave MIMO Systems , 2015, IEEE Transactions on Signal Processing.

[5]  Lei Ma,et al.  QR Decomposition-Based Matrix Inversion for High Performance Embedded MIMO Receivers , 2011, IEEE Transactions on Signal Processing.

[6]  Babak Hassibi,et al.  An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[7]  William H. Press,et al.  Numerical Recipes: The Art of Scientific Computing , 1987 .

[8]  Joseph R. Cavallaro,et al.  FPGA Implementation of Matrix Inversion Using QRD-RLS Algorithm , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[9]  David H. Bailey,et al.  A Strassen-Newton algorithm for high-speed parallelizable matrix inversion , 1988, Proceedings. SUPERCOMPUTING '88.

[10]  R. Döhler,et al.  Squared Givens Rotation , 1991 .

[11]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[12]  R. CalderbankA.,et al.  Space-time codes for high data rate wireless communication , 2006 .

[13]  Gene H. Golub,et al.  Matrix computations , 1983 .

[14]  Shahram Payandeh,et al.  GPU in Haptic Rendering of Deformable Objects , 2008, EuroHaptics.

[15]  W. Press,et al.  Numerical Recipes: The Art of Scientific Computing , 1987 .

[16]  James Hardy Wilkinson,et al.  Householder's method for symmetric matrices , 1962 .

[17]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[18]  Johan Eilert,et al.  Efficient Complex Matrix Inversion for MIMO Software Defined Radio , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[19]  D. Farden,et al.  Statistical design of nonrecursive digital filters , 1974 .

[20]  Viktor Öwall,et al.  A scalable pipelined complex valued matrix inversion architecture , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[21]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[22]  John G. Proakis,et al.  Digital Communications , 1983 .