Design and Analysis of Large MIMO Systems With Krylov Subspace Receivers

This paper studies large multiple-input multiple-output (MIMO) communication systems with linear precoding and reduced-rank Krylov subspace receivers. We design precoders and analyze their performance by exploiting large-dimensional random matrix theory. We first devise low-complexity precoding schemes that can improve performance of low-rank Krylov subspace receivers in the regime of high signal-to-noise ratio (SNR). We then introduce a potential theory-based method for analyzing the convergence behavior of the mean-squared error (MSE) for various transmission schemes. This method can be applied to a broader range of problems compared to previous analytical tools. The analysis reveals that the MSE decreases super exponentially with the rank of the receiver. Numerical examples show that the proposed precoders can outperform conventional precoders when low-rank Krylov subspace receivers are used, and that the performance of such receivers can be accurately predicted.

[1]  Michael L. Honig,et al.  Reduced-rank signature~receiver adaptation , 2006, IEEE Transactions on Wireless Communications.

[2]  Wolfgang Utschick,et al.  Complexity Reduction of Iterative Receivers Using Low-Rank Equalization , 2007, IEEE Transactions on Signal Processing.

[3]  Philippe Loubaton,et al.  Asymptotic Analysis of Reduced-Rank Chip-Level MMSE Equalizers in the Downlink of CDMA Systems , 2004, IEEE Transactions on Signal Processing.

[4]  J. W. Silverstein,et al.  Spectral Analysis of Large Dimensional Random Matrices , 2009 .

[5]  Antonia Maria Tulino,et al.  Eigenvalue Statistics of Finite-Dimensional Random Matrices for MIMO Wireless Communications , 2006, 2006 IEEE International Conference on Communications.

[6]  Pedro M. Crespo,et al.  Asymptotically Equivalent Sequences of Matrices and Hermitian Block Toeplitz Matrices With Continuous Symbols: Applications to MIMO Systems , 2008, IEEE Transactions on Information Theory.

[7]  Arno B. J. Kuijlaars,et al.  Superlinear Convergence of Conjugate Gradients , 2001, SIAM J. Numer. Anal..

[8]  Philippe Loubaton,et al.  Asymptotic analysis of reduced rank Wiener filters , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[9]  Yi Jiang,et al.  MIMO Transceiver Design via Majorization Theory , 2007, Found. Trends Commun. Inf. Theory.

[10]  Antonia Maria Tulino,et al.  Design of reduced-rank MMSE multiuser detectors using random matrix methods , 2004, IEEE Transactions on Information Theory.

[11]  Arno B. J. Kuijlaars,et al.  Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory , 2006, SIAM Rev..

[12]  S. Helsena,et al.  A numerical solution of the constrained energy problem , 2006 .

[13]  Florian Kaltenberger,et al.  Low-Cost Approximate LMMSE Equalizer Based on Krylov Subspace Methods for HSDPA , 2007, IEEE Transactions on Wireless Communications.

[14]  Jun Tong,et al.  Linear precoding for time-varying MIMO channels with low-complexity receivers , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

[16]  John M. Cioffi,et al.  Joint Tx-Rx beamforming design for multicarrier MIMO channels: a unified framework for convex optimization , 2003, IEEE Trans. Signal Process..

[17]  H. Ge,et al.  Warp convergence in conjugate gradient Wiener filters , 2004, Processing Workshop Proceedings, 2004 Sensor Array and Multichannel Signal.

[18]  Marc Van Barel,et al.  A numerical solution of the constrained weighted energy problem , 2010, J. Comput. Appl. Math..

[19]  Michael L. Honig,et al.  Performance of reduced-rank linear interference suppression , 2001, IEEE Trans. Inf. Theory.

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

[21]  Ralf R. Müller,et al.  A systematic approach to multistage detectors in multipath fading channels , 2005, IEEE Transactions on Information Theory.

[22]  Jason Gao,et al.  MIMO transmission over a time-varying channel using SVD , 2002, IEEE Transactions on Wireless Communications.

[23]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[24]  Michael D. Zoltowski,et al.  Subspace Expansion and the Equivalence of Conjugate Direction and Multistage Wiener Filters , 2008, IEEE Transactions on Signal Processing.

[25]  Louis L. Scharf,et al.  A Multistage Representation of the Wiener Filter Based on Orthogonal Projections , 1998, IEEE Trans. Inf. Theory.

[26]  Iain B. Collings,et al.  Optimal multistage linear multiuser receivers , 2005, IEEE Transactions on Wireless Communications.

[27]  Jun Tong,et al.  Precoder design and convergence analysis of MIMO systems with Krylov subspace receivers , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[28]  Josef A. Nossek,et al.  On the condition number distribution of complex wishart matrices , 2010, IEEE Transactions on Communications.

[29]  Xavier Mestre,et al.  Generalized Consistent Estimation on Low-Rank Krylov Subspaces of Arbitrarily High Dimension , 2009, IEEE Transactions on Signal Processing.

[30]  Antonia Maria Tulino,et al.  Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.

[31]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[32]  Gilbert Strang,et al.  The Potential Theory of Several Intervals and Its Applications , 2001 .

[33]  J. Shewchuk.  An Introduction to the Conjugate Gradient Method Without the Agonizing Pain , 1994 .