Multiuser detection in asynchronous CDMA frequency-selective fading channels

Multipath fading severely limits the performances of conventional code division multiple-access (CDMA) systems. Since every signal passes through an independent frequency-selective fading channel, even modest cross-correlations among signature sequences may induce severe near-far effects in a central multiuser receiver. This paper presents a systematic approach to the detection problem in CDMA frequency-selective fading channels and proposes a low complexity linear multiuser receiver, which eliminates fading induced near-far problem.We initially analyze an optimal multiuser detector, consisting of a bank of RAKE filters followed by a dynamic programming algorithm and evaluate its performance through error probability bounds. The concepts of error sequence decomposition and asymptotic multiuser efficiency, used to characterize the optimal receiver performance, are extended to multipath fading channels.The complexity of the optimal detector motivates the work on a near-far resistant, low complexity decorrelating multiuser detector, which exploits multipath diversity by using a multipath decorrelating filter followed by maximal-ratio combining. Analytic expressions for error probability and asymptotic multiuser efficiency of the suboptimal receiver are derived that include the effects of multipath fading, multiple-access interference and signature sequences correlation on the receiver's performance.The results indicate that multiuser detectors not only alleviate the near-far problem but approach single-user RAKE performance, while preserving the multipath diversity gain. In interference-limited scenarios multiuser receivers significantly outperform the RAKE receiver.This paper was presented in part at the Twenty-Sixth Annual Conference on Information Sciences and Systems, Princeton, NJ, March 1992 and MILCOM'92, San Diego, CA, October 1992. This work was performed while author was with the Department of Electrical and Computer Engineering, Northeastern University, Boston, USA.     

Direct blind multiuser detection for CDMA in multipath withoutchannel estimation

We consider the blind multiuser detection problem for asynchronous DS-CDMA systems operating in a multipath environment. Using only the spreading code of the desired user, we first estimate the column vector subspace of the channel matrix by multiple linear prediction. Then, zero-forcing detectors and MMSE detectors with arbitrary delay can be obtained without explicit channel estimation. This avoids any channel estimation error, and the resulting methods are therefore more robust and more accurate. Corresponding batch algorithms and adaptive algorithms are developed. The new algorithms are extremely near-far resistant. Simulations demonstrate the effectiveness of these methods     

Differentially Coherent Blind Adaptive Receiver for Rayleigh Fading CDMA Channels

Interest in code division multiple access (CDMA) has increased dramaticallyin boththe industry and academia. This is due to the potential increase in usercapacity andinterference, multipath fading, and jam-resistant capabilities. Differentapproaches ofmultiuser detection schemes have shown improvement over the conventionalreceiver.However, multiuser detectors require system parameters and adaptive multiuserreceivers require training sequences. These parameters are difficult toobtain inmultipath fading channels with a degradation in performance. A blind adaptivemultiuser receiver for flat fading and frequency-selective fading environments isstudied in this paper. This receiver alleviates the problem of multiuser detectors and adaptivemultiuser receivers by using a blind adaptive equalization method. The structure of the receiveris similar to that of the adaptive MMSE receiver which consists of an adaptive equalizer and an adaptivemechanism that uses a standard least mean-squared (LMS) algorithm, but uses a matched filterto generate a reference signal. The receiver is shown to be effective in different fadingchannels with perfect power control and a near-far effect. Furthermore, the simulationresults show that the blind MMSE receiver outperforms the conventional receiver and theRAKE receiver.     

Blind adaptive multiuser detection

The decorrelating detector and the linear minimum mean-square error (MMSE) detector are known to be effective strategies to counter the presence of multiuser interference in code-division multiple-access channels; in particular, those multiuser detectors provide optimum near-far resistance. When training data sequences are available, the MMSE multiuser detector can be implemented adaptively without knowledge of signature waveforms or received amplitudes. This paper introduces an adaptive multiuser detector which converges (for any initialization) to the MMSE detector without requiring training sequences. This blind multiuser detector requires no more knowledge than does the conventional single-user receiver: the desired user's signature waveform and its timing. The proposed blind multiuser detector is made robust with respect to imprecise knowledge of the received signature waveform of the user of interest     

Near-far resistance of multiuser detectors in asynchronous channels

Consideration is given to an asynchronous code-division multiple-access environment in which receiver has knowledge of the signature waveforms of all the users. Under the assumption of white Gaussian background noise, the authors compare detectors by their worst case bit error rate in a near-far environment with low background noise, where the received energies of the users are unknown to the receiver and are not necessarily similar. Conventional single-user detection in a multiuser channel is not near-far resistant, and the substantially higher performance of the optimum multiuser detector requires exponential complexity in the number of users. The authors explore suboptimal demodulation schemes which exhibit a low order of complexity while not exhibiting the impairment of the conventional single-user detector. It is shown that there exists a linear detector whose bit-error-rate is independent of the energy of the interfering users. It is also shown that the near-far resistance of optimum multiuser detection can be achieved by a linear detector. The optimum linear detector for worst-case energies is found, along with existence conditions, which are always satisfied in the models of practical interest     

一种新的盲空时多用户检测器

多用户检测是DS-CDMA系统中的一项关键技术,而阵列天线也是一项减轻多用户干扰的方法.许多现存的多用户检测器需要知道很多系统参数,并且其自适应实现需要发送训练序列.在多径衰落信道下,这些参数是很难获得的.本文提出了一种新的基于Kalman滤波的盲空时多用户检测器(BSTKAL),这种多用户检测器不需要发送训练序列.研究结果表明,检测器具有较强的抑制多址干扰和克服"远-近"效应的能力,并且能快速收敛.     

Asymptotic analysis of blind multiuser detection with blind channel estimation

The analytical performance of the subspace-based blind linear minimum mean-square error (MMSE) multiuser detection algorithm in general multipath multi-antenna code-division multiple-access (CDMA) systems is investigated. In blind multiuser detection, the linear MMSE detector of a given user is estimated from the received signals, based on the knowledge of only the spreading sequence of that user. Typically, the channel of that user must be estimated first, based on the orthogonality between the signal and noise subspaces. An asymptotic limit theorem for the estimate of the blind linear detector (when the received signal sample size is large) is obtained, based on which approximate expressions of the average output signal-to-inference plus noise ratios (SINRs) and bit error rates (BERs) for both binary phase-shift keying (BPSK) and quaternary phase-shift keying (QPSK) modulations are given. Corresponding results for group-blind multiuser detectors are also obtained. Examples are provided to demonstrate the excellent match between the theory developed in this paper and the simulation results.     

Block modulus precoding for blind multiuser detection of DS-CDMA signals

We propose a blind multiuser detector based on a new data precoding technique for direct-sequence code-division multiple-access signals. The modulus of all users' data is block encoded, using a sequence that is unique for each user. This precoding method, together with the analytical constant modulus algorithm for detection, enables a closed-form, one-shot detection of the desired user's signal in a multipath channel using one or more antennas. The detection process does not involve or require a channel estimation step. The proposed detector is shown to be extremely near-far resistant, and can operate properly in the presence of severe carrier frequency offset.     

A Study of the Technique of Linear Multiuser

The technique of linear multiuser detection in DS-CDMA systems is studied in this paper. The purpose is to find a receiver structure with good performance and moderate complexity, so that the receiver can efficiently suppress multiple-access interference(MAI) and multipath interference and has good near-far resistant ability, which may improve the system's capability while reducing the requirement for power control. The main work of the dissertation can be summarized as follows: the performance of MMSE multiuser detector in synchronous/asynchronous DS-CDMA systems over different channels is analyzed in chapter 2 of the dissertation. Using matrix method, we analyze the relation between performance measurement and spreading code correlation matrix, Signal-Interference-Ratio(SIR) and near-far factor, and prove that the performance of MMSE detector is better than that of the decorrelating detector. For fading channel, we analyze the performance of MMSE detector in DS-SS system firstly. Results show that the detector can efficiently suppress multipath interference. Extending to synchronous/asynchronous DS-CDMA systems over fading channels, we propose a simple linear detector structure that accomplishes despreading, detection and combining. Thus, the receiver is easy for implementation. Based on the proposed notion of combined spreading codes, we prove that the synchronous/asynchronous CDMA system is equivalent to the synchronous CDMA system over AWGN channel with double users. Therefore, the MMSE detector can efficiently suppress MAI and multipath interference in steady state, and has good near-far resistant ability. In chapter 3, we study the adaptive algorithm based on MMSE criterion. Firstly, the approach to the blind algorithm based on subspace is analyzed. We improve the algorithm in the part of channel estimation, which decreases the computational complexity while guaranteeing the performance. Meanwhile, we point out that CMOE-RLS algorithm is essentially an algorithm based on subspace approach. Also, it is shown from simulation that PASTd subspace tracking algorithm is not applicable for multiuser detection. Secondly, we propose an adaptive algorithm based on pilot channel, called PCA/PCRA. The algorithm does not require channel estimation, and has a rapid convergence rate. The steady state performance can be achieved by increasing the transmitting power in pilot channel. Computational complexity is only O(N2). Therefore, PCA/PCRA is suitable for the engineering application. The cost is that a pilot channel is needed for each user in the system. In chapter 4, constant algorithms for multiuser detection are studied. Firstly, we analyze the capture performance of CMA, and point out there exist many local stationary points. Initializations to guarantee CMA converges to the desired point are discussed. Results show that the convergence of CMA is decided by constant, step-size, spreading code correlation matrix and near-far factor. Secondly, we propose the constrained constant algorithm (C-CMA) for multiuser detection. It is shown that when the constant is greater than the triple power of the desired user, C-CMA globally converges to the desired point. Simulations illustrate that C-CMA has a rapid convergence rate and the steady state performance is good. However, great step-size can also reult in dispersion for the algorithm. Since C-CMA is a variable step-size CMOE-LMS algorithm, we propose a variable step-size constraint algorithm (VSCA). VSCA has the advantages of both CMOE-LMS and C-CMA such as robust, rapid convergence rate and good steady state performance. Thus, VSCA is suitable for engineering application. But the improper selection of step-size coefficients may degrade performance seriously. The computational complexity of the above constant algorithms is only O(N). In Section 5, the cyclostationarity of spreading signals is analyzed in the first part. We prove that spreading signals are ergodic cyclostationary signals with a cyclic period that is equal to the period of spreading code. Methods for processing cyclostationary signals are then given. It is shown that this method can mitigate the interference from a stationary noise for channel estimation. But the computational complexity for cyclostationary correlation is high, which prevents its application in implementation. In the second part, we discuss the application of oversampling technique in spreading communication systems. Although the oversampling can improve the performance of the linear multiuser detector, the improvement is trivial. On the contrary, oversampling increases the computational complexity of the weight vector greatly, which prevents its application in implementation. Additionally, we prove that FSE plus despreading or despreading pus FSE is equivalent to the linear detector with different lengths of delay line. However, the two kinds of structure have lower computational complexity.     

Linear multiuser detectors for synchronous code-divisionmultiple-access channels

Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, the authors analyze the detection mechanism at the receiver, comparing different detectors by their bit error rates in the low-background-noise region and by their worst-case behavior in a near-far environment where the received energies of the users are not necessarily similar. Optimum multiuser detection achieves important performance gains over conventional single-user detection at the expense of computational complexity that grows exponentially with the number of users. It is shown that in the synchronous case the performance achieved by linear multiuser detectors is similar to that of optimum multiuser detection. Attention is focused on detectors whose linear memoryless transformation is a generalized inverse of the matrix of signature waveform crosscorrelations, and on the optimum linear detector. It is shown that the generalized inverse detectors exhibit the same degree of near-far resistance as the optimum multiuser detectors. The optimum linear detector is obtained     

Multistage multiuser detector for DS-CDMA multipath fading channel

The proposed multistage multiuser detector for DS-CDMA communication over a multipath fading channel consists of a bank of matched filters and a linear equaliser whose outputs are diversity combined to produce initial data estimates. Using this data, multiuser interference is removed from the matched filter bank output. Diversity combining is then applied again, which produces the final decision statistics. Simulation results indicate that this detector is near-far resistant     

Directly estimated adaptive detectors for code-division multiple-access signals

This paper presents adaptive multiuser detectors for code-division multiple-access (CDMA) signals in wireless communication systems. Directly estimated adaptive (DEA) detectors are developed by formulating CDMA detection as an inverse problem in the presence of channel-induced interference and noise. The detector parameters are computed by a fully sequential adaptive algorithm that requires no matrix inversion, and can be implemented online as the data arrive at the receiver. The proposed DEA detector is experimentally evaluated in terms of its robustness to noise, resistance to the near-far problem, and ability to handle multipath fading signals. This experimental study indicates that the proposed DEA detector requires shorter training sequences of bits to achieve the performance levels attained by existing adaptive implementations of the minimum mean-square error detector.     

On the average near-far resistance for MMSE detection of directsequence CDMA signals with random spreading

The performance of a near-far-resistant, finite-complexity, minimum mean squared error (MMSE) linear detector for demodulating direct sequence (DS) code-division multiple access (CDMA) signals is studied, assuming that the users are assigned random signature sequences. We obtain tight upper and lower bounds on the expected near-far resistance of the MMSE detector, averaged over signature sequences and delays, as a function of the processing gain and the number of users. Since the MMSE detector is optimally near-far-resistant, these bounds apply to any multiuser detector that uses the same observation interval and sampling rate. The lower bound on near-far resistance implies that, even without power control, linear multiuser detection provides near-far-resistant performance for a number of users that grows linearly with the processing gain     

Large-sample performance of blind and Group-blind multiuser detectors: a perturbation perspective

In blind and group-blind multiuser detection, different detectors can be designed using either the sample data covariance matrix directly or its eigencomponents. Due to finite-sample effect in practice, their performance deviates from the corresponding optimum. A perturbation technique is developed rigorously and systematically to analyze those detectors in this work. Subject to the assumption that the first-order perturbation dominates, corresponding results can be applied to a practical system of a given sample size. In particular, performance of the following typical detectors is studied for either flat or estimated multipath channels: direct-matrix-inversion (DMI) blind minimum mean-square error (MMSE) detector, subspace blind MMSE detector, direct zero-forcing (ZF) detector, subspace ZF detector, and group-blind hybrid detector. Simulation examples further verify various analytical results.     

Suboptimal multiuser detector for frequency-selective Rayleighfading synchronous CDMA channels

Proposes a suboptimal low-complexity multiuser receiver for synchronous CDMA frequency-selective Rayleigh fading channels. In contrast to the conventional RAKE receiver, which suffers from near-far effects due to channel fading, the proposed multiuser receiver is shown to alleviate the near-far problem while preserving multipath diversity gain. This is demonstrated by comparing the symbol error probability and asymptotic multiuser efficiency of the proposed multiuser detector and RAKE receiver     

Performance analysis of linear multiuser detectors for randomlyspread CDMA using Gaussian approximation

The performance of a linear decorrelating detector (LDD) and a minimum mean square error (MMSE) detector is analyzed for random spreading waveforms. The performance of the LDD and MMSE detectors is expressed in terms of the so-called near-far resistance, defined by a reciprocal of a diagonal component of inverse matrix. For random code division multiple access, which employs random spreading waveforms, the near-far resistance can be regarded as a random variable. Many papers have dealt with the analysis of multiuser detectors for random spreading sequences. In most cases, however, these analyses derived only the expectations or bounds for the near-far resistance. In this paper, we directly derive the approximate probability density function (PDF) of the near-far resistance and corresponding bit error rate expression for random spreading sequences. It is based on Gaussian approximation of the cross correlation between any two randomly generated spreading codes. The resulting PDF turned out to be a reversed-and-scaled version of chi-square distribution. The approximate expressions, both the PDF and the corresponding bit error rate expression, were verified via Monte Carlo simulations. The results showed that the approximation is quite close to the simulation results when the number of users is less than half the processing gain     

Maximum-likelihood synchronization of a single user forcode-division multiple-access communication systems

Code-division multiple access (CDMA) has emerged as an access protocol well-suited for voice and data transmission. One significant limitation of the conventional CDMA system is the near-far problem where strong signals interfere with the detection of a weak signal. Multiuser detectors assume knowledge of all of the modulation waveforms and channel parameters, and exploit this information to eliminate multiple-access interference (MAI) and to achieve near-far resistance. A major problem in practical application of multiuser detection is the estimation of the signal and channel parameters in a near-far limited system. We consider maximum-likelihood estimation of users delay, amplitude, and phase in a CDMA communication system. We present an approach for decomposing this multiuser estimation problem into a series of single-user problems. In this method the interfering users are treated as colored non-Gaussian noise. The observation vectors are preprocessed to be able to apply a Gaussian model for the MAI. The maximum-likelihood estimate (MLE) of each user's parameters based on the processed observation vectors becomes tractable. The estimator includes a whitening filter derived from the sample covariance matrix which is used to suppress the MAI, thus yielding a near-far resistant estimator     

Optimum multiuser noncoherent DPSK detection in generalized diversity Rayleigh-fading channels

The jointly optimum multiuser noncoherent detector for differential phase-shift keying (DPSK) modulation over the generalized diversity Rayleigh-fading (GDRF) channel is derived and analyzed. The GDRF channel includes time/frequency/receiver antenna diversity and allows fading correlations between the various diversity branches of each user. Noncoherent detection here refers to the case where the receiver has neither knowledge of the instantaneous phases nor of the envelopes of the users' channels. Upper and lower bounds on the bit-error probability of the optimum detector are derived for a given user. For fast fading, when the fading coefficients vary from one symbol interval to the next (but are still essentially constant over one symbol interval), the detector asymptotically (for high signal-to-noise ratios (SNRs)) reaches an error floor, which is bounded from below and above for different fast fading scenarios. For slow fading, when the channel is constant for at least two consecutive symbol intervals, the upper bound is shown to converge asymptotically to the lower bound. Thus, the asymptotic efficiency of optimum multiuser DPSK detection can be determined and is found to be positive. In contrast to coherent detection, however, it is smaller than unity in general. Since the asymptotic efficiency is independent of the interfering users' signal strengths, the optimum detector is near-far resistant. While optimum multiuser detection is exponentially complex in the number of users, its performance provides the benchmark for suboptimal detectors. In particular, it is seen that the previously suggested post-decorrelative detectors can be far from satisfactory.     

Adaptive space-time feedforward/feedback detection for high datarate CDMA in frequency-selective fading

We investigate linear and nonlinear space-time minimum mean-square-error (MMSE) multiuser detectors for high data rate wireless code-division multiple-access (CDMA) networks. The centralized reverse-link detectors comprise a space-time feedforward filter and a multiuser feedback filter which processes the previously detected symbols of all in-sector users. The feedforward filter processes chip-rate samples from a bank of chip-matched filters which operate on the baseband outputs from an array of antennas. We present an adaptive multiuser recursive least squares (RLS) algorithm which determines the MMSE adjusted filter coefficients with less complexity than individual adaptation for each user. We calculate the outage probabilities and isolate the effects of antenna, diversity, and interference suppression gains for linear and nonlinear filtering and for CDMA systems with varying levels of system control (e.g., timing control, code assignment, cell layout). For eight users transmitting uncoded 2-Mb/s quadrature phase-shift keying with a spreading gain of eight chips per symbol over a fading channel with a multipath delay spread of 1.25 μs, the performance of a three-antenna feedforward/feedback detector was within 1 dB (in signal-to-noise ratio per antenna) of ideal detection in the absence of interference. By training for 10% of a 5-ms frame, RLS adaptation enabled the same detector to suffer less than a 0.5-dB penalty due to the combined effects of imperfect coefficients and error propagation. The advantage of nonlinear feedforward/feedback detection over linear feedforward detection was shown to be significantly larger for a CDMA system with enhanced system control     

Linear space-time multiuser detection for multipath CDMA channels

We consider the problem of detecting synchronous code division multiple access (CDMA) signals in multipath channels that result in multiple access interference (MAI). It is well known that such challenging conditions may create severe near-far situations in which the standard techniques of combined power control and temporal single-user RAKE receivers provide poor performance. To address the shortcomings of the RAKE receiver, multiple antenna receivers combining space-time processing with multiuser detection have been proposed in the literature. Specifically, a space-time detector based on minimizing the mean-squared output between the data stream and the linear combiner output has shown great potential in achieving good near-far performance with much less complexity than the optimum space-time multiuser detector. Moreover, this space-time minimum mean-squared error (ST-MMSE) multiuser detector has the additional advantage of being well suited for adaptive implementation. We propose novel trained and blind adaptive algorithms based on stochastic gradient techniques, which are shown to approximate the ST-MMSE solution without requiring knowledge of the channel. We show that these linear space-time detectors can potentially provide significant capacity enhancements (up to one order of magnitude) over the conventional temporal single-user RAKE receiver