Blind adaptive constrained reduced-rank parameter estimation based on constant modulus design for CDMA interference suppression

This paper proposes a multistage decomposition for blind adaptive parameter estimation in the Krylov subspace with the code-constrained constant modulus (CCM) design criterion. Based on constrained optimization of the constant modulus cost function and utilizing the Lanczos algorithm and Arnoldi-like iterations, a multistage decomposition is developed for blind parameter estimation. A family of computationally efficient blind adaptive reduced-rank stochastic gradient (SG) and recursive least squares (RLS) type algorithms along with an automatic rank selection procedure are also devised and evaluated against existing methods. An analysis of the convergence properties of the method is carried out and convergence conditions for the reduced-rank adaptive algorithms are established. Simulation results consider the application of the proposed techniques to the suppression of multiaccess and intersymbol interference in DS-CDMA systems

Asynchronous CDMA Systems with Random Spreading-Part I: Fundamental Limits

Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit allowing for arbitrary chip waveforms and frequency-flat fading. Signal to interference and noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean square error (MMSE) detectors, are derived. The approach is general and optionally allows even for statistics obtained by under-sampling the received signal. All performance measures are given as a function of the chip waveform and the delay distribution of the users in the large system limit. It turns out that synchronizing users on a chip level impairs performance for all chip waveforms with bandwidth greater than the Nyquist bandwidth, e.g., positive roll-off factors. For example, with the pulse shaping demanded in the UMTS standard, user synchronization reduces spectral efficiency up to 12% at 10 dB normalized signal-to-noise ratio. The benefits of asynchronism stem from the finding that the excess bandwidth of chip waveforms actually spans additional dimensions in signal space, if the users are de-synchronized on the chip-level. The analysis of linear MMSE detectors shows that the limiting interference effects can be decoupled both in the user domain and in the frequency domain such that the concept of the effective interference spectral density arises. This generalizes and refines Tse and Hanly's concept of effective interference. In Part II, the analysis is extended to any linear detector that admits a representation as multistage detector and guidelines for the design of low complexity multistage detectors with universal weights are provided

Adaptive interference suppression for DS-CDMA systems based on interpolated FIR filters with adaptive interpolators in multipath channels

In this work we propose an adaptive linear receiver structure based on interpolated finite impulse response (FIR) filters with adaptive interpolators for direct sequence code division multiple access (DS-CDMA) systems in multipath channels. The interpolated minimum mean-squared error (MMSE) and the interpolated constrained minimum variance (CMV) solutions are described for a novel scheme where the interpolator is rendered time-varying in order to mitigate multiple access interference (MAI) and multiple-path propagation effects. Based upon the interpolated MMSE and CMV solutions we present computationally efficient stochastic gradient (SG) and exponentially weighted recursive least squares type (RLS) algorithms for both receiver and interpolator filters in the supervised and blind modes of operation. A convergence analysis of the algorithms and a discussion of the convergence properties of the method are carried out for both modes of operation. Simulation experiments for a downlink scenario show that the proposed structures achieve a superior BER convergence and steady-state performance to previously reported reduced-rank receivers at lower complexity

Adaptive bootstrap signal separators for BPSK/QAM-modulated wireless CDMA systems in a multipath environment

CDMA is an attractive multiple-access scheme, because of its potential capacity increase and its anti-multipath fading capability. For satisfactory performance, however, the effect of the near-far problem has to be resolved. This problem can be combated by using power-control, which, however, results in an overall reduction in communication ranges, and thus in a loss of capacity. Among other methods for mitigating the near-far problem is the use of decorrelating receivers, both of fixed type, which directly utilizes the cross-correlation of the users codes, and of adaptive type, which uses recursive algorithms that leads to signal decorrelation. Not to lessen the importance of other adaptive algorithms, the current research concentrates on what was termed in the literature bootstrap algorithm . Although the emphasis will be on applying the adaptive bootstrap decorrelator, the fixed type will be used primarily to provide comparison. Also used for comparison are both blind adaptive and training sequence based MMSE. Most of the literature on multiuser detection has been assuming BPSK. However, a need for transferring wideband data demands using modulation schemes with high bits/cycle, such as QAM. Therefore, modification of the receiver is considered, so that QAM-modulation can be applied efficiently, using the complex signal approach of this modulation. For the asynchronous channel, vast amounts of research have been devoted to using one-shot matched filter banks followed by conventional decorrelators which implement the inverse of some (partial) correlation matrix. In this work, an adaptive bootstrap version is presented, which is suitable for the one-shot structure shown previously to be more robust to errors in delay estimation. It has also been noted that such a correlation matrix can, depending on the channel characteristics, become ill-conditioned or even singular. Therefore, another matched filtering structure, followed by what is called a multishot conventional (fixed type) decorrelator, has been previously suggested to mitigate this singularity problem. However, the fixed type of the multishot decorrelator is expected to have similar non-robustness to errors in delay estimation as was previously shown for the one-shot. Therefore, the adaptive multishot bootstrap decorrelator is presented and evaluated. Also, by adding an adaptive canceler, an extension to the above matched filter-decorrelator combination, will be proposed and evaluated. A multipath time-variant fading environment will be used in some of these performance evaluations. Finally, when handling multipath channels, the question is raised whether path combining should be done before or after the signals are decorrelated. For the asynchronous case, a one-shot extension of the bootstrap algorithm is presented, which is capable of decorrelating the signals from resolved paths of different users, to facilitate the decorrelate before combining case

Asymptotic Moments for Interference Mitigation in Correlated Fading Channels

We consider a certain class of large random matrices, composed of independent column vectors with zero mean and different covariance matrices, and derive asymptotically tight deterministic approximations of their moments. This random matrix model arises in several wireless communication systems of recent interest, such as distributed antenna systems or large antenna arrays. Computing the linear minimum mean square error (LMMSE) detector in such systems requires the inversion of a large covariance matrix which becomes prohibitively complex as the number of antennas and users grows. We apply the derived moment results to the design of a low-complexity polynomial expansion detector which approximates the matrix inverse by a matrix polynomial and study its asymptotic performance. Simulation results corroborate the analysis and evaluate the performance for finite system dimensions.Comment: 7 pages, 2 figures, to be presented at IEEE International Symposium on Information Theory (ISIT), Saint Petersburg, Russia, July 31 - August 5, 201