Krylov Subspace Algorithms and Circulant-Embedding Method for Efficient Wideband Single-Carrier Equalization

Wider bandwidth allows higher data rate by transmitting narrower pulses. However, doing so would also increase the discrete channel memory length. For single-carrier communication systems this results in higher computational burden at the receiver. We are concerned with single-carrier nonblock transmission schemes with receiver oversampling, as they can provide higher spectral efficiency than block transmission schemes in the presence of large delay spreads. We first propose a simple finite-impulse-response (FIR) equalizer that is based on the circulant-embedding (CE) method and analyze its performance by investigating the relationship between solutions of various finite-dimensional models and the original infinite-dimensional problem. We show that under proper conditions the CE FIR equalizer converges exponentially fast to the IIR equalizer. We then focus on the conjugate gradient (CG) algorithm as an efficient means for equalization that is specifically well suited for dealing with large-delay-spread channels. We discuss the importance of stopping the iterations for the CG algorithm at the right time in the presence of noise and present several reliable low-cost stopping criteria. It turns out that the CG algorithm equipped with appropriate stopping criteria can outperform MMSE equalizers. Since both the CE and the CG methods can be efficiently implemented via fast Fourier transforms, equalization complexity is only in the order of N log(N) for N data symbols. Several numerical experiments demonstrate the performance of the proposed methods.

[1]  Luc Deneire,et al.  Training sequence versus cyclic prefix-a new look on single carrier communication , 2001, IEEE Communications Letters.

[2]  David Falconer,et al.  Frequency domain equalization for single-carrier broadband wireless systems , 2002, IEEE Commun. Mag..

[3]  M. Hanke.  Limitations of the L-curve method in ill-posed problems , 1996 .

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

[5]  Thomas Strohmer.  Rates of convergence for the approximation of dual shift-invariant systems in ℓ2(ℤ) , 1999 .

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

[7]  Georgios B. Giannakis,et al.  Signal processing advances in wireless and mobile communications , 2000, IEEE Signal Process. Mag..

[8]  Yoram Bresler,et al.  FIR perfect signal reconstruction from multiple convolutions: minimum deconvolver orders , 1998, IEEE Trans. Signal Process..

[9]  Thomas Strohmer.  Four short stories about Toeplitz matrix calculations , 2000 .

[10]  J. Navarro-Pedreño.  Numerical Methods for Least Squares Problems , 1996 .

[11]  P. Vaidyanathan.  Multirate Systems And Filter Banks , 1992 .

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

[13]  M. Hanke.  Conjugate gradient type methods for ill-posed problems , 1995 .

[14]  Per Christian Hansen,et al.  Regularization methods for large-scale problems , 1993 .

[15]  A Tikhonov,et al.  Solution of Incorrectly Formulated Problems and the Regularization Method , 1963 .

[16]  A. Wathen,et al.  Iterative Methods for Toeplitz Systems , 2005 .

[17]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[18]  W. K. Jenkins,et al.  Channel equalization with adaptive filtering and the preconditioned conjugate gradient algorithm , 1997, Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97.

[19]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[20]  Andreas Frommer,et al.  Fast CG-Based Methods for Tikhonov-Phillips Regularization , 1999, SIAM J. Sci. Comput..

[21]  Jorma Lilleberg,et al.  Space-time equalization using conjugate-gradient algorithm in WCDMA downlink , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[22]  Anna Scaglione,et al.  Redundant filterbank precoders and equalizers , 1998 .

[23]  Anna Scaglione,et al.  Redundant filterbank precoders and equalizers. I. Unification and optimal designs , 1999, IEEE Trans. Signal Process..

[24]  P. Hansen.  Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion , 1987 .

[25]  Raymond H. Chan,et al.  Conjugate Gradient Methods for Toeplitz Systems , 1996, SIAM Rev..

[26]  Rohit U. Nabar,et al.  Introduction to Space-Time Wireless Communications , 2003 .

[27]  Michael L. Honig,et al.  Performance of Reduced-Rank Equalization , 2006, IEEE Transactions on Information Theory.

[28]  Georgios B. Giannakis,et al.  OFDM or single-carrier block transmissions? , 2004, IEEE Transactions on Communications.

[29]  J.R. Cavallaro,et al.  ASIP architecture implementation of channel equalization algorithms for MIMO systems in WCDMA downlink , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[30]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

[31]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[32]  Sergei V. Pereverzev,et al.  Morozov's discrepancy principle for tikhonov , 2000 .

[33]  Georgios B. Giannakis,et al.  Ultra-wideband communications: an idea whose time has come , 2003, 2003 4th IEEE Workshop on Signal Processing Advances in Wireless Communications - SPAWC 2003 (IEEE Cat. No.03EX689).