Stability analysis in Gram-Schmidt QR decomposition

In this study, important aspects concerning the stability of the QR decomposition (QRD) through the modified Gram-Schmidt (GS) orthogonalisation procedure with application in multiple-input–multiple-output (MIMO) detection are investigated. In particular, the numerical stability of GS-QRD is analysed through the condition number, considering a matrix with Gaussian entries, which is a very special class of matrix, especially for telecommunication systems in general and for MIMO system in particular. The condition number is analysed in the average sense, aided by random processes theory, including in special the central limit theorem, random variable transformation and moment generating functions. An analytical bound for the condition number is found and corroborated by numerical simulations.

[1]  Yuan-Hao Huang,et al.  A modified sorted-QR decomposition algorithm for parallel processing in MIMO detection , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[2]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[3]  Dirk Wübben,et al.  Reduced complexity MMSE detection for BLAST architectures , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Feng Lu,et al.  Lattice reduction-ordered successive interference cancellation detection algorithm for multiple-input-multiple-output system , 2015, IET Signal Process..

[5]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[6]  Poras T. Balsara,et al.  Complex QR Decomposition Using Fast Plane Rotations for MIMO Applications , 2014, IEEE Communications Letters.

[7]  Ron Dabora,et al.  Improved QRD-QLD Algorithm for Low Complexity MIMO Decoding , 2014, IEEE Communications Letters.

[8]  Tae-Hwan Kim.  Low-Complexity Sorted QR Decomposition for MIMO Systems Based on Pairwise Column Symmetrization , 2014, IEEE Trans. Wirel. Commun..

[9]  Inkyu Lee,et al.  A New Reduced Complexity ML Detection Scheme for MIMO Systems , 2010, 2009 IEEE International Conference on Communications.

[10]  Sudip Mondal,et al.  A novel approach for K-best MIMO detection and its VLSI implementation , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[11]  Å. Björck.  Numerics of Gram-Schmidt orthogonalization , 1994 .

[12]  Hiroyuki Kawai,et al.  Complexity Reduced MLD Based on QR Decomposition in OFDM MIMO Multiplexing with Frequency Domain Spreading and Code Multiplexing , 2009, 2009 IEEE Wireless Communications and Networking Conference.

[13]  C. Craig.  On the Frequency Function of $xy$ , 1936 .

[14]  G. Stewart,et al.  Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .

[15]  Shuangshuang Han,et al.  Improved K-Best Sphere Detection for Uncoded and Coded MIMO Systems , 2012, IEEE Wireless Communications Letters.

[16]  Taufik Abrão,et al.  Ordered MMSE–SIC via sorted QR decomposition in ill conditioned large-scale MIMO channels , 2016, Telecommun. Syst..