Adaptive minimum-BER linear multiuser detection for DS-CDMA signalsin multipath channels

The problem of constructing adaptive minimum bit error rate (MBER) linear multiuser detectors is considered for direct-sequence code division multiple access (DS-CDMA) signals transmitted through multipath channels. Based on the approach of kernel density estimation for approximating the bit error rate (BER) from training data, a least mean squares (LMS) style stochastic gradient adaptive algorithm is developed for training linear multiuser detectors. Computer simulation is used to study the convergence speed and steady-state BER misadjustment of this adaptive MBER linear multiuser detector, and the results show that it outperforms an existing LMS-style adaptive MBER algorithm presented by Yeh et al. (see Proc. Globecom, Sydney, Australia, p.3590-95, 1998)     

Blind multiuser detection for code-hopping DS-CDMA signals in asynchronous multipath channels

Blind detection of a desired user's signal in a code-hopping (CH) direct sequence code-division multiple access (CDMA) system is considered. In CH CDMA systems each user switches between a predetermined set of short-code sequences. A user signal in such systems may be treated as the superposition of several virtual short-code signals. A code-constrained inverse filter criterion (IFC)-based blind detector for short-code CDMA signals in asynchronous multipath channels to detect a desired user's signal was recently presented by Tugnait and Li (2001). A novel approach combining the code-constrained IFC and a penalty function is proposed to simultaneously extract all virtual users associated with a given CH user. Global minima of the proposed cost function are analyzed. An extension of an existing subspace-based approach is also investigated. An illustrative simulation example is provided where the proposed algorithm is compared with a clairvoyant matched filter receiver, two linear minimum mean-square error (MMSE) receivers with channels known, and the subspace-based approach.     

Optimal adaptive multiuser detection in unknown multipath channels

An optimal multiuser detector in the weighted least squares (WLS) sense is derived. This detector, which includes the maximum likelihood multiuser detector as a special case, consists of two parts: a bank of linear fractionally chip spaced minimum mean squared error (MMSE) filters, and a nonlinear WLS metric minimizer. It is shown that the symbol spaced samples at the output of the MMSE filter bank provide a set of sufficient statistics for WLS detection. The relationship between the taps of a centralized decision feedback detector and the MMSE filter bank is derived. It is proven that all the necessary parameters for implementing the WLS detector can be realized by adaptively training a centralized decision feedback detector. Therefore, the WLS detector achieves optimal joint synchronization and data detection even in the presence of colored noise, such as narrowband interference, without any a priori knowledge of the users' signatures, multipath channel taps or statistics of the colored noise. Significant features of the WLS detector are that: (1) the WLS detector is a generalization of the maximum likelihood multiuser detector that employs a bank of matched filters; (2) it is implemented adaptively; and (3) it has structural flexibility in terms of implementation complexity     

Performance analysis of space-time MMSE multiuser detection for coded DS-CDMA systems in multipath fading channels

This paper investigates the use of convolutional coding in space-time minimum mean-square-error (MMSE) multiuser-based receivers over asynchronous multipath Rayleigh fading channels. We focus on the performance gain attained through error control coding when used with binary-phase-shift-keyed modulation (BPSK) and multiuser access based on direct sequence-code-division multiple access (DS-CDMA). In our analysis, we derive an approximation for the uncoded probability of bit-error in multipath fading channels. This bit-error rate (BER) approximation is shown to be very accurate when compared to the exact performance. For a convolutionally coded system, we obtain a closed form expression for the bit-error rate upper bound. This error bound is noted to be tight as the number of quantization levels increased beyond eight. Using our theoretical results, we obtain an estimate for the achieved user-capacity that accrues due to error control coding. It is found that using convolutional coding with 3-bit soft-decision decoding, a user-capacity gain as much as 300% can easily be achieved when complete fading state information plus ideal channel interleaving are assumed.     

Blind adaptive multiuser detection in multipath CDMA channels basedon subspace tracking

A blind adaptive technique for signal demodulation in multipath code-division multiple-access (CDMA) communication channels is proposed. This technique is based on signal subspace estimation. The receiver employs a bank of linear filters (decorrelating filters or linear MMSE filters) at the front end to mitigate the multiple-access interference and the multipath interference. A channel estimator is used to estimate the channel state for diversity combining. It is shown that through the use of signal subspace estimation, both the decorrelating filterbank and the linear MMSE filterbank can be obtained blindly, i.e., they can be estimated from the received signal with the prior knowledge of only the signature waveform of the desired user. Two forms of the subspace-based linear filterbanks are developed and their equivalence in terms of the interference suppression capability is established. These subspace-based blind adaptive interference suppression techniques require, at each symbol epoch, the eigenvalues and the eigenvectors of an appropriate signal subspace, which ran be obtained using computationally efficient sequential adaptive eigendecomposition (subspace tracking) algorithms. Moreover, a blind adaptive method for estimating the channel state is developed, which also produces the postcombining decision statistic as a byproduct     

多径衰落信道中一种新的基于CMA的盲多用户检测算法

该文基于 CLSCMA算法提出了一种新的盲自适应多用户检测算法,这种算法适用于多径衰落信道。这种多用户检测算法能很好抵消多址干扰和克服多径衰落,算法的收敛性能和子空间自适应多用户检测算法相当,而稳态性能稍强于子空间多用户检测算法。因而是一种优秀的盲自适应多用户检测算法,具有一定的应用和研究价值。     

Decentralized multiuser detection for time-varying multipath channels

Multiple-access interference (MAI) and time-varying multipath effects are the two most significant factors limiting the performance of code-division multiple-access (CDMA) systems. While multipath effects are exploited in existing CDMA systems to combat fading, they are often considered a nuisance to MAI suppression. We propose an integrated framework based on canonical multipath-Doppler coordinates that exploits channel dispersion effects for MAI suppression. The canonical coordinates are defined by a fixed basis derived from a fundamental characterization of the propagation effects. The basis corresponds to uniformly spaced multipath delays and Doppler shifts of the signaling waveform that capture the essential degrees of freedom in the received signal and eliminate the need for estimating arbitrary delays and Doppler shifts. The framework builds on the notion of active coordinates that carry the desired signal energy, facilitate maximal exploitation of channel diversity, and provide minimum-complexity MAI suppression. Progressively powerful multiuser detectors are obtained by incorporating additional inactive coordinates carrying only MAI. Signal space partitioning in terms of active/inactive coordinates provides a direct handle on controlling receiver complexity to achieve a desired level of performance. System performance is analyzed for two characteristic time scales relative to the coherence time of the channel. Adaptive receiver structures are identified that are naturally amenable to blind implementations requiring knowledge of only the spreading code of the desired user.     

Recursive algorithms for multiuser detection over DS-CDMA channels

We focus on the synthesis and the analysis of recursive receivers for direct-sequence code-division multiple-access systems aimed at achieving satisfactory performance at the price of a moderate computational complexity. At the analysis stage, some interesting properties shared by the proposed procedures are proven. Finally, the performance assessment shows that the new schemes are superior to the linear detectors, and some of them achieve a bit-error rate close to that of the optimum receiver.     

Space-time multiuser detection in multipath CDMA channels

The problem of multiuser detection in multipath CDMA channels with receiver antenna array is considered. The optimal space-time multiuser receiver structure is first derived, followed by linear space-time multiuser detection methods based on iterative interference cancellation. Blind adaptive space-time multiuser detection techniques are then proposed, which require prior knowledge of only the spreading waveform and the timing of the desired user's signal. Single-user-based space-time processing methods are also considered and are compared with the multiuser approach. It is seen that the proposed multiuser space-time processing techniques offer substantial performance gains over the single-user-based methods, especially in a near-far situation     

多径条件下的最优空时多用户检测

本文采用码片速率采样建立了一般的结构化空时多用户CDMA信号模型,研究了多径条件下的最优空时多用户检测的系统结构与实现,并对最优空时多用户检测的Viterbi算法给予了证明和分析。     

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     

MMSE multiuser detection for array multicarrier DS-CDMA in fading channels

Reception of asynchronous, multicarrier direct-sequence-code division multiple access (DS-CDMA) in time-varying, multipath radio channels with use of a receiving antenna array is investigated. Interference reducing minimum mean squared error (MMSE) receivers are discussed, and by considering the time-variation of the channel, a modified structure is derived which is efficient for channels experiencing small-scale fading. A blind implementation of this receiver is then proposed. Subspace concepts are applied to formulate a tracking, composite channel vector estimator which operates effectively in fading situations, even when high levels of interference are present. Both the modified MMSE weight matrix and diversity combining weights are generated from these channel estimates. Simulations of the proposed receiver show it to have superior performance over a standard MMSE receiver which is periodically re-evaluated to permit it to follow the channel variations due to small-scale fading. Furthermore, a hybrid MMSE receiver is proposed which applies different processing methods depending on each transmitters mobility, resulting in improved performance.     

Iterative space-time processing for multiuser detection in multipath CDMA channels

Space-time processing and multiuser detection are two promising techniques for combating multipath distortion and multiple-access interference in code division multiple access (CDMA) systems. To overcome the computational burden that rises very quickly with increasing numbers of users and receive antennas in applying such techniques, iterative implementations of several space-time multiuser detection algorithms are considered here. These algorithms include iterative linear space-time multiuser detection, Cholesky iterative decorrelating decision-feedback space-time multiuser detection, multistage interference canceling space-time multiuser detection, and expectation-maximization (EM)-based iterative space-time multiuser detection. A new space-time multiuser receiver structure that allows for efficient implementation of iterative processing is also introduced. Fully exploiting various types of diversity through joint space-time processing and multiuser detection brings substantial gain over single-receiver-antenna or single-user-based methods. It is shown that iterative implementation of linear and nonlinear space-time multiuser detection schemes discussed in this paper realizes this substantial gain and approaches the optimum performance with reasonable complexity. Among the iterative space-time multiuser receivers considered in this paper, the EM-based (SAGE) iterative space-time multiuser receiver introduced here achieves the best performance with excellent convergence properties.     

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     

SMC-based blind detection for DS-CDMA systems over multipath fading channels

This letter derives a computationally efficient sequential Monte Carlo solution for blind detection of direct-sequence code-division multiple-access systems over multipath fading channels by decomposing the observed data into a number of signal components. Then the parameters of each component can be estimated by the sequential importance sampling and Kalman filtering. In comparison with other similar receivers, simulation results demonstrate that the proposed solution achieves the desirable performance with a significantly reduced computational complexity.     

Low-complexity blind multiuser detection of DS-CDMA signal in dispersive channels

The problem of blind multiuser detection in dispersive channels of Code-Division Multiple-Access (CDMA) in the presence of both Multiple-Access Interference (MAI) and In-terSymbol Interference (ISI) is considered. In practice, it is showed that by incorporating the desired user's signature waveform and the auxiliary vector, the information of the user can be identified using the suboptimal subspace method. The major contribution of this paper is to propose a minimum-mean-square-error detector with the suboptimal subspace-based blind technique for joint suppression of MAI and ISI in the dispersive CDMA channels.     

The LSCM_SUB algorithm for blind multiuser detection in multipath CDMA channels

1 Introduction Multiuser detection (MUD) is applied mainly in CDMA to cancel the multiaccess interference. The single-user matched filter or RAKE receiver treats interference from other users as noise, but MUD takes advantage of other user’s interference…     

多径CDMA信道下的一种改进的盲空时多用户检测

该文在多径CDMA信道下基于Rosen梯度投影实现的最小均方盲空时多用户检测方法的基础上提出了一种改进的方法,该方法与原有的方法相比,运算量有所降低、对系统的要求降低,但通过仿真结果比较表明,该方法的检测性能与原有的方法大致相当,因而更加具有竞争力。     

Blind adaptive reduced-rank detection for DS-CDMA signals inmultipath channels

Blind adaptive multiuser detection for direct sequence code division multiple access (DS-CDMA) signals over static and time-varying intersymbol interference (ISI) limited channels is considered. Blind adaptive detectors must be robustified for ISI channels, when there is significant mismatch between the received signature vector and the transmitted code (assumed known at the receiver). A new low-complexity detector is presented that improves on some previously proposed methods without explicit estimation of the ISI channel. The key innovation is a reduced-rank detector architecture combined with an efficient subspace tracker that yields direct accurate estimation of the desired user's received signature. Several representative simulation examples of detector output signal-to-noise-and-interference ratio (SINR) for fading channels are provided in support of our claims of improved efficacy of the method     

Suboptimal maximum-likelihood multiuser detection of synchronousCDMA on frequency-selective multipath channels

We propose a signal processing technique, based on the estimate-maximize algorithm, in order to perform multiuser code-division multiple-access (CDMA) detection. This algorithm iteratively seeks for the maximum-likelihood solution. The resulting structure is a successive interference cancellation scheme which can be applied to both synchronous and asynchronous CDMA. Higher performance than similar methods is obtained from using deterministic annealing and multiple stages. A soft output is defined, and the signal-to-noise ratio in the soft output of the detector is measured for predicting performance with an outer code with soft input decoder. The new receiver is applied to the problem whereby in a synchronous CDMA system the orthogonality of the codes is destroyed by a frequency-selective channel, caused by multipath fading. This nonlinear technique is shown to perform much better than the minimum mean-square-error linear solution and several other algorithms. The algorithm lends itself to an efficient DSP or VLSI implementation. We evaluate the performance by simulations with coherent quadrature phase-shift keying modulation, known channel and long random Rayleigh multipath. In most cases, we set the number of users equal to the processing gain for maximal throughput. The results are also presented in the form of outage probabilities for random Rayleigh multipath against required fading margin