Complex QR Decomposition Using Fast Plane Rotations for MIMO Applications

QR decomposition (QRD) is widely used in various engineering applications and its implementation has a significant impact on the system performance and complexity. This paper develops a low-complexity QRD algorithm based on fast plane rotations, which does not require square-root operations for decomposing a complex-valued matrix. Furthermore, an update-based implementation is presented where computations are performed incrementally as the data arrives sequentially in time to drastically reduce the overall latency and hardware resources. Practical results for QRD-based spatial correlation estimator are provided to demonstrate the effectiveness of our solution for multiple-input multiple-output (MIMO) systems with complex-valued signals.

[1]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[2]  John M. Cioffi,et al.  The ITU-T's new g.vector standard proliferates 100 mb/s dsl , 2010, IEEE Communications Magazine.

[3]  Haesun Park,et al.  Fast Plane Rotations with Dynamic Scaling , 1994, SIAM J. Matrix Anal. Appl..

[4]  Pei-Yun Tsai,et al.  Efficient Implementation of QR Decomposition for Gigabit MIMO-OFDM Systems , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  John M. Cioffi,et al.  Vectored transmission for digital subscriber line systems , 2002, IEEE J. Sel. Areas Commun..

[6]  K. Sridharan,et al.  50 Years of CORDIC: Algorithms, Architectures, and Applications , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[7]  Poras T. Balsara,et al.  Alien crosstalk mitigation in vectored DSL systems for backhaul applications , 2012, 2012 IEEE International Conference on Communications (ICC).

[8]  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.

[9]  Chih-Hung Lin,et al.  Iterative QR Decomposition Architecture Using the Modified Gram-Schmidt Algorithm for MIMO Systems , 2010, IEEE Trans. Circuits Syst. I Regul. Pap..

[10]  W. E. Gentleman.  Least Squares Computations by Givens Transformations Without Square Roots , 1973 .

[11]  Chih-Hung Lin,et al.  Iterative $QR$ Decomposition Architecture Using the Modified Gram–Schmidt Algorithm for MIMO Systems , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[13]  Ji-Hwan Yoon,et al.  Multidimensional Householder based high-speed QR decomposition architecture for MIMO receivers , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).