Asynchronous QR-RLS-CMOE Blind Multiuser Detection

The QR-RLS-CMOE algorithm which was applied to synchronous DS/CDMA systems in AWGN channel, is modified and applied to asynchronous DS/CDMA systems in multi-path fading channel in this paper. Computer simulation experiences show that the asynchronous QR-RLS-CMOE (A-QR-RLS-CMOE) blind multiuser detection algorithm can well cancel multiple access interference and overcome multipath fading, and has a good anti-near-far effect in the case of τ<<bT .

HYBRID INTERFERENCE CANCELLATION SCHEME FOR BLIND MULTIUSER DETECTION IN MULTIPATH FADING CHANNELS

This paper introduces and analyzes a detection scheme for adaptive suppression of Multiuser Access Interference (MAI) and MultiPath Distortion (MPD) for mobile station of DS/CDMA system. The proposed detection scheme may amount to a RAKE receiver structure,wherein each branch is considered as a linear multiuser filter designed under a Linear Constrained Minimum Variance (LCMV) optimization strategy to suppress MAI, followed by a proper combining rule to suppress MPD. The adaptive blind multiuser detecting and optimum combining of the proposed receiver are realized, based on the Least-Mean-Square (LMS) algorithm and an adaptive vector tracking algorithm respectively. Finally, the feasibility of the above two algorithms is proved by the numerical results provided by computer simulation.

Joint spatial-frequency blind multiuser detection based on LCCMA

Multicarrier code division multiple access （MC-CDMA） has the ability to combat with frequency selective fading and antenna array can enhance the performance of system. The paper proposes a novel joint spatial-frequency blind multiuser detection for antenna array MC-CDMA based on linear constraint constant modulation algorithm （LCCMA）, which has robust performance and can ensue the weight vectors to converge to that of the desired user Simulation indicates the proposed algorithm has better bit error ratio （BER） performance than that of the traditional beamforming-based two-step algorithm.

The Least Square Constant Modulus Algorithm for Blind Adaptive Multiuser Detection

In this paper, we apply the Least Square Constant Modulus Algorithm( LSCMA ) to the blind Multiuser Detection( MUD ). The algorithm is shown to be globally stable and convergent for any linearly independent set of input data and converge faster than the conventional Steepest Descent CMA(SDCMA ) and Linearly Constrained CMA(LCCMA ),but more complex.

Steady-state performance analysis of HOS-based blind adaptive multiuser detection

The blind adaptive multiuser detections based on higher-order statistics （HOS） can obtain higher steady-state decorrelating performance than the conventional linear algorithm under the high SNR con- dition. However, the closed-form analysis for this steady-state performance is scarce due to the com- plication of analyzing the nonlinear updates of the adaptive algorithm. An analysis approach based on ordinary differential equation （ODE） method is proposed to get the closed-form excess mean-square error （EMSE） expression of the HOS-based multiuser detections. The simulation and the comparison verify the results of the analysis.

Multiple access interference suppression for CDMA systems via l_(∞)-minimization

A key problem in code-division multiple access(CDMA)system is to mitigate the multiple access interference(MAI)from other users while detecting the desired user.The performance of the conventional minimum output energy(MOE)multiuser detector for CDMA system significantly degrades in the presence of signature waveform distortions induced by multipath propagation or timing asynchronism.In this paper,a robust linear programming(ROLP)algorithm for blind multiuser detection is proposed.Different from the existing MOE-based multiuser detection techniques,the proposed ROLP minimizes the l_∞-norm of the output to exploit the non-Gaussianity of the communication signals.To achieve robustness against signature waveform mismatch,the proposed method constrains the magnitude response of any signature vector within a specified uncertainty set to exceed unity.The uncertainty set is modeled as a rhombus,which differs from the spherical uncertainty region widely taken in the existing robust multiuser detectors.The resulting optimization problem is reformulated into a linear programming program and hence can be solved efficiently.The proposed ROLP is computationally simpler than its robust counterparts that requires solving a second-order cone programming.Simulation results demonstrate the superiority of the ROLP over several robust detectors,which indicate that its performance approaches the optimal performance bound.