Long-code CDMA Systems Research Articles

A Chip-Level BSOR-Based Linear GSIC Multiuser Detector for Long-Code CDMA Systems

We introduce a chip-level linear group-wise successive interference cancellation (GSIC) multiuser structure that is asymptotically equivalent to block successive over-relaxation (BSOR) iteration, which is known to outperform the conventional block Gauss-Seidel iteration by an order of magnitude in terms of convergence speed. The main advantage of the proposed scheme is that it uses directly the spreading codes instead of the cross-correlation matrix and thus does not require the calculation of the cross-correlation matrix (requires floating point operations (flops), where is the processing gain and is the number of users) which reduces significantly the overall computational complexity. Thus it is suitable for long-code CDMA systems such as IS-95 and UMTS where the cross-correlation matrix is changing every symbol. We study the convergence behavior of the proposed scheme using two approaches and prove that it converges to the decorrelator detector if the over-relaxation factor is in the interval ]0, 2[. Simulation results are in excellent agreement with theory.

Blind Multiuser Detection for Long-Code CDMA Systems with Transmission-Induced Cyclostationarity

We consider blind channel identification and signal separation in long-code CDMA systems. First, by modeling the received signals as cyclostationary processes with modulation-induced cyclostationarity, long-code CDMA system is characterized using a time-invariant system model. Secondly, based on the time-invariant model, multistep linear prediction method is used to reduce the intersymbol interference introduced by multipath propagation, and channel estimation then follows by utilizing the nonconstant modulus precoding technique with or without the matrix-pencil approach. The channel estimation algorithm without the matrix-pencil approach relies on the Fourier transform, and requires additional constraint on the code sequences other than being nonconstant modulus. It is found that by introducing a random linear transform, the matrix-pencil approach can remove (with probability one) the extra constraint on the code sequences. Thirdly, after channel estimation, equalization is carried out using a cyclic Wiener filter. Finally, since chip-level equalization is performed, the proposed approach can readily be extended to multirate cases, either with multicode or variable spreading factor. Simulation results show that compared with the approach using the Fourier transform, the matrix-pencil-based approach can significantly improve the accuracy of channel estimation, therefore the overall system performance.

Joint Performance Study of Channel Estimation and Multiuser Detection for Uplink Long-Code CDMA Systems

Although numerous channel estimation and multiuser detection approaches have appeared for long-code uplink CDMA systems, joint performance study of channel estimators and symbol detectors remains largely open. In this paper, we construct three typical symbol-level linear receivers upon existing channel estimation method, known as zero-forcing (ZF), minimum mean-square-error (MMSE), and RAKE receivers, for symbol detection. Since the channel estimation error is rippled to the linear receivers, performance of all receivers is thus jointly analyzed with the channel estimator from a perturbation perspective. Extensive simulation examples involving different communication environments demonstrate high consistency between our analysis and experimental results.

A Low-Complexity Blind Multiuser Receiver for Long-Code CDMA

Receivers for long-code systems are for computational reasons usually based on simple matched-filter techniques, and hence suffer from multiaccess interference. Decorrelating RAKE and MMSE receivers do not have this problem but have not been widely studied due to the apparent complexity of the inversion of a large code matrix. Tong, van der Veen Dewilde, and Sung (IEEE Tr. Signal Proc., 2003) derived a blind decorrelating RAKE receiver (DRR) and channel estimation algorithm for long-code CDMA systems, and showed how it can be efficiently implemented. In this paper, we continue on that work. We propose both single-user and multiuser blind source-channel estimation algorithms by making use of an iterative estimation scheme initialized by the DRR. Simulation results show significant improvement, even in heavily loaded systems. Moreover, with an implementation based on time-varying system theory, the proposed algorithm can be implemented efficiently at a cost similar to the RAKE.

A graphic approach to performance analysis of multistage linear interference canceller in long-code cdma systems

The signal-to-interference-plus-noise-ratio performance of the multistage linear parallel and successive interference cancellers (LPIC and LSIC) in a long-code code-division multiple-access system is analyzed using a graphical approach. The decision statistic is modeled as a Gaussian random variable, whose mean and variance can be expressed as functions of moments of R for the LPIC and L for the LSIC, respectively, where R is the correlation matrix of signature sequences and L is the strict lower triangular part of R. Since the complexity of calculating these moments increases rapidly with the growth of the stage index, a graphical representation of moments is developed to facilitate the computation. Propositions are presented to relate the moment calculation problem to several well-known problems in graph theory, i.e., the coloring, the graph decomposition, the biconnected component finding, and the Euler tour problems. It is shown that the derived analytic results match well with simulation results.