Performance analysis of O/sup 3/BPSK LDD for asynchronous CDMA systems in the presence of synchronization errors

A convenient signaling scheme, termed orthogonal on-off binary phase-shift keying (O/sup 3/BPSK), along with a simple one-shot linear decorrelating detector (LDD), was proposed by F.C. Zheng and S.K. Barton (see ibid., vol.47, p.969-76, 1998; Proc. IEEE PIMRC'94, p.194-8, 1994) as a technique for near-far resistant detection in asynchronous direct-sequence code-division multiple-access (DS/CDMA) systems. The temporally adjacent bits from different users in the received signals are decoupled by using on-off signaling, and the data rate is maintained with no increase in the transmission rate by adopting an orthogonal structure. The paper examines the effects of three classes of synchronization errors (time-delay errors, carrier phase errors, and carrier frequency errors) on the performance of the O/sup 3/BPSK LDD in an asynchronous CDMA near-far environment. It is shown that the performance of the O/sup 3/BPSK LDD has an advantage over that of the isolation bit insertion detector in the presence of synchronization errors. In addition, numerical results show that the O/sup 3/BPSK LDD still offers a good near-far resistant property as long as synchronization errors do not exceed some practical limit.     

长码CDMA系统上行链路多用户接收机设计

提出一种适用于长码CDMA移动通信系统上行链路的多用户接收机设计方案，包括多用户信道估计、多用户检测以及信道跟踪等算法。通过把用户传播时延的影响放入信道响应矩阵中，由信道估计间接得出各用户的传播时延。使用迭代运算的方式使得运算量分散，降低了对硬件平台的要求，使算法更为适用。增大观察窗的长度达到了更准确的用户信息比特判决，提高了接收机的性能。仿真结果表明文章提出的接收机设计方案具有很好的远近效应抑制能力，性能远高于传统的单用户Rake接收机。     

Blind code-timing estimation for CDMA systems with bandlimited chip waveforms in multipath fading channels

In this paper, we present a blind code-timing estimator for asynchronous code-division multiple-access (CDMA) systems that use bandlimited chip waveforms. The proposed estimator first converts the received signal to the frequency domain, followed by a frequency deconvolution to remove the convolving chip waveform, and then calculates the code-timing estimate from the output of a narrowband filter with a sweeping center frequency, which is designed to suppress the overall interference in the frequency domain. The proposed estimator is near-far resistant, and can deal with time- and frequency-selective channel fading. It uses only the spreading code of the desired user, and can be adaptively implemented for both code acquisition and tracking. We also derive an unconditional Crame/spl acute/r-Rao bound (CRB) that is not conditioned on the fading coefficients or the information symbols. It is a more suitable lower bound than a conditional CRB for blind code-timing estimators which do not assume knowledge of the channel or information symbols. We present numerical examples to evaluate and compare the proposed and several other code-timing estimators for bandlimited CDMA systems.     

Subspace-based channel estimation for code division multiple accesscommunication systems

We consider the estimation of channel parameters for code-division multiple access (CDMA) communication systems operating over channels with either single or multiple propagation paths. The multiuser channel estimation problem is decomposed into a series of single user problems through a subspace-based approach. By exploiting the eigenstructure of the received signal's sample correlation matrix, the observation space can be partitioned into a signal subspace and a noise subspace without prior knowledge of the unknown parameters. The channel estimate is formed by projecting a given user's spreading waveform into the estimated noise subspace and then either minimizing the likelihood or minimizing the Euclidean norm of this projection. Both of these approaches yield algorithms which are near-far resistant and do not require a preamble     

Channel acquisition and tracking for DS-CDMA uplink transmissions

This paper deals with channel acquisition and tracking for the uplink of direct-sequence code-division multiple-access systems. The transmission medium is characterized by multipath propagation, and the goal is to estimate the time-varying channel impulse response (CIR) for a new user entering the system. Channel acquisition is pursued through maximum-likelihood techniques. The resulting scheme may be too complex in some applications, as it requires the online inversion of a large matrix. Therefore, we also consider a simpler solution based on the least-squares (LS) criterion. Channel tracking is performed through weighted LS methods. At each signaling interval, the CIR estimate is updated using data decisions and exploiting the inverse of the interference covariance matrix to mitigate the near-far problem. Performance is assessed by simulation in a scenario inspired by the frequency-division duplexing component of the universal mobile telecommunications system. The acquisition/tracking algorithms are found to be resistant to multiuser interference and suitable for transmissions over fast-fading channels.     

Maximum-likelihood synchronization of a single user forcode-division multiple-access communication systems

Code-division multiple access (CDMA) has emerged as an access protocol well-suited for voice and data transmission. One significant limitation of the conventional CDMA system is the near-far problem where strong signals interfere with the detection of a weak signal. Multiuser detectors assume knowledge of all of the modulation waveforms and channel parameters, and exploit this information to eliminate multiple-access interference (MAI) and to achieve near-far resistance. A major problem in practical application of multiuser detection is the estimation of the signal and channel parameters in a near-far limited system. We consider maximum-likelihood estimation of users delay, amplitude, and phase in a CDMA communication system. We present an approach for decomposing this multiuser estimation problem into a series of single-user problems. In this method the interfering users are treated as colored non-Gaussian noise. The observation vectors are preprocessed to be able to apply a Gaussian model for the MAI. The maximum-likelihood estimate (MLE) of each user's parameters based on the processed observation vectors becomes tractable. The estimator includes a whitening filter derived from the sample covariance matrix which is used to suppress the MAI, thus yielding a near-far resistant estimator     

Adaptive symbol and parameter estimation in asynchronous multiuserCDMA detectors

Existing multiuser code-division multiple-access (CDMA) detectors either have to rely on strict power control or near-perfect parameter estimation for reliable operation. A novel adaptive multiuser CDMA detector structure is introduced. Using either an extended Kalman filter (EKF) or a recursive least squares (RLS) formulation, adaptive algorithms which jointly estimate the transmitted bits of each user and individual amplitudes and time delays may be derived. The proposed detectors work in a tracking mode after initial delay acquisition is accomplished using other techniques not discussed here. Through computer simulations, we show that the algorithms perform better than a bank of single-user (SU) receivers in terms of near-far resistance. Practical issues such as the selection of adaptation parameters are also discussed     

A space-time channel estimator and single-user receiver for code-reuse DS-CDMA systems

A blind asynchronous single-user code-reuse direct sequence code division multiple access (CDMA) array receiver is proposed for the uplink. By assigning each short PN-code more than once, code reuse allows the number of active users to be increased beyond the spreading gain. The proposed receiver is based on a blind single-code multipath joint space-time channel estimation technique that utilizes the concept of the spatio-temporal array manifold, in conjunction with a novel preprocessor, to deal with the multipath problem. From the estimated space-time channel parameters of a particular active code, the subset of parameters of a specific co-code user is then identified, and a single-user receiving weight vector is finally formed. The proposed approach is a subspace type method, and therefore, it is "near-far" resistant. Furthermore, in contrast to existing receivers such as the space-time decorrelating detector, the proposed receiver weight vector is tolerant to partial channel estimation errors and the incomplete estimation of channel parameters. The theoretical framework is supported by computer simulation studies.     

Multiuser detection of asynchronous CDMA with frequency offset

This article presents a near-far resistant detection scheme for asynchronous code-division multiple access with frequency offset. Based on a one-shot technique and Taylor expansion, a zeroth-order and a first-order one-shot linear decorrelating detector (LDD) are proposed. The zeroth-order LDD has simple architecture but suffers performance degradation for large frequency offset. The first-order one-shot LDD, with increased complexity, has very good near-far resistant property even for large frequency offset. Two versions of the first-order one-shot LDD are investigated according to different Taylor expansion approaches. The feasibility of the proposed detectors is demonstrated by computer simulations     

Blind adaptive joint multiuser detection and equalization in dispersive differentially encoded CDMA channels

The problem of blind adaptive joint multiuser detection and equalization in direct-sequence code division multiple access (DS/CDMA) systems operating over fading dispersive channels is considered. A blind and code-aided detection algorithm is proposed, i.e., the procedure requires knowledge of neither the interfering users' parameters (spreading codes, timing offsets, and propagation channels), nor the timing and channel impulse response of the user of interest but only of its spreading code. The proposed structure is a two-stage one: the first stage is aimed at suppressing the multiuser interference, whereas the second-stage performs channel estimation and data detection. Special attention is paid to theoretical issues concerning the design of the interference blocking stage and, in particular, to the development of general conditions to prevent signal cancellation under vanishingly small noise. A statistical analysis of the proposed system is also presented, showing that it incurs a very limited loss with respect to the nonblind minimum mean square error detector, outperforms other previously known blind systems, and is near-far resistant. A major advantage of the new structure is that it admits an adaptive implementation with quadratic (in the processing gain) computational complexity. This adaptive algorithm, which couples a recursive-least-squares estimation of the blocking matrix and subspace tracking techniques, achieves effective steady-state performance.     

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     

A Study of the Technique of Linear Multiuser

The technique of linear multiuser detection in DS-CDMA systems is studied in this paper. The purpose is to find a receiver structure with good performance and moderate complexity, so that the receiver can efficiently suppress multiple-access interference(MAI) and multipath interference and has good near-far resistant ability, which may improve the system's capability while reducing the requirement for power control. The main work of the dissertation can be summarized as follows: the performance of MMSE multiuser detector in synchronous/asynchronous DS-CDMA systems over different channels is analyzed in chapter 2 of the dissertation. Using matrix method, we analyze the relation between performance measurement and spreading code correlation matrix, Signal-Interference-Ratio(SIR) and near-far factor, and prove that the performance of MMSE detector is better than that of the decorrelating detector. For fading channel, we analyze the performance of MMSE detector in DS-SS system firstly. Results show that the detector can efficiently suppress multipath interference. Extending to synchronous/asynchronous DS-CDMA systems over fading channels, we propose a simple linear detector structure that accomplishes despreading, detection and combining. Thus, the receiver is easy for implementation. Based on the proposed notion of combined spreading codes, we prove that the synchronous/asynchronous CDMA system is equivalent to the synchronous CDMA system over AWGN channel with double users. Therefore, the MMSE detector can efficiently suppress MAI and multipath interference in steady state, and has good near-far resistant ability. In chapter 3, we study the adaptive algorithm based on MMSE criterion. Firstly, the approach to the blind algorithm based on subspace is analyzed. We improve the algorithm in the part of channel estimation, which decreases the computational complexity while guaranteeing the performance. Meanwhile, we point out that CMOE-RLS algorithm is essentially an algorithm based on subspace approach. Also, it is shown from simulation that PASTd subspace tracking algorithm is not applicable for multiuser detection. Secondly, we propose an adaptive algorithm based on pilot channel, called PCA/PCRA. The algorithm does not require channel estimation, and has a rapid convergence rate. The steady state performance can be achieved by increasing the transmitting power in pilot channel. Computational complexity is only O(N2). Therefore, PCA/PCRA is suitable for the engineering application. The cost is that a pilot channel is needed for each user in the system. In chapter 4, constant algorithms for multiuser detection are studied. Firstly, we analyze the capture performance of CMA, and point out there exist many local stationary points. Initializations to guarantee CMA converges to the desired point are discussed. Results show that the convergence of CMA is decided by constant, step-size, spreading code correlation matrix and near-far factor. Secondly, we propose the constrained constant algorithm (C-CMA) for multiuser detection. It is shown that when the constant is greater than the triple power of the desired user, C-CMA globally converges to the desired point. Simulations illustrate that C-CMA has a rapid convergence rate and the steady state performance is good. However, great step-size can also reult in dispersion for the algorithm. Since C-CMA is a variable step-size CMOE-LMS algorithm, we propose a variable step-size constraint algorithm (VSCA). VSCA has the advantages of both CMOE-LMS and C-CMA such as robust, rapid convergence rate and good steady state performance. Thus, VSCA is suitable for engineering application. But the improper selection of step-size coefficients may degrade performance seriously. The computational complexity of the above constant algorithms is only O(N). In Section 5, the cyclostationarity of spreading signals is analyzed in the first part. We prove that spreading signals are ergodic cyclostationary signals with a cyclic period that is equal to the period of spreading code. Methods for processing cyclostationary signals are then given. It is shown that this method can mitigate the interference from a stationary noise for channel estimation. But the computational complexity for cyclostationary correlation is high, which prevents its application in implementation. In the second part, we discuss the application of oversampling technique in spreading communication systems. Although the oversampling can improve the performance of the linear multiuser detector, the improvement is trivial. On the contrary, oversampling increases the computational complexity of the weight vector greatly, which prevents its application in implementation. Additionally, we prove that FSE plus despreading or despreading pus FSE is equivalent to the linear detector with different lengths of delay line. However, the two kinds of structure have lower computational complexity.     

Decoupled multiuser code-timing estimation for code-divisionmultiple-access communication systems

We present herein a decoupled multiuser acquisition (DEMA) algorithm for code-timing estimation in asynchronous code-division multiple-access (CDMA) communication systems. The DEMA estimator is an asymptotic (for large data samples) maximum-likelihood method that models the channel parameters as deterministic unknowns. By evoking the mild assumption that the transmitted data bits for all users are independently and identically distributed, we show that the multiuser timing estimation problem that usually requires a search over a multidimensional parameter space decouples into a set of noniterative one-dimensional problems. Hence, the proposed algorithm is computationally efficient. DEMA has the desired property that, in the absence of noise, it obtains the exact parameter estimates even with a finite number of data samples which can be heavily correlated. Another important feature of DEMA is that it exploits the structure of the receiver vectors and, therefore, is near-far resistant. Numerical examples are included to demonstrate and compare the performances of DEMA and a few other standard code-timing estimators     

Multiuser channel estimation and tracking for long-code CDMA systems

Channel estimation techniques for code-division multiple access (CDMA) systems need to combat multiple access interference (MAI) effectively. Most existing estimation techniques are designed for CDMA systems with short repetitive spreading codes. However, current and next-generation wireless systems use long spreading codes whose periods are much larger than the symbol duration. We derive the maximum-likelihood channel estimate for long-code CDMA systems over multipath channels using training sequences and approximate it using an iterative algorithm to reduce the computational complexity in each symbol duration. The iterative channel estimate is also shown to be asymptotically unbiased. The effectiveness of the iterative channel estimator is demonstrated in terms of squared error in estimation as well as the bit error rate performance of a multistage detector based on the channel estimates. The effect of error in decision feedback from the multistage detector (used in the absence of training sequences) is also shown to be negligible for reasonable feedback error rates using simulations. The proposed iterative channel estimation technique is also extended to track slowly varying multipath fading channels using decision feedback. Thus, an MAI-resistant multiuser channel estimation and tracking scheme with reasonable computational complexity is derived for long-code CDMA systems over multipath fading channels.     

Blind and training-assisted subspace code-timing estimation for CDMA with bandlimited chip waveforms

In this paper, we present a group of subspace code-timing estimation algorithms for asynchronous code-division multiple-access (CDMA) systems with bandlimited chip waveforms. The proposed schemes are frequency-domain based techniques that exploit a unique structure of the received signal in the frequency domain. They can be implemented either blindly or in a training-assisted manner. The proposed blind code-timing estimators require only the spreading code of the desired user, whereas the training-assisted schemes assume the additional knowledge of the transmitted symbols of the desired user. Through a design parameter of user choice, the proposed schemes offer flexible tradeoffs between performance, user capacity, and complexity. They can deal with both time- and frequency-selective fading channels. Numerical simulations show that the proposed schemes are near-far resistant, and compare favorably to an earlier subspace code-timing estimation scheme that is implemented in the time domain.     

频率选择性衰落信道下长扩频序列CDMA 系统的盲波束成形

本文提出一种适用于频率选择性衰落信道下长扩频序列CDMA系统，基于DMMSE准则的盲波束成形方案。该方案反频率选择性衰落信道分解成若干个非频率选择性衰落子信道，不需要训练符号开销，回避跟踪衰落信道参数，以所需用户的扩频序列作为永久性训练序列。仿真结果验证了其抵抗远近效应、抑制多址干扰的能力。     

CHANNEL ESTIMATION OF MULTI-RATE DS-CDMA SIGNALS IN SLOW FADING MULTIPATH CHANNELS

In Direct-Sequence Code Division Multiple Access(DS-CDMA) mobile communication systems, it is very important to obtain accurate estimation of the channel parameters,especially that of the propagation delay. But the near-far problem may make the estimation complicated and can degrade the estimation performance significantly. In this paper, an efficient Maximum Likelihood (ML) method is presented for channel parameter estimation of multi-rate DS-CDMA systems in slow fading multipath channels in a near-far scenario. The algorithm extended the ML approach to multi-rate DS-CDMA systems, and proposes decomposing a multidimensional optimization problem into a series of one-dimensional optimization and has improved computational efficiency. Theoretical analysis and numerical examples show that the estimator proposed is effective and near-far resistant.     

Near-far resistance of space-time processing for wireless CDMAcommunications

In this letter we evaluate the performance of space-time adaptive processing for wireless code-division multiple access (CDMA) communications through analysis of the near-far resistance. The model assumed is that of a frequency-selective and slow-fading channel. It is shown that while maximum ratio combining is not near-far resistant, optimum combining is near-far resistant when the number of cochannel interferences is less than the system dimensionality     

A delay independent decorrelating detector for quasi-synchronousCDMA

The decorrelating detector is a near-far resistant linear joint detector for a code-division multiple-access (CDMA) system. It consists of a bank of matched filters followed by a decorrelating matrix. For proper operation, both the matched filter bank and the decorrelating matrix require knowledge of the delays of all users. The delays are due to the different propagation times from each user to the base station. Delay estimation is a weak link in this system since it is complex and prone to error. The proposed decorrelating detector does not require exact knowledge of the user delays, but instead requires that the delays be bounded to a fraction of a symbol interval. The delays are naturally bounded in this way in many microcell and picocell systems where the round trip propagation time is small compared to the symbol interval. The new delay independent decorrelating detector is shown to be near-far resistant and, through appropriate spreading code selection, to experience a modest 3 dB signal-to-noise ratio (SNR) loss relative to orthogonal access schemes. It is also shown to limit capacity to a maximum of 50% of the spreading gain when the delays are bounded by a single chip interval. The complexity is similar to the conventional correlating receiver which is far less complex than the joint detection schemes proposed to date     

A new blind adaptive interference suppression scheme foracquisition and MMSE demodulation of DS/CDMA signals

We present an efficient blind algorithm for estimating the code timing of a desired user in an asynchronous direct-sequence code-division multiple-access (DS/CDMA) system over frequency-nonselective-fading channels. The proposed algorithm acquires the code timing explicitly and results in a near-far resistant minimum mean-squared error (MMSE) demodulation without requiring the knowledge of the timing information, amplitudes, and transmitted symbols of all transmissions. The only required knowledge is the information of the signature sequence used by the desired transmission. Several computer simulations are done for additive white Gaussian channels, Rayleigh fading channels, and two-ray Rayleigh fading multipath channels, respectively. Numerical results show that the new algorithm is near-far resistant to the multiple-access interference (MAI) in the DS/CDMA system