Performance of multiuser detection in multirate DS-CDMA systems

The performance of multirate direct-sequence code-division multiple-access (CDMA) systems is considered. We compare two multirate schemes: variable spreading length (VSL-CDMA) and multicode (MC-CDMA). The performance in terms of asymptotic multiuser efficiency (AME) and near-far resistance (NFR) for various detectors are evaluated. Analytical and numerical results demonstrate that in multirate systems, MC-CDMA has a similar performance to that of VSL-CDMA employing low-rate detection in terms of multirate AME (MAME) and multirate NFR (MNFR). A lower bound for the optimal MNFR is also obtained and is shown to be that of the linear decorrelator in multirate systems. Thus, this implies that the decorrelator is no longer optimal in the sense of MNFR.     

Preselection-based iterative multiuser detector for DS-CDMA systems

A low-complexity iterative multiuser detector is presented that uses adaptive preselection to minimise complexity while maintaining system performance very similar to that achieved when using the optimal maximum likelihood receiver.     

A dual-mode multiuser detector for DS-CDMA systems

We introduce a dual-mode multiuser detector that dynamically switches its detection mode between matched-filter and decorrelator operations based on the channel characteristics. This detector significantly reduces the overall computational requirement while maintaining similar performance as that of the decorrelator. The switching mechanism of our dual-mode detector is designed by exploiting the performance-complexity tradeoff between the decorrelator and the matched-filter. Extensions of this idea to other types of multiuser detectors are also proposed     

Performance analysis for the improved linear multiuser detectors in BPSK-modulated DS-CDMA systems

Recently, a new class of linear multiuser receivers for direct-sequence code-division multiple-access (CDMA) systems employing binary phase-shift keying modulation has been introduced. Unlike classical decorrelating and minimum mean-square error linear multiuser detectors, the new receivers exploit the information contained in the pseudo-autocorrelation of the observables, and are, thus, capable of achieving much better performance. We present new results on the performance analysis of this class of new receivers. In particular, with reference to a CDMA system with deterministic spreading codes, we show that the new receivers outperform the classical ones in terms of both error probability and near-far resistance. With regard, instead, to CDMA systems with random spreading, we compute the average system near-far resistance, showing that the new receivers can accommodate twice the number of users accommodated by the classical linear multiuser receivers.     

An equicorrelation-based multiuser communication scheme for DS-CDMA systems

An equicorrelation-based multiuser communication (ECBMC) scheme for direct-sequence code-division multiple-access (DS-CDMA) systems is presented. The ECBMC receiver has low computational complexity that is comparable to that of the conventional detector. By using the equality of cross correlations, the ECBMC scheme can completely eliminate multiple-access interference (MAI) in a synchronous single-path DS-CDMA network. The system performance is independent of the number of active users. The scheme is extended to include the effects of multipath fading. It is able to suppress a major portion of the MAI. This proposed ECBMC scheme is quite attractive for an MAI-dominant environment.     

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     

异步DS-CDMA系统中的最优时空线性多用户检测器

该文给出了一种适用于异步DS-CDMA系统的通用线性时空二维多用户检测方法,它将所有线性多用户检测器归结到一个统一的数学模型之下。基于此模型,该文将时空线性多用户检测问题转化为一个权矢量的优化问题,并在线性约束最小方差(LCMV)准则下给出了权矢量的优化解。对现有的几种典型线性多用户检测器的分析表明,这些方法都可以看作是该文提出的通用时空线性多用户检测方法的特例,且只能在某种限定条件下得到局部最优解,因此其抑制多址干扰和噪声的能力都低于文中的最优时空线性多用户检测器。最后,给出了数值仿真结果。     

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.     

Semiblind linear parallel interference cancellation multiuser detectors for DS-CDMA systems

Semiblind multiuser detection for the reverse link of a multicell code-division multiple-access (CDMA) system is considered. In such a system, although active users are present in the home cell and neighboring cells, the base station receiver only knows the signature information of the users in its own cell. Three new semiblind linear multiuser detectors are proposed based on parallel interference cancellation approach. Compared with some known semiblind detectors, the proposed detectors share a rather simple implementation structure and involve reduced latency for processing, which are of particular importance in a time-varying CDMA system. Numerical results are presented to compare the detection performance of the proposed detectors with that of some existing semiblind multiuser detectors.     

Single-user sparse channel acquisition in multiuser DS-CDMA systems

Single-user channel estimation in multiuser DS-CDMA systems for the case of sparse channels with large delay spreads is addressed. In addition, practical pulse shapes are considered. In sparse channels, the efficient way to estimate the parameters is to estimate the continuous delays of each path, instead of using the typical discrete tapped delay-line model. Due to the facts that the desired delays are not drawn from a simple finite set and that band-limited pulse shapes are employed, the resulting methods require numerical optimization techniques. To facilitate estimation, it is proposed to optimize the spreading code employed during the training, or estimation, phase. The optimal single-path spreading code is derived and extended for estimation in the multipath scenario. Both single-path and multipath channel estimation are considered. The proposed algorithms are evaluated through simulation and via the determination of the Cramer-Rao lower bound on the estimation variance. Analytical approximations of key performance measures are also derived and are seen to be tight for a variety of scenarios.     

A near-optimal multiuser detector for DS-CDMA systems using semidefinite programming relaxation

A multiuser detector for direct-sequence code-division multiple-access systems based on semidefinite programming (SDP) is proposed. It is shown that maximum likelihood (ML) detection can be carried out by "relaxing" the associated integer programming problem to a dual SDP problem, which leads to a detector of polynomial complexity. Computer simulations that demonstrate that the proposed detector offers near-optimal performance with considerably reduced computational complexity compared with that of existing primal-SDP-relaxation based detectors are presented.     

Blind space-time multiuser channel estimation in time-varying DS-CDMA systems

A multistep linear prediction (MSLP) approach is presented for blind channel estimation for short-code direct sequence code division multiple access signals in time-varying multipath channels using a receiver antenna array. The time-varying channel is assumed to be described by a complex exponential basis expansion model. First, a recently proposed MSLP approach to blind channel estimation for time-varying single-input multiple-output (SIMO) systems is extended to time-varying multiple-input multiple-output (MIMO) systems to define a "signal" subspace. Second, the knowledge of the spreading code of a desired user is exploited in conjunction with the signal subspace to estimate the time-varying channel of the desired user up to an unknown time-invariant scale factor. Equalization/detection for the desired user can be then carried out if the information sequence is differentially encoded/decoded. Sufficient conditions for channel identifiability are investigated. Three illustrative simulation examples are provided.     

Subspace multiuser detection for multicarrier DS-CDMA

A subspace-based linear minimum mean-squared error (MMSE) multiuser detection scheme is proposed for a multicarrier direct-sequence code-division multiple-access (MC-DS-CDMA) system. Typically, a MC-DS-CDMA system employs a band-limited chip waveform. The band-limited nature of the chip waveform causes problem in applying standard subspace techniques because no non noise subspace can be formed. It is shown that channel and timing information needed for the construction of the linear MMSE detector can be identified by a multiple-signal-classification-like algorithm based on a finite-length truncation approximation of the chip waveform. In practice, since perturbed versions of the subspaces assumed in the finite-length truncation approximation are actually observed, and because of the band-limited property of the chip waveform, the accuracy of the channel estimation and, hence, the performance of the MMSE detector are degraded. This effect is investigated in this paper.     

Iterative multiuser turbo-code receiver for DS-CDMA

A number of different iterative decoding methods are proposed for multiuser interference cancellation in a code-division multiple-access system where turbo-codes are utilized for forward error correction (FEC). The individual users are decoded separately with the operation of iterative interference cancellation being mixed with iterative decoding of the turbo-code. This results in a modest increase in the overall complexity as compared to a conventional single-user receiver utilizing turbo-code for FEC. Numerical results are presented showing that the proposed iterative decoders show an improvement in the bit error rate performance and/or a reduction in the computational complexity as compared to similar previously known methods reported by M.C. Reed et al. (see 8th IEEE Int. Symp. Personal, Indoor and Mobile Radio Commun. - PIMRC'97, vol.2, p.740-4, 1997; IEEE Trans. Commun., vol.46, p.1693-9, 1998).     

ADAPTIVE STEP－SIZE CONSTANT MODULUS ALGORITHM FOR BLIND MULTIUSER DETECTION IN DS－CDMA SYSTEMS

Blind Adaptive Step-size Constant Modulus Algorithm (AS-CMA) for multiuser detection in DS-CDMA systems is presented.It combines the CMA and the concept of variable step-size,uses a second LMS algorithm for the step size.It adjusts the step-size according to the minimum output-energy principle within a specified range,thus overcomes the problems of bad effect of fixed step-size LMS algorithm.Compared with Adaptive Step-size LMS (AS-LMS) algorithm,through simulations,this algorithm can adapt the changes of the environment,suppress multiple access interference in the dynamic environment and the stability of Signal to Interference Ratio (SIR) is superior to that of AS-LMS.     

Modified SMC method of blind multiuser detection for DS-CDMA systems over fading channels

This paper presents the application of sequential Monte Carlo (SMC) methodology for blind detection in wireless direct sequence code division multiple access (DS-CDMA) systems over fading channels. It is known that the conventional SMC method requires a high-computational complexity that grows exponentially with the number of active users. This paper proposes a solution to this problem by employing Cholesky factorization to decompose the observed data into separate components for each user and then the parameters of each user are estimated with the SMC inference method under the decision feedback framework. Based on these concepts, an efficient blind decision feedback SMC (DF-SMC) receiver is developed for differentially encoded DS-CDMA systems. Simulation results demonstrate the promising performance of the proposed receiver for both flat fading and frequency-selective fading channels.     

Performance bounds for turbo-coded modulation systems

We apply the standard union bound to turbo-coded modulation systems with maximum-likelihood decoding. To illustrate the methodology, we explicitly derive the bounds for the 2-bits/s/Hz 16 QAM system. Generalization of this bound to other turbo-coded modulation systems is straightforward. As in the case of the standard union bound for turbo codes, we expect these bounds to be useful for rather large values of signal-to-noise ratios, i.e., signal-to-noise ratios for which the code rate is smaller than the corresponding cutoff rate. The bound is based on “uniform interleaving” just as its counterpart for standard turbo coding. The derived bound provides a tool for comparing coded modulation schemes having different component codes, interleaver lengths, mappings, etc., using maximum-likelihood decoding. It is also useful in studying the effectiveness of various suboptimal decoding algorithms. The bounding technique is also applicable to other coded-modulation schemes such as serially concatenated coded modulation     

Performance bounds for estimating vector systems

We propose a unified framework for the analysis of estimators of geometrical vector quantities and vector systems through a collection of performance measures. Unlike standard performance indicators, these measures have intuitive geometrical and physical interpretations, are independent of the coordinate reference frame, and are applicable to arbitrary parameterizations of the unknown vector or system of vectors. For each measure, we derive both finite-sample and asymptotic lower bounds that hold for large classes of estimators and serve as benchmarks for the assessment of estimation algorithms. Like the performance measures themselves, these bounds are independent of the reference coordinate frame, and we discuss their use as system design criteria     

Adaptive blind retrieval techniques for multiuser DS-CDMA signals

In a multiuser direct sequence code division multiple access system, retrieval of the transmitted signals with a conventional receiver is difficult when there is chip asynchronism, multipath propagation and the associated near-far problem. It is shown that despite these problems, an adaptive linear receiver based on a mixed cross-correlation and constant modulus algorithm has the potential to retrieve all users simultaneously. Moreover, for the assumed transmission model, a necessary condition for global convergence of the proposed algorithm is also provided     

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