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 detection in asynchronous code-division multiple-accesscommunications

A multiuser detection strategy for coherent demodulation in an asynchronous code-division multiple-access system is proposed and analyzed. The resulting detectors process the sufficient statistics by means of a multistage algorithm based on a scheme for annihilating successive multiple-access interference. An efficient real-time implementation of the multistage algorithm with a fixed decoding delay is obtained and shown to require a computational complexity per symbol which is linear in the number of users K. Hence, the multistage detector contrasts with the optimum demodulator, which is based on a dynamic programming algorithm, has a variable decoding delay, and has a software complexity per symbol that is exponential in K. An exact expression is obtained and used to compute the probability of error is obtained for the two-stage detector, showing that the two-stage receiver is particularly well suited for near-far situations, approaching performance of single-user communications as the interfering signals become stronger. The near-far problem is therefore alleviated. Significant performance gains over the conventional receiver are obtained even for relatively high-bandwidth-efficiency situations     

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     

Near-Optimum Iterative Multiuser Receiver for FEC Encoded DS-CDMA

The powerful iterative algorithm of Turbo code is employed in the proposed iterative multiuser receiver for the downlink of a forward error correction (FEC) coded direct-sequence code-division multiple access (DS-CDMA) environment. The receiver iterates between the 2 coding dimensions, namely the spreading codes and the FEC codes. The optimum iterative multiuser receiver uses the optimum decentralised single-user detector to generate the single-user extrinsic information for the single-user decoders. This paper suggests a near-optimum detector using a folded trellis preselection stage for the multiuser signal detection, in order to reduce the dominating complexity of the optimum decentralised detector. Simulation results show that performance is close to optimum. The effect of the single-user decoders' extrinsic information on the signal detection stage is also investigated and it is found that extrinsic information improves performance.     

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.     

An Adaptive MMOE-PIC Detector for Asynchronous DS-CDMA Communications

We propose a modified linear parallel interference cancelation (PIC) structure using the adaptive minimum mean output-energy (MMOE) algorithm for direct-sequence code-division multiple-access (DS-CDMA) systems. The complexity of the proposed receiver structure is shown to be linear in the number of users and hence, lower complexity than the centralized minimum mean-squared error (MMSE) multiuser detector. It is demonstrated that the proposed receiver structure can significantly reduce the long training period required by the standard adaptive MMOE receiver in near-far environments. Both numerical and theoretical results show that the proposed receiver performs close to the optimum MMSE receiver whereas the conventional adaptive MMOE detector suffers from high BER’s due to the imperfect filter coefficients. Also our results show a three fold increase in the number of users when the MMOE-PIC is used relative to the conventional MMOE receiver. Furthermore, the transient behavior of the proposed MMOE-PIC receiver due to abrupt changes in the interference level is examined. It is shown that the proposed adaptive receiver offers much faster self recovery, with less signal-to-interference ratio (SIR) degradation, than the standard MMOE in sever near-far scenarios.     

Noncoherent multiuser detection for CDMA systems with nonlinearmodulation: a non-Bayesian approach

This paper considers the problem of multiuser detection for a system in which each user employs nonlinear modulation, with an emphasis on noncoherent detection techniques which do not require knowledge of the users' channel parameters at the receiver. Our goals are to gain fundamental insight into the capabilities of multiuser detection in such a setting, and to provide practical algorithms that perform better than conventional matched-filter reception. We begin by providing fundamental performance benchmarks by considering coherent maximum-likelihood (ML) detection, which requires knowledge of the users' channel parameters, as well as noncoherent detection, formulated in a non-Bayesian generalized likelihood ratio test (GLRT) framework. The asymptotic performance of each detector, as the noise level vanishes, is characterized, yielding simple geometric criteria for near-far resistance. In general, both the ML and GLRT detectors have complexity which is exponential in the number of users. We, therefore, propose the more practical sequential decision projection (SDP) detector which has complexity which is quadratic in the number of users. It is shown that the SDP detector has nonzero asymptotic efficiency if the users' powers are suitably disparate     

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     

Turbo greedy multiuser detection

Previously, a novel scheme for iterative multiuser detection and turbo decoding was proposed by Damnjanovic and Vojcic (2000, 2001). In this scheme, multiuser detection and single-user turbo decoding are tightly coupled to maximize the overall gain. The extrinsic probabilities for the coded bits of the interfering users, obtained after each turbo decoding iteration, are used as a priori probabilities in the following multiuser iteration and the extrinsic information for the systematic bits of the desired user is used as a priori information in the next single-user turbo decoding iteration. Turbo decoding of parallel concatenated convolutional codes is carried out in parallel fashion. It has been shown that the proposed detector approaches the multiuser capacity limit within 1 dB in the low signal-to-noise ratio region. However, the main drawback of the scheme is its exponential complexity in the number of users, which is due to the complexity of the maximum a posteriori probability (MAP) multiuser detector. In this paper, we show that the complexity of the scheme can be significantly reduced by replacing the (MAP) multiuser detector with an iterative detector derived from the greedy multiuser detector proposed by AlRustamani and Vojcic (2000). In this paper, we demonstrate that, for both the additive white Gaussian noise and the frequency-nonselective Rayleigh fading, the substantial reduction in complexity of the iterative scheme proposed by Damnjanovic and Vojcic when the greedy detector is utilized introduces a slight degradation in performance     

Decision-feedback soft-input/soft-output multiuser detector foriterative decoding of coded CDMA

The optimal decoding scheme for a code-division multiple-access (CDMA) system that employs convolutional codes results in a prohibitive computational complexity. To reduce the computational complexity, an iterative receiver structure was proposed for decoding multiuser data in a convolutional coded CDMA system. At each iteration, extrinsic information is exchanged between a soft-input/soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders. However, a direct implementation of the full-complexity SISO multiuser detector also has the exponential computational complexity in terms of the number of users. This paper proposes a low-complexity SISO multiuser detector based on tentative hard decisions that are made and fed back from the channel decoders in the previous iteration. The computational complexity of the proposed detector is linear in terms of the number of users and can be adjusted according to the complexity/performance tradeoff. Simulation results show that even with this simple feedback scheme, the performance of the coded multiuser system approaches that of the single-user system for moderate to high signal-to-noise ratios (SNRs)     

A low-complexity SISO multiuser detector for iterative decoding of asynchronous CDMA systems with convolutional codes

The optimal decoding scheme for asynchronous code-division multiple-access (CDMA) systems that employ convolutional codes results in a prohibitive computational complexity. To reduce the computational complexity, an iterative receiver structure was proposed for decoding multiuser data in a convolutional coded CDMA system. At each iteration, extrinsic information is exchanged between a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders. A direct implementation of the optimal SISO multiuser detector, however, has exponential computational complexity in terms of the number of users which is still prohibitive for channels with a medium to large number of users. This paper presents a low-complexity SISO multiuser detector using the decision-feedback scheme, of which tentative hard decisions are made and fed back to the SISO multiuser from the previous decoding output. In the proposed scheme, the log-likelihood ratios (LLR) as well as the tentative hard decisions of code bits are fed back from the SISO decoders. The hard decisions are used to constrain the trellis of the SISO multiuser detector and the LLRs are used to provide a priori information on the code bits. The detector provides good performance/complexity tradeoffs. The computational complexity of the detector can be set to be as low as linear in the number of users. Simulations show that the performance of the low-complexity SISO multiuser detector approaches that of the single-user system for moderate to high signal-to-noise ratios even for a large number of users.     

A Low-Complexity Multiuser Detector for Asynchronous CDMA QPSK Adaptive Antenna Array Systems

This paper proposes a low complexity joint space-time multiuser detection algorithm for asynchronous DS/CDMA antenna array systems. The proposed multiuser detector is composed of an adaptive antenna array, used as a linear beamformer, and a sliding window decorrelator. A QPSK modulation scheme is used in order to increase bandwidth efficiency. Numerical results are given in terms of Bit Error Rate (BER) under the assumption of a frequency-selective Rayleigh slow fading channel. In particular, the proposed receiver is shown to be near-far resistant, even in worst fading cases, and to exploit completely array introduction while maintaining acceptable computational complexity. The proposed architecture avoids linear filter realization of the decorrelator, which is impractical in the case of a large number of users, and operates with relatively short data frames instead of the complete information sequence. Finally, this receiver is very flexible to changes in timing configuration.     

A spatial-temporal decorrelating receiver for CDMA systems withbase-station antenna arrays

We investigate multiuser signal detection with a base-station antenna array for a synchronous DS-CDMA uplink using nonorthogonal codes in Rayleigh fading channels. We have developed a new formulation for a spatial-temporal decorrelating detector using the maximum-likelihood criteria. The detector is shown to be near-far resistant. We propose to implement the spatial-temporal decorrelating receiver iteratively by applying the space-alternating generalized expectation-maximization (SAGE) algorithm. Simulation results show that the SAGE-based decorrelating receiver significantly outperforms the conventional single-user receiver and with performance close to that of a spatial-temporal decorrelating receiver with known channel parameters. We have observed that adding base-station antennas can actually improve convergence of the proposed iterative receiver     

Iterative multiuser detection for turbo-coded synchronous CDMA inGaussian and non-Gaussian impulsive noise

We develop an iterative multiuser receiver for decoding turbo-coded synchronous code-division multiple-access signals in both Gaussian and non-Gaussian noise. A soft-input soft-output nonlinear multiuser detector is combined with a set of single-user channel decoders in an iterative detection/decoding structure. The nonlinear multiuser detector utilizes the prior probabilities of each user's bits to form soft estimates used for multiple-access interference cancellation. The channel decoders perform turbo-code decoding and produce posterior probabilities which are fed back to the multiuser detector for use as prior probabilities. Simulation results show that the proposed multiuser receiver performs well in both Gaussian and non-Gaussian noise. In particular, single-user turbo-code performance can be approached within a few iterations with medium to low cross correlation (ρ⩽0.5)     

Group detection for synchronous Gaussian code-divisionmultiple-access channels

The concept of group detection Is introduced to address the design of suboptimum multiuser detectors for code-division multiple-access (CDMA) channels. A group detection scheme consists of a bank of P group detectors, one each for detecting the information symbols of users in each group of a P group partition of the K simultaneously transmitting users. In a parallel group detection scheme, these group detectors operate independently, whereas in a sequential scheme, each group detector. Uses the decisions of the previous group detectors to successively cancel the interference from those users. Group detectors based on the generalized likelihood ratio test (GLRT) are obtained for the synchronous Gaussian CDMA channel. The complexity of these detectors is exponential in the group size, whereas that of the optimum detector is exponential in K. Since the partition of users is a design parameter, group sizes can be chosen to satisfy a wide range of complexity constraints. A key performance result is that the GLRT group detectors are optimally group near-far resistant. Furthermore, upper and lower bounds on the asymptotic efficiency of the sequential group detectors are derived. These bounds reveal that the sequential group detectors can, under certain conditions, perform as well as GLRT group detectors of much larger group sizes. Group detection provides a unifying approach to multiuser detection. When the users are partitioned into K single-user groups, the GLRT, a modified form of GLRT, and the sequential group detectors reduce to previously proposed suboptimal detectors; namely, the decorrelator, the two-stage detector, and the decorrelating decision-feedback detector, respectively. For the other nontrivial partitions, the group detectors are new and have a performance that is commensurate with their complexity     

两种基于调制引入循环平稳的多用户系统盲检测研究

本文探讨了两种多用户系统的检测方法:第一种方法首先分别对各个用户的信道进行盲辨识,再进行多用户盲检测;第二种方法在收方利用频偏滤波(FRESH)的超强抗干扰能力,从收方混合多用户收信号中盲提取和盲分离出所需用户的收信号,再利用已辨识出的该用户的信道进行单用户盲检测。但这里的单用户检测不是普通的单用户检测,而是用了干扰抑制技术的新型检测,所以性能可以同多用户检测相当,克服了近远问题。     

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     

Linear Differentially Coherent Multiuser Detection for Multipath Channels

By combining multipath processing, differential signal detection, and multiuser detection techniques, we develop a class of near-far resistant linear detectors for differentially coherent multipath signals. We derive and establish performance relationships among the following detectors: an optimally near-far resistant detector, a suboptimum detector which does not require knowledge of the signal coordinates, and a minimum mean square error (MMSE) detector which achieves near-optimum asymptotic efficiency. We present an adaptive multiuser detector which converges to the MMSE detector without training sequences and which requires less information than the conventional single user rake receiver.     

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     

A low-complexity iterative multiuser receiver for turbo-codedDS-CDMA systems

Optimal joint multiuser detection and decoding for direct-sequence code-division multiple-access (DS-CDMA) systems with forward error correction normally requires prohibitively high computational complexity. A suboptimal solution with low complexity is therefore appealing for use in practical applications. We propose a low-complexity iterative multiuser receiver for turbo-coded DS-CDMA systems. The proposed approach consists of a modified decorrelating decision-feedback detector (MDDFD) and K single-user turbo decoders, where K is the number of users in the DS-CDMA system. The MDDFD is derived on the basis of maximizing a likelihood probability and has a feature that it can use the reliability information from the turbo decoders' output. In addition, the MDDFD can deliver interference-cancelled soft outputs to the turbo decoders where the calculation of transition metrics is modified appropriately. Both performance analysis and computer simulation results have indicated that the reliability information from the turbo decoders' output can enhance the multiuser detection capability of the MDDFD. Computer simulations have also shown that the proposed iterative multiuser receiver outperforms the conventional DDFD-based multiuser receiver in terms of the bit-error probability