A delay independent decorrelating detector for quasi-synchronousCDMA

The decorrelating detector is a near-far resistant linear joint detector for a code-division multiple-access (CDMA) system. It consists of a bank of matched filters followed by a decorrelating matrix. For proper operation, both the matched filter bank and the decorrelating matrix require knowledge of the delays of all users. The delays are due to the different propagation times from each user to the base station. Delay estimation is a weak link in this system since it is complex and prone to error. The proposed decorrelating detector does not require exact knowledge of the user delays, but instead requires that the delays be bounded to a fraction of a symbol interval. The delays are naturally bounded in this way in many microcell and picocell systems where the round trip propagation time is small compared to the symbol interval. The new delay independent decorrelating detector is shown to be near-far resistant and, through appropriate spreading code selection, to experience a modest 3 dB signal-to-noise ratio (SNR) loss relative to orthogonal access schemes. It is also shown to limit capacity to a maximum of 50% of the spreading gain when the delays are bounded by a single chip interval. The complexity is similar to the conventional correlating receiver which is far less complex than the joint detection schemes proposed to date     

Adaptive decorrelating detectors for CDMA systems

Multi-user detection allows for the efficient use of bandwidth in Code-Division Multiple-Access (CDMA) channels through mitigation of near-far effects and multiple-access noise limitations. Due to its inherent noise and multipath immunity, CDMA multi-access is being considered as a platform for personal communication systems (PCS). As CDMA based digital communication networks proliferate, the need to determine the presence of a new user and integrate knowledge of this new user into the detection scheme becomes more important. The decorrelating detector is a linear multi-user detector that is asymptotically optimal in terms of near far resistance; however, in the presence of a new unknown user, performance of the decorrelator is severely degraded. Adaptive decorrelators are constructed which adaptively augment an existing conventional decorrelator to demodulate a new active user in addition to existing users. Several likelihood ratio based schemes are employed. Both synchronous and asynchronous communication are investigated.This research was supported by the U.S. Army Research Office under Grant DAAH04-93-G-0219.     

Adaptive decorrelating detectors for CDMA systems

Multi-user detection allows for the efficient use of bandwidth in Code-Division Multiple-Access (CDMA) channels through mitigation of near-far effects and multiple-access noise limitations. Due to its inherent noise and multipath immunity, CDMA multi-access is being considered as a platform for personal communication systems (PCS). As CDMA based digital communication networks proliferate, the need to determine the presence of a new user and integrate knowledge of this new user into the detection scheme becomes more important. The decorrelating detector is a linear multi-user detector that is asymptotically optimal in terms of near far resistance; however, in the presence of a new unknown user, performance of the decorrelator is severely degraded. Adaptive decorrelators are constructed which adaptively augment an existing conventional decorrelator to demodulate a new active user in addition to existing users. Several likelihood ratio based schemes are employed. Both synchronous and asynchronous communication are investigated.This research was supported by the U.S. Army Research Office under Grant DAAH04-93-G-0219.     

Group-blind multiuser detection for uplink CDMA

Previously developed blind techniques for multiuser detection in code division multiple access (CDMA) systems lead to several near-far resistant adaptive receivers for demodulating a given user's data with the prior knowledge of only the spreading sequence of that user. In the CDMA uplink, however, typically the base station receiver has the knowledge of the spreading sequences of all the users within the cell, but not that of the users from other cells. In this paper, group-blind techniques are developed for multiuser detection in such scenarios. These new techniques make use of the spreading sequences and the estimated multipath channels of all known users to suppress the intracell interference, while blindly suppressing the intercell interference. Several forms of group-blind linear detectors are developed based on different criteria. Moreover, group-blind multiuser detection in the presence of correlated noise is also considered. In this case, two receiving antennas are needed for channel estimation and signal separation. Simulation results demonstrate that the proposed group-blind linear multiuser detection techniques offer substantial performance gains over the blind linear multiuser detection methods in a CDMA uplink environment     

Adaptive multiuser CDMA detector for asynchronous AWGNchannels-steady state and transient analysis

A two-stage adaptive multiuser detector in an additive white Gaussian noise code-division multiple-access channel is proposed and analyzed. Its first stage is an asynchronous one-shot decorrelator which in terms of computational complexity only requires inversion of K symmetric K×K matrices for all K users. In addition, the K inversions can be done in parallel, and the computed results for one user can be reused by all other users as well, resulting in a latency of only one bit, same as its synchronous counterpart. The decorrelated tentative decisions are utilized to estimate and subtract multiple-access interference in the second stage. Another novel feature of the detector is the adaptive manner in which the multiple-access interference estimates are formed, which renders prior estimation of the received signal amplitudes and the use of training sequences unnecessary. Adaptation algorithms considered include steepest descent (as well as its stochastic version), and a recursive least squares-type algorithm that offers a faster transient response and better error performance. Sufficient conditions for the receiver to achieve convergence are derived. The detector is near-far resistant, and is shown to provide substantial steady-state error performance improvement over the conventional and decorrelating detector, particularly in the presence of strong interfering signals     

一种新的抗远近效应的盲DS-CDMA接收机

本文研究多径频率选择性衰落信道下直接序列扩频码分多址(DS-CDMA)信号的处理问题,提出了一种新型的盲接收机.该接收机不需预知多址干扰用户的扩频码,不需预知信道参数,只需已知期望用户的扩频码和粗略的定时,就可以完成用户的盲检测.同时,该接收机通过降维自适应去相关滤波和基于判决指导的自适应多径合并,来获得低成本和良好的抗衰落、抗远近效应性能.仿真结果验证了本文提出的接收机的优良性能.     

Blind multiuser detection over highly dispersive CDMA channels

This paper addresses blind multiuser detection in a direct-sequence code-division multiple-access (DS-CDMA) network in presence of both multiple-access interference and intersymbol interference. In particular, it considers a DS-CDMA system where K out of N users are transmitting; the N admissible spreading codes are known, and so is the code of the user to be demodulated. The number of interferers, the signatures of a certain number, possibly all, of the interferers, and the channel impulse response of each active user are unknown. The spreading codes of the unknown interferers are determined via a procedure that exploits the knowledge of the set of admissible transmitted codes and of the known active codes. The procedure applies to both single and multiple receiving antennas. The performance assessment of a blind decorrelating detector, implemented by resorting to the proposed identification procedure, shows that it outperforms a plain subspace-based blind decorrelator for small sizes of the estimation sample.     

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     

Blind adaptive energy estimation for decorrelatingdecision-feedback CDMA multiuser detection using learning-typestochastic approximations

This paper investigates the application of linear reinforcement learning stochastic approximation to the blind adaptive energy estimation for a decorrelating decision-feedback (DDF) multiuser detector over synchronous code-division multiple-access (CDMA) radio channels in the presence of multiple-access interference (MAI) and additive Gaussian noise. The decision-feedback incorporated into the structure of a linear decorrelating detector is able to significantly improve the weaker users' performance by cancelling the MAI from the stronger users. However, the DDF receiver requires the knowledge of the received energies. In this paper, a new novel blind estimation mechanism is proposed to estimate all the users' energies using a stochastic approximation algorithm without training data. In order to increase the convergence speed of the energy estimation, a linear reinforcement learning technique is conducted to accelerate the stochastic approximation algorithms. Results show that our blind adaptation mechanism is able to accurately estimate all the users' energies even if the users of the DDF detector are not ranked properly. After performing the blind energy estimation and then reordering the users in a nonincreasing order, numerical simulations show that the DDF detector for the weakest user performs closely to the maximum likelihood detector, whose complexity grows exponentially with the number of users     

A blind adaptive decorrelating detector for CDMA systems

The decorrelating detector is known to eliminate multiaccess interference when the signature sequences of the users are linearly independent, at the cost of enhancing the Gaussian receiver noise. We present a blind adaptive decorrelating detector which is based on the observation of readily available statistics. The algorithm recursively updates the filter coefficients of a desired user by using the output of the current filter. Due to the randomness of the information bits transmitted and the ambient Gaussian channel noise, the filter coefficients evolve stochastically. We prove the convergence of the filter coefficients to a decorrelating detector in the mean squared error (MSE) sense. We develop lower and upper bounds on the MSE of the receiver filter from the convergence point and show that with a fixed step size sequence, the MSE can be made arbitrarily small by choosing a small enough step size. With a time-varying step size sequence, the MSE converges to zero implying an exact convergence. The proposed algorithm is distributed, in the sense that no information about the interfering users such as their signature sequences or power levels is needed. The algorithm requires the knowledge of only two parameters for the construction of the receiver filter of a desired user: the desired user's signature sequence and the variance of the additive white Gaussian (AWG) receiver noise. This detector, for an asynchronous code division multiple access (CDMA) channel, converges to the one-shot decorrelating detector     

Blind multiuser detection for asynchronous MC-CDMA systems without channel estimation

This paper presents a blind adaptive decorrelating detector for asynchronous multicarrier code-division multiple-access (MC-CDMA) systems with Rayleigh-fading channels. This detector is derived by making use of the cross-correlation matrix between the consecutively received signals. The main attraction of the detection algorithm is its simplicity, since the detector can be implemented blindly without channel estimation, except for the synchronization of the desired user. To implement the proposed detector, a new adaptive subspace-tracking algorithm for any Hamiltonian matrices is developed, while the previously reported subspace-tracking methods can only estimate the subspace of a positive Hamiltonian matrix. Since a common drawback of the multiuser detector based on the subspace method is the existence of a phase factor that usually deteriorates the performance of the detector, a new method is developed to compensate for the phase of the proposed detector, based on the property of the complex white Gaussian noise. Results of extensive computer simulations show the performance improvement of the proposed detector.     

Improved Robust Techniques for Multiuser Detection in Non-Gaussian Channels

In many physical channels where multiuser detection techniques are to be applied, the ambient channel noise is known through experimental measurements to be decidedly non-Gaussian, due largely to impulsive phenomena. This is due to the impulsive nature of man-made electromagnetic interference and a great deal of natural noise. This paper presents a robust multiuser detector for combating multiple access interference and impulsive noise in code division multiple access (CDMA) communication systems. A new M-estimator is proposed for "robustifying" the detector. The approach is corroborated with simulation results to evaluate the performance of the proposed robust multiuser detector compared with that of the linear decorrelating detector, and the Huber and the Hampel M-estimator based detectors. Simulation results show that the proposed detector with significant performance gain outperforms the linear decorrelating detector, and the Huber and the Hampel M-estimator based detectors. This paper also presents an improved robust blind multiuser detection technique based on a subspace approach, which requires only the signature waveform and the timing of the desired user to demodulate that user's signal. Finally, we show that the robust multiuser detection technique and its blind adaptive version can be applied to both synchronous and asynchronous CDMA channels.     

一种改进的码分多址通信系统的多用户干扰抵消接收机

在码分多址通信系统中,由于许多用户占用同一信道进行通信,传统的单用户检测策略和最佳的多用户检测策略不是很实用。本文对直接序列－码分多址系统的多用户检测策略和次最优检测策略进行了分析和阐述,讨论了一种改进的多级并行干扰抵消接收策略,最后给出了几种模拟结果。     

The impact of timing errors on the performance of linear DS-CDMAreceivers

In this paper, an asynchronous direct-sequence code-division multiple-access (DS-CDMA) communication system operating over an additive white Gaussian noise (AWGN) channel is considered. In many applications, the near-far problem can be the limiting factor for the capacity of a DS-CDMA system. Several near-far resistant receivers have, therefore, been proposed (e.g., the decorrelating receiver). These receivers assume perfect knowledge of the propagation delay from all users to the receiver. In practice, the delays are estimated and therefore subject to errors. The performance degradation these errors impose on linear detectors, especially the decorrelating detector, is the topic of this paper     

Noncoherent detection in asynchronous multiuser channels

The noncoherent demodulation of multiple differentially phase-shift-keyed signals transmitted simultaneously over an asynchronous code-division multiple-access (CDMA) channel with white Gaussian background noise is considered. A class of bilinear detectors is defined with the objective of obtaining the optimal bilinear detector. The optimality criterion considered is near-far resistance that denotes worst-case asymptotic efficiency over the signal energies and phases which are unknown at the receiver. The optimal bilinear detector is therefore obtained by solving a minimax optimization problem. In the finite packet length case, this detector is shown to be a time-varying multiinput multioutput linear decorrelating filter followed by differential decision logic. In the limit as packet lengths go to infinity, the time-varying decorrelating detector is replaced by a time-invariant multiinput multioutput decorrelating filter. Several properties of the optimally near-far resistant detector are established     

Identification of active users in synchronous CDMA multiuserdetection

The level of multiple access interference (MAI) in code division multiple access (CDMA) communication systems is a time-varying parameter related to the number of active users. Almost all existing multiuser detection schemes were designed based on a priori information of the active users. In many situations, however, the multiuser receiver does not know the number of active users, and the receiver designed for the detection of all users may lead to poor performance. To develop a more efficient detection scheme in practical applications, we propose a two-stage detection structure consisting of preprocessing (identification) and postprocessing (detection). In the preprocessing, we apply the subspace concept and a method based on the multiple signal classification (MUSIC) algorithm to identify the active users while requiring only a priori knowledge of all of the users' signature sequences. The proposed preprocessor is shown to be asymptotically near-far resistant, and to have the ability to identify the active users in a simple and reliable way. While in the detection process, as we efficiently use the active users' information in every observation interval, the performance is clearly improved compared to the conventional structure without identification. Moreover, the effect of imperfect identification on the decorrelating detector is also extensively analyzed. Though the decorrelating detector's inherent near-far resistant characteristic is impaired by imperfect identification, the proposed structure still outperforms the conventional structure in the general near-far environment     

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     

Probability of error in MMSE multiuser detection

The performance analysis of the minimum-mean-square-error (MMSE) linear multiuser detector is considered in an environment of nonorthogonal signaling and additive white Gaussian noise. In particular, the behavior of the multiple-access interference (MAI) at the output of the MMSE detector is examined under various asymptotic conditions, including: large signal-to-noise ratio; large near-far ratios; and large numbers of users. These results suggest that the MAI-plus-noise contending with the demodulation of a desired user is approximately Gaussian in many cases of interest. For the particular case of two users, it is shown that the maximum divergence between the output MAI-plus-noise and a Gaussian distribution having the same mean and variance is quite small in most cases of interest. It is further proved in this two-user case that the probability of error of the MMSE detector is better than that of the decorrelating linear detector for all values of normalized crosscorrelations not greater than ½√(2+√3)≅0.9659     

Decision feedback multiuser detection: a systematic approach

A systematic approach to decision feedback multiuser detection is introduced for the joint detection of symbols of K simultaneously transmitting users of a synchronous correlated waveform multiple-access (CWMA) channel with Gaussian noise. A new performance criterion called symmetric energy is defined which is a low-noise indicator of the joint error rate that at least one user is detected erroneously. Even the best linear detectors can perform poorly in terms of symmetric energy compared to the maximum-likelihood detector. A general class of decision feedback detectors (DFDs) is defined with O(K) implementational complexity per user. The symmetric energy of arbitrary DFD and bounds on their asymptotic effective energy (AEE) performance are obtained along with an exact bit-error rate and AEE analysis for the decorrelating DFD. The optimum DFD that maximizes symmetric energy is obtained. Each one of the K! optimum, decorrelating, and conventional DFDs, that correspond to the K! orders in which the users can be detected, are shown to outperform the linear optimum, decorrelating, and conventional detectors, respectively, in terms of symmetric energy. Moreover, algorithms are obtained for determining the choice of order of detection for the three DFDs which guarantee that they uniformly (user-wise) outperform their linear counterparts. In addition to optimality in symmetric energy, it is also shown that under certain conditions, the optimum DFD achieves the AEE performance of the exponentially complex maximum-likelihood detector for all users simultaneously. None of the results of this paper make the perfect feedback assumption. The implications of our work on power control for multiuser detection are also discussed     

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.