Group-blind Multiuser Detection Research Articles

Employment of Generalized Receiver for Group-Blind Intersymbol Detection in Downlink CDMA over Fading Multipath Channels

Group-blind multiuser detectors for uplink code-division multiple-access (CDMA) were developed by Wang and Host-Madsen. These detectors make use of the spreading sequences of known users to construct a group constraint to suppress the intracell interference. However, such techniques demand the estimation of the multipath channels and the delays of the known users. In the present paper, the blind generalized receiver is de-veloped for CDMA in fading multipath channels. The proposed generalized receiver utilizes the correlation in-formation between consecutively received signals to generate the corresponding group constraint. It is shown that by incorporating this group constraint, the proposed generalized receiver can provide different performance gains in both the uplink and downlink environments. Compared with the well-known group-blind detectors, our new methods only need to estimate the multipath channel of the desired user and do not require the channel es-timation of other users. Simulation results demonstrate that the proposed generalized receiver outperforms the conventional blind linear multiuser detectors.

Group-blind multi-user detection under multi-path channel

This article proposes an improved generalized side-lobe canceller (GSC) receiver structure based on a new group constraint, which is suitable to eliminate multiple-access interference (MAI), inter-symbol interference (ISI) in direct-sequence code-division multiple access (DS/CDMA) downlink multi-user system. The new group constraint is deduced to construct the group-blind adaptive multi-user detector. The analysis indicates that the improved GSC under the new constraint not only retains the property of suppressing ISI and canceling MAI, but also can extract useful information from the succeeding bit for the desired user. The simulations show that the improved GSC filter can cancel the MAI efficiently whether the wireless channel length is short or long, and achieve better performance than other compared filters.

DS/CDMA Multiuser Detection Based on Polynomial Expansion Subspace Signal

In this work, we proposed a comparative analysis for the performance-complexity tradeoff of several Hybrid Group-blind multiuser detectors with polynomial expansion (MuD Group-Blind PE). Using flop notation, the computacional complexity for the three forms of SBld-MuD-II hybrid detector based on polinomial approximation was compared. MCS results indicated the superiority of the SBld-MuD-I detector in the presence of parameters errors estimates and for the SBld-MuD-II detector with polinomial approach based on Gershgorin circles.

Group-blind intersymbol multiuser detection for downlink CDMA with multipath

Group-blind multiuser detectors for uplink code-division multiple-access (CDMA) were recently developed by Wang and Host-Madsen. These detectors make use of the spreading sequences of known users to construct a group constraint to suppress the intracell interference. However, such techniques demand the estimation of the multipath channels and the delays of the known users. In this paper, several improved blind linear detectors are developed for CDMA in fading multipath channels. The proposed detectors utilize the correlation information between consecutively received signals to generate the corresponding group constraint. It is shown that by incorporating this group constraint, the proposed detectors can provide different performance gains in both uplink and downlink environments. Compared with the previously reported group-blind detectors, our new methods only need to estimate the multipath channel of the desired user and do not require the channel estimation of other users. Simulation results demonstrate that the proposed detectors outperform the conventional blind linear multiuser detectors.

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.

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.

A robust rank estimation algorithm of group-blind MMSE multiuser detectors for CDMA systems

We propose an adaptive rank-estimation method for the additive white or colored Gaussian noise model. The main contribution of this paper has three parts. (1) We investigate the rank mismatch problem in the group-blind multiuser detector of Wang and Host-Madsen (see IEEE J. Select. Areas Commun., vol.17, p.1971-1984, Nov. 1999), and find that underestimating the rank causes significant performance degradation, whereas, rank overestimation can achieve performance gain in the low signal-to-noise-ratio (SNR) region. However, rank overestimation can lead to inaccurate channel estimation, which degrades the detector performance significantly in the high SNR region. (2) We propose a heuristic criterion for initial rank estimation which is robust for nonwhite noise cases. (3) In order to mitigate the rank mismatch problem, we introduce a hypothesis testing criterion for rank and signal subspace decisions, which selects the most probable rank for the group-blind detectors. Simulation results show that the performance of the group-blind detector using this adaptive rank estimation algorithm is comparable to the group-blind with perfect knowledge of the rank, and even better in the low-to-medium SNR region.

Adaptive transmitter optimization for blind and group-blind multiuser detection

The linear subspace-based blind and group-blind multiuser detectors recently developed represent a robust and efficient adaptive multiuser detection technique for code-division multiple-access (CDMA) systems. In this paper, we consider adaptive transmitter optimization strategies for CDMA systems operating in fading multipath environments in which these detectors are employed. We make use of more recent results on the analytical performance of these blind and group-blind receivers in the design and analysis of the transmitter optimization techniques. In particular, we develop a maximum-eigenvector-based method of optimizing spreading codes for given channel conditions and a utility-based power control algorithm for CDMA systems with blind or group-blind multiuser detection. We also design a receiver incorporating joint optimization of spreading codes and transmitter power by combining these algorithms in an iterative configuration. We will see that the utility-based power control algorithm allows us to efficiently set performance goals through utility functions for users in heterogeneous traffic environments and that spreading code optimization allows us to achieve these goals with lower transmit power. The signal processing algorithms presented here maintain the blind (or group-blind) nature of the receiver and are distributed, i.e., all power and spreading code adjustments can be made using only locally available information.

Large-system performance analysis of blind and group-blind multiuser receivers

We present a large-system performance analysis of blind and group-blind multiuser detection methods. In these methods, the receivers are estimated based on the received signal samples. In particular, we assume binary random spreading, and let the spreading gain N, the number of users K, and the number of received signal samples M all go to infinity, while keeping the ratios K/N and M/N fixed. We characterize the asymptotic performance of the direct-matrix inversion (DMI) blind linear minimum mean-square error (MMSE) receiver, the subspace blind linear MMSE receiver, and the group-blind linear hybrid receiver. We first derive the asymptotic average output signal-to-interference-plus-noise ratio (SINR) for each of these receivers. Our results reveal an interesting saturation phenomenon: The output SINR of each of these receivers converges to a finite limit as the signal-to-noise ratio (SNR) of the desired user increases, which is in stark contrast to the fact that the output SINR achieved by the exact linear MMSE receiver can get arbitrarily large. This indicates that the capacity of a wireless system with blind or group-blind multiuser receivers is not only interference-limited, but also estimation-error limited. We then show that for both the blind and group-blind receivers, the output residual interference has an asymptotic Gaussian distribution, independent of the realizations of the spreading sequences. The Gaussianity indicates that in a large system, the bit-error rate (BER) is related to the SINR simply through the Q function.

Multistage group-blind adaptive multiuser detector for reverse link in direct-sequence CDMA systems

We develop a novel multistage group-blind multiuser detection technique for reverse link in multi-cell direct sequence (DS) code-division multiple access (CDMA) systems. This approach fully utilizes all known users' information, performs interference cancellation (IC) to suppress the interferers within the cell, and exploits blind adaptive decision-directed (DD) MMSE detector to suppress the inter-cell interference. This process can be made iterative and in the multistage process, the tentative decision bits from DD-MMSE detectors can be fed back to the IC part to make interference regeneration more accurate. A simplified RLS (SRLS) algorithm is derived particularly for DD-MMSE detectors and steady-state SIR performance of the SRLS algorithm is analyzed. It is shown that the proposed detector with SRLS algorithm is sufficient to perform accurate multiuser detection and has significant performance gain over that of the pure blind detectors and the non-blind detectors for the given scenario. Moreover, compared with the conventional RLS algorithm, the SRLS algorithm has lower computational complexity and the convergence speed is faster. We also develop two group-blind channel estimation methods to estimate the effective signature waveforms in multipath fading channel. It is seen that the group-blind channel estimation methods using updated received signal correlation matrix can effectively combat the mismatch problem faced by pure blind detectors.

Adaptive group-blind multiuser detection based on a new subspace tracking algorithm

Wang and Host-Madsen (see IEEE J. Select. Areas Commun., vol.17, p.1971-84, 1999) developed group-blind multiuser detectors for use in code-division multiple-access (CDMA) uplink environments in which 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. Yu and Host-Madsen (see Proc. IEEE Vehicular Technology Conf. (VTC99), Houston, TX, p.1042-46, 1999) later developed an adaptive version of this detector for synchronous CDMA channels. We develop a new low-complexity, high-performance subspace tracking algorithm and apply it to adaptive group-blind multiuser detection in asynchronous multipath CDMA channels. The detector can track changes in the number of users and their composite signature waveforms. We present steady-state performance as well as the ability of the receiver to track changes in the signal subspace. We also address the performance gain of the group-blind detector over its blind counterpart for this application.

Nonlinear group-blind multiuser detection

A nonlinear group-blind technique is developed for joint detection of some given users' data in a CDMA uplink environment with the presence of unknown interference. This method performs the so-called "slowest-descent search" over a likelihood function of the desired users, starting from the estimate closest to the unconstrained maximizer of the likelihood function, and along mutually orthogonal directions where this likelihood function drops to the slowest. Simulation results show that this new nonlinear technique offers substantial performance improvement over the previously proposed linear group-blind multiuser detectors with little attendant increase in computational complexity. The problem of group-blind multiuser detection in the presence of both unknown interference and impulsive ambient noise is also treated under the framework of slowest-descent search, with the aid of a novel subspace-based robust interference cancellation scheme. It is seen that this robust group-blind method significantly outperforms the robust blind multiuser detection scheme proposed previously.

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.