Finite precision decorrelating receivers for multiuser CDMAcommunication systems

The design of single-user decorrelating receivers employing finite-precision sequences for despreading is considered. The problem is formulated as a nonlinear bounded integer optimization problem which is shown to be network performance (NP)-hard. A branch-and-bound algorithm for finding the best finite-precision decorrelating sequence is described. Numerical examples demonstrate that the loss in performance between the optimum, infinite-precision, and the best finite-precision decorrelator is small even for large channel occupancies. Some suboptimum algorithms are investigated which greatly reduce the computational complexity associated with finding good finite precision decorrelator sequences     

Throughput analysis of CDMA systems using multiuser receivers

Throughput bounds are attained for random channel access multichannel code-division multiple-access (CDMA) systems and spread slotted Aloha systems employing multiuser receivers. It is shown that the normalized throughput of these two systems reaches 1.0 exponentially fast in the region r/K<1, where, r is the average number of simultaneous users in each channel in the random channel access multichannel CDMA system and the packet arrival rate in the spread slotted Aloha system, respectively, and K is the maximum number of users which the multiuser receiver can handle at the same time. Therefore, both of the random channel access multichannel CDMA system and the spread slotted Aloha system employing multiuser receivers can achieve perfect throughput while being stable in the region r/K=1-δ, δ>0. The maximum throughput of the random channel access multichannel CDMA systems is found as K-√(1-(1/M))KlogK-O(logK), where M is the number of channels in the system. The maximum throughput is reached when the average number of simultaneous users is r_m=K-√((1-(1/M))KlogK))+O(√(K/logK)). The maximum throughput of the spread slotted Aloha systems is K-√(KlogK)-O(log K). The maximum throughput is reached when the packet arrival of Poisson distribution has the arrival rate λ_m=K-√(KlogK)+O(√(K/logK))     

Adaptive techniques for multiuser CDMA receivers

A number of CDMA receivers have been proposed that cover the whole spectrum of performance/complexity from the simple matched filter to the optimal Viterbi (1995) processor. Adaptive solutions, in particular, have the potential of providing the anticipated multiuser detection (MD) performance gains with a complexity that would be manageable for third generation systems. Our goal, in this article, is to provide an overview of previous work in MD with an emphasis on adaptive methods. We start with (suboptimal) linear receivers and discuss the data-aided MMSE receiver. Blind (nondata-aided) implementations are also reviewed together with techniques that can mitigate possible multipath effects and channel dispersion. In anticipation of those developments, appropriate discrete-time (chip rate) CDMA models are reviewed, which incorporate asynchronism and channel dispersion. For systems with large spreading factors, the convergence and tracking properties of conventional adaptive filters may be inadequate due to the large number of coefficients which must be estimated. In this context, reduced rank adaptive filtering is discussed. In this approach, the number of parameters is reduced by restricting the receiver tap vector to belong to a carefully chosen subspace. In this way the number of coefficients to be estimated is significantly reduced with minimal performance loss     

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.     

Analysis and design of interleavers for iterative multiuser receivers in coded CDMA systems

We deal with the design of interleavers in a coded code-division multiple-access (CDMA) scenario, where at the receiver an iterative turbo-like structure to perform multiuser detection is employed. The choice of the interleavers affects both the maximum-likelihood (ML) performance and the impact of the suboptimality of the iterative receiver. First, heuristic criteria of goodness for a set of interleavers, each assigned to a given active user, are introduced and motivated. One of these criteria is based on the intersection between the equivalent codes seen after the interleavers for each user pair. The design rules are valid for any kind of channel code. In particular, when the channel code used by every user is a terminated convolutional code, a very simple design rule, in the subset of congruential interleavers, is specified. The suitability of an interleaver set to iterative decoding is also treated. The analysis leads to a design rule which is shown to have great importance on the performance of a turbo-like receiver. Numerical results assess the validity of the derived design rules by showing that, for iterative multiuser receivers and reasonable block lengths, the suitability to iterative decoding is more important than the performance optimization.     

Differentially coherent decorrelating detector for CDMA single-pathtime-varying Rayleigh fading channels

This paper describes a differentially coherent decorrelating detector for a K-user reverse link code-division multiple-access environment that exhibits time-varying Rayleigh fading. The channel is modeled as providing only a single fading path for each user and with no additional means to achieve diversity. The design of the detector is based on using fractionally sampled matched filter outputs to simultaneously achieve two goals: 1) the novel realization of a one shot decorrelator with lower computational complexity and 2) the forming of the maximum-likelihood decision rule on the decorrelated outputs, which results in an effective increase of the correlation in the fading process. Analytical evaluation and simulation of the error probability of the detector demonstrates significant lowering of the error floor in comparison to the decorrelating detector that employs conventional differentially coherent detection     

Iterative multiuser receivers for CDMA channels: an EM-basedapproach

Maximum-likelihood detection for the multiuser code-division multiple-access (CDMA) channel is prohibitively complex. This paper considers new iterative multiuser receivers based on the expectation-maximization (EM) algorithm and related, more powerful “space-alternating” algorithms. The latter algorithms include the SAGE algorithm and a new “missing parameter” space-alternating algorithm that alternately updates individual parameter components or treats them as probabilistic missing data. Application of these EM-based algorithms to the problem of discrete parameter estimation (i.e., data detection) in the Gaussian multiple-access channel leads to a variety of convergent receiver structures that incorporate soft-decision feedback for interference cancellation and/or sequential updating of iterative bit estimates. Convergence and performance analyses are based on well-known properties of the EM algorithm and on numerical simulation     

A simulation comparison of multiuser receivers for cellular CDMA

Multiuser detection has gained significant notoriety as a potential advanced enabling technology for the next generation of CDMA systems. Due to the limitations of the conventional correlation receiver, the capacity of a single cell using CDMA is limited by self-interference and is subject to the near-far problem. To overcome these drawbacks, several advanced receiver structures have been proposed. Unlike the conventional receiver which treats multiple access interference (MAI) as if it were AWGN, multiuser receivers treat MAI as additional information to aid in detection. Although each of the multiuser types have been the subject of much literature, there is little published work comparing all structures on the basis of common assumptions. We present a comparison of five of the most discussed receiver structures: the decorrelator, the minimum mean square error (MMSE) receiver, the multistage parallel interference cancellation receiver, the successive interference cancellation receiver, and the decorrelating decision feedback receiver. Comparisons are based on both theoretical analysis and simulation results, examining bit error rate (BER) performance in AWGN, Rayleigh fading, and near/far channels. Additionally, receiver structures are compared on the basis of computational complexity as well as robustness to code phase misalignment. Finally, we present simulation results for noncoherent architectures of the aforementioned receivers     

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 asynchronous multiuser CDMA receivers for ISI channels usingcode-aided CMA

A code-aided constant modulus algorithm (CMA) based approach is presented for blind detection of asynchronous short-code DS-CDMA (direct sequence code division multiple access) signals in intersymbol interference (ISI)/multipath channels. Only the spreading code of the desired user is assumed to be known; its transmission delay may be unknown. A linear equalizer is designed by minimizing the Godard/CMA cost function of the equalizer output with respect to the equalizer coefficients subject to the fact that the equalizer lies in a subspace associated with the desired user's code sequence. Constrained CMA leads to the extraction of the desired user's signal whereas unconstrained minimization leads to the extraction of any one of the active users. The results are further improved by using unconstrained CMA initialized by the results of the code-aided CMA. Identifiability properties of the approach are analyzed. Illustrative simulation examples are provided     

Blind adaptive DS/CDMA receivers for multipath and multiuser environments

This paper proposes several blind adaptive receivers to eliminate multiple-access interference (MAI), intersymbol interference (ISI), and interchip interference (ICI) in direct-sequence code-division multiple access (DS/CDMA) downlink multiuser systems. We use the following concepts to formulate the cost function: 1) the variance of the despreading output approaches to the variance of the desired signal and 2) the discreteness property of the input signal. The proposed approaches are called variance-oriented approaches (VOAs). The VOA is then applied to three proposed receiver structures, especially the generalized sidelobe canceller (GSC) scheme that is generally the concept of spatial domain in beamforming system, to eliminate the MAI by one particular constraint in temporal domain. Besides, by this constraint, GSC filter possesses the property of global convergence in multipath environment once the channel estimation is appropriate. Simulation examples are shown to demonstrate the effectiveness and comparison of the proposed blind adaptive receivers.     

Joint decorrelating multiuser detection and channel estimation inasynchronous CDMA mobile communications channels

The asymptotic efficiencies of two decorrelators, path-by-path and channel-matched decorrelators, are analyzed in fading multipath propagation environments, and based upon the analytical results, a new joint multiuser detection and channel estimation scheme is proposed for asynchronous code division multiple access (CDMA) mobile communications channels. In the path-by-path decorrelator, each of the received signals corresponding to one of the multiple propagation paths is regarded as an independent interference source. On the contrary, in the channel-matched decorrelator, each composite signal transmitted from an identical user is regarded as a response of the multipath channel to the corresponding user's spreading sequence. The asymptotic efficiency of the path-by-path decorrelator is shown to drop rapidly as the number of simultaneous users increases. It is shown that the asymptotic efficiency can be made independent of the number of the propagation paths by the channel-matched decorrelator at the expense of requiring knowledge about the fading complex envelopes of all the propagation paths. The proposed joint multiuser detection and channel estimation scheme uses both path-by-path and channel-matched decorrelators. The path-by-path decorrelator is used for providing the channel estimator with the (noisy) channel information path-by-path, and decisions are made on the output of the channel-matched decorrelator. The decision results are fed back to the channel estimator, and used as the reference signals. The received complex envelope of each of the propagation paths is estimated in the channel estimator. Results of a series of exhaustive computer simulations are presented in order to demonstrate the overall performance of the proposed scheme, both in non-fading and fading multipath propagation environments     

Iterative receivers for multiuser space-time coding systems

Space-time coding (STC) techniques, which combine antenna array signal processing and channel coding techniques, are very promising approaches to substantial capacity increase in wireless channels. Multiuser detection techniques are powerful signal processing methodologies for interference suppression in CDMA systems. In this paper, by drawing analogies between a synchronous CDMA system and an STC multiuser system, we study the applications of some multiuser detection methods to STC multiuser systems. Specifically, we show that the so-called “turbo multiuser detection” technique, which performs soft interference cancellation and decoding iteratively, can be applied to STC multiuser systems in flat-fading channels. An iterative multiuser receiver and its projection-based variants are developed for both the space-time block coding (STBC) system and the space-time trellis coding (STTC) system. During iterations, extrinsic information is computed and exchanged between a soft multiuser demodulator and a bank of MAP decoders, to achieve successively refined estimates of the users' signals. Computer simulations demonstrate that the proposed iterative receiver techniques provide significant performance improvement over conventional noniterative methods in both single-user and multiuser STC systems. Furthermore, the performance of the proposed iterative multiuser receiver approaches that of the iterative single-user receiver in both STBC and STTC systems     

Optimal decorrelating receivers for DS-CDMA systems: a signalprocessing framework

Code division multiple access (CDMA) schemes allow a number of asynchronous users to share a transmission medium with minimum cooperation among them. However, sophisticated signal processing algorithms are needed at the receiver to combat interference from other users and multipath effects. A discrete-time multirate formulation is introduced for asynchronous CDMA systems, which can incorporate multipath effects. This formulation reveals interesting links between CDMA receivers and array processing problems. In this framework, linear receivers are derived that can completely suppress multiuser interference (decorrelating receivers). A criterion is introduced, which guarantees the decorrelating property, while providing optimal solutions in the presence of noise. Parametric FIR designs as well as nonparametric solutions are delineated, and their performance is analyzed. The proposed receivers are resistant to near-far effects and do not require the estimation of the users' and noise powers     

A two-stage decorrelating detector for DS/CDMA systems

This paper presents an improved two-stage decorrelating detection scheme for direct-sequence code-division multiple-access (DS-CDMA) systems. Decorrelator outputs corresponding to each user are tested to determine whether or not a final decision can be made with high reliability. For users with high reliability, a hard decision is made at this stage. For the remaining users, a conditional quantization algorithm is employed before a decision is made. Results indicate that significant performance enhancement can be achieved at the expense of a modest increase in computational complexity. The algorithm is also applied to synchronous as well as asynchronous multipath channels with excellent results. We also extend the two-stage decorrelating detection scheme to time-variant communication scenarios and present an adaptive version of the two-stage decorrelator     

Improved receivers for coherent FSK systems

There has been considerable interest over the last decade in the detection of digital coherent lightwave signals corrupted by phase noise. However, the majority of the work has been in the performance analysis of various modulation schemes. In addition, the receivers studied have, in general, been zero-phase noise optimal or ad hoc modifications of these. In this paper, we consider the design problem of constructing optimal receivers for systems using frequency shift keying (FSK). Using the innovations approach, we show the format of the optimal receiver and use a small phase noise approximation to derive suboptimal receivers. Also, receivers based on optimum linear filters are also derived. Both receivers are analyzed by simulation and performance improvements over the standard receivers are shown. Furthermore, the receivers developed can equally well be used to further improve the performance of other detection schemes such as postdetection filtering and time diversity. The methodology is also used to derive equivalent receivers for systems using on-off keying (OOK)     

Suboptimum multiuser receivers for convolutionally codedasynchronous DS-CDMA systems

Motivated by the high complexity of the optimal sequence estimator for convolutionally coded asynchronous code-division multiple-access (CDMA) systems, developed by Giallorenzi and Wilson (see ibid., vol.44, no.8, p.997, 1996), and the potentially poor performance of the conventional receiver due to multiuser interference and the near-far problem, we examine relatively simple multiuser receivers which perform nearly as well as the optimal receiver. The multiuser receivers discussed are of two types. The first set of approaches are partitioned approaches that treat the multiuser interference equalization problem and the decoding problem separately. The second set of approaches are integrated approaches that perform both the equalization and decoding operations together. We study linear, decision feedback, and trellis/tree-based approaches in each category. The asymptotic efficiency of this receiver relative to an uncoded coherent binary phase shift keying (BPSK) receiver (termed asymptotic multiuser coding gain, or AMCG) is used as a performance criterion throughout. Also, computer simulations are used whenever the computation of the AMCG is not feasible. It is shown that a number of the approaches which are introduced achieve a high performance level with a moderate complexity     

An adaptive multiuser receiver for CDMA systems

A new real-time, digital adaptive multiuser receiver structure is proposed for the uplink in a mobile communications system employing code division multiple access (CDMA). The receiver efficiently implements the decorrelating detector of Lupas and Verdu (1989) and can be adapted to incorporate decision feedback to further improve the detector performance. While the basic receiver design is presented for synchronous CDMA over AWGN channels, experimental evaluation of the receiver for the asynchronous case verifies its robustness for cases when the relative user delays are small compared to the symbol duration as in microcellular scenarios. An efficient decorrelating RAKE combiner for frequency-selective multipath channels is also proposed and analyzed. Performance evaluation of the detector via computer simulation scenarios is conducted in support of analytical results to substantiate its potential for real-time operation     

Robust multiuser detection for multicarrier CDMA systems

Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by using training sequences, and the covariance matrix of the received signal, usually replaced by the sample covariance matrix. However, such prior estimates are often affected by errors that are typically ignored in subsequent detection. In this paper, we present robust channel estimation and MUD techniques for multicarrier (MC) CDMA by explicitly taking into account such estimation errors. The proposed techniques are obtained by optimizing the worst case performance over two bounded uncertainty sets pertaining to the two types of estimation errors. We show that although the estimation errors associated with the prior channel estimate and the sample covariance matrix are generally not bounded, it is beneficial to optimize the worst case performance over properly chosen bounded uncertainty sets determined by a parameter called bounding probability. At a slightly higher computational complexity, our proposed robust detectors are shown to yield improved performance over the standard detectors that ignore the prior estimation errors.