Simultaneous suppression of multiaccess and narrow-bandinterference in asynchronous CDMA networks

This paper handles the simultaneous suppression of narrow-band and multiaccess interference in asynchronous CDMA networks. We consider both linear one-shot detection and block-detection, showing that, in both cases, the presence of an external narrow-band interferer generally results in the need for time-varying processing. As to the linear one-shot detectors, we derive both a zero-forcing and a minimum mean square error detector, showing that they are members of an only family, wherein the optimization criterion is the constrained minimization of a suitably defined output interference energy. We also present a comparative performance assessment between the various detection strategies, studying the impact of both the optimization criterion and other system parameters, such as the oversampling ratio and the length of the observation window. We also handle the problem of blind and adaptive detection. At first we show that the linear one-shot receivers are readily amenable to a blind implementation, upon off-line estimation of the covariance matrix of the observables. Next, we consider the problem of an adaptive implementation of a periodically time-varying minimum mean square error receiver, introducing and assessing a new cyclic recursive least squares (RLS) algorithm: we show that, unlike the conventional RLS algorithms, the new algorithm is capable of tracking the periodically time-varying variation of the receiver structure, induced by the presence of a data-like narrow-band interferer     

Partially blind adaptive MMSE interference rejection inasynchronous DS/CDMA networks over frequency-selective fading channels

In this work, the problem of joint suppression of multiple-access and narrow-band interference (NBI) for an asynchronous direct-sequence code-division multiple-access (CDMA) system operating on a frequency-selective fading channel is addressed. The receiver structure we consider can be deemed as a two-stage one: the first stage consists of a bank of minimum mean-square-error (MMSE) filters, each keyed to a given replica of the useful signal, and aimed at suppressing the overall interference; the second stage, assuming knowledge of the fading channel coefficients realizations, combines the MMSE filters outputs according to a maximal-ratio combining rule. Due to the presence of the NBI, the resulting structure is in general time-varying, and becomes periodically time-varying if the NBI bit-rate has a rational ratio to that of the CDMA system. Moreover, enlarging the observation window beyond the signaling interval and oversampling the signal space may yield a noticeable performance improvement. For the relevant case that the said ratio is rational, a new cyclic blind recursive least squares (RLS)-based algorithm is introduced, capable of tracking the periodically time-varying receiver structure, and allowing adaptive interference cancellation with a moderate complexity increase. We also come up with a closed-form expression for the conditional bit-error rate (BER), which is useful both to evaluate semi-analytical methods to assess the unconditional BER and to derive bounds on the system near-far resistance. The results indicate that the receiver achieves very satisfactory performance in comparison to previously known structures. Computer simulations also demonstrate that the cyclic blind RLS algorithm exhibits quite fast convergence dynamics     

MMSE receivers for multirate DS-CDMA systems

Minimum-mean squared error (MMSE) receivers are designed and analyzed for multiple data rate direct-sequence code-division multiple-access (DS-CDMA) systems. The inherent cyclostationarity of the DS-CDMA signal is exploited to construct receivers for asynchronous multipath channels. Multiple- and single-bandwidth access are treated for both single and multicarrier scenarios. In general, the optimal receiver is periodically time-varying. When the period of the optimal receiver is large, suboptimal receivers are proposed to achieve a lower complexity implementation; the receivers are designed as a function of the cyclic statistics of the signals. In multiple chipping rate systems, the complexity of receivers for smaller bandwidth users can also be controlled by changing their front-end filter bandwidth. The effect of front-end filter bandwidth on receiver performance and system capacity is quantified for a variable chipping rate system. Analysis and simulation show that significant performance gains are realized by the periodically time-varying MMSE receivers over their time-invariant counterparts     

Adaptive Detection and Channel Estimation for Dual-Rate DS/CDMA Networks in Frequency-Selective Fading

In a Dual-Rate DS/CDMA system, a primary, ``high rate' network coexists witha secondary one with a slower rate. Demultiplexinghigh-rate users typically entails, at the receiverend, a time-varying processing ifVariable Spreading Length (VSL), Variable Chip Rate (VCR), or Variable ChipRate with Frequency Shift (VCRFS) modulation formats are used, and Rake-Typedemodulation schemes if the chip rate exceeds the channel coherence bandwidth.The realization of fully adaptive receivers thus requires the joint estimationof(a) the interference to be suppressed, whether from other users ofthe high-ratenetwork or from the secondary network, and (b) the channel tap weights.The solutionthat we consider here assumes that,for each user, a pilot signal is transmitted alongwith the information-bearing signal, whether in a time-multiplexed orin a parallel-channel format. We consider both the uplink and the downlink channel and, based on a Minimum-Mean-Square-Error(MMSE) optimality criterion, we have come up with a fully adaptive system,capable on the one handof tracking, through a cyclic Recursive-Least-Squares typealgorithm, the periodically time-varying variations of theinterference subspace andon the other of updating the channel tap weights estimates.A thorough performance assessment is presented, and the convergence dynamicsof the system are derived through computer simulations in order to assessthe impact of the prior uncertainty with regard to the other-users signaturesand thechannel tap weights realizations.     

Adaptive BLAST-type decision-feedback equalizers for DS-CDMA systems

In this paper, we propose two new adaptive equalization algorithms for direct sequence code division multiple access (DS-CDMA) systems operating over time-varying and frequency selective channels. The equalization schemes consist of a number of serially connected stages and detect users in an ordered manner, applying a decision feedback equalizer (DFE) at each stage. Both the equalizer filters and the order in which the users are extracted are updated in a recursive least squares (RLS) manner, efficiently realized through time- and order-update recursions. V-BLAST detection ordering is implemented, that is, the stronger signal is extracted first so that the weaker users can be more easily detected. The spreading codes are unavailable at the receiver of the first scheme, whereas the second algorithm employs the RAKE receiver concept, incorporating knowledge of the spreading sequences to offer performance improvement. The bit error rate (BER) performance of the equalizers is evaluated via simulations, in both mild and severe near-far environments. Their superiority over existing techniques is demonstrated.     

Adaptive step-size algorithms for blind interference suppression inDS/CDMA systems

This paper develops adaptive step-size blind LMS algorithms and adaptive forgetting factor blind RLS algorithms for code-aided suppression of multiple access interference (MAI) and narrowband interference (NBI) in DS/CDMA systems. These algorithms optimally adapt both the step size (forgetting factor) and the weight vector of the blind linear multiuser detector using the received measurements. Simulations are provided to compare the proposed algorithms with previously studied blind RLS and blind LMS algorithms. They show that the adaptive step-size blind LMS algorithm and adaptive forgetting factor blind RLS algorithm field significant improvements over the standard blind LMS algorithm and blind RLS algorithm in dynamic environments where the number of interferers are time-varying     

Advanced blind adaptive multi-user detector for communications innonstationary multipath fading channel

This paper deals with an adaptive multi-user detector for direct sequence code division multiple access (DS/CDMA) wireless communication systems, named advanced blind adaptive multi-user detector (ABA-MUD), whose main features are low complexity and joint utilization of time diversity and adaptive blind processing techniques. Differently from known blind adaptive detectors, the proposed scheme achieves remarkable performance even in critical time-varying environments by means of a suitable window reprocessing technique. The ABA-MUD avoids the use of training sequences and only needs knowledge of timing and signature waveform of the desired user, number of active users and a rough evaluation of the signal-to-interference ratio (SIR) for a proper setting of the detection algorithm. Numerical results, shown here in terms of bit error rate (BER), highlight good behavior and remarkable near-far resistance of the proposed ABA-MUD receiver with respect to different alternatives, in particular, in the case of worst fading environments     

Iterative cyclic subspace tracking for blind adaptive multiuser detection in multirate CDMA systems

In this paper, the problem of subspace-based blind adaptive multiuser detection in multirate direct-sequence code-division multiple-access (DS-CDMA) systems adopting short (periodic) spreading codes is considered. The solution that we propose is based on the well-known formulation of the linear minimum mean-squared error and decorrelating detectors in terms of signal subspace parameters. Since in a multirate scenario the correlation properties of the observable and, hence, the signal subspace parameters are periodically time-varying, classical subspace tracking algorithms, which assume that the subspace to be tracked is time-invariant or slowly time-varying, are shown to be not useful in this situation. A new recursive cyclic subspace tracking algorithm is thus developed. This procedure, which is based on a generalization of the PASTd algorithm, is able to capture the periodical variations of the signal subspace, and thus enables subspace-based blind adaptive multiuser detection in multirate CDMA systems. The proposed algorithm has a smaller computational complexity than the recently developed cyclic recursive-least-squares procedure, and, as numerical results confirm, is capable of providing very satisfactory performance.     

RLS Algorithm with Variable Fogetting Factor for Decision Feedback Equalizer over Time-Variant Fading Channels

In a high-rate indoor wireless personal communication system, the delay spread due to multipath propagation results in intersymbol interference (ISI) which can significantly increase the transmission bit error rate (BER). Decision feedback equalizer (DFE) is an efficient approach to combating the ISI. Recursive least squares (RLS) algorithm with a constant forgetting factor is often used to update the tap-coefficient vector of the DFE for ISI-free transmission. However, using a constant forgetting factor may not yield the optimal performance in a nonstationary environment. In this paper, an adaptive algorithm is developed to obtain a time-varying forgetting factor. The forgetting factor is used with the RLS algorithm in a DFE for calculating the tap-coefficient vector in order to minimize the squared equalization error due to input noise and due to channel dynamics. The algorithm is derived based on the argument that, for optimal filtering, the equalization errors should be uncorrelated. The adaptive forgetting factor can be obtained based on on-line equalization error measurements. Computer simulation results demonstrate that better transmission performance can be achieved by using the RLS algorithm with the adaptive forgetting factor than that with a constant forgetting factor previously proposed for optimal steady-state performance or a variable forgetting factor for a near deterministic system.     

Coded asynchronous CDMA and its efficient detection

In this paper, receiver design and performance analysis for coded asynchronous code-division multiple access (CDMA) systems is considered. The receiver front-end consists of the near-far resistant multiuser detector known as the projection receiver (PR). The PR performs multiple-access interference resolution and is followed by error-control decoding. The output of the projection receiver yields the appropriate metric (i.e., soft information) for decoding of the coded sequences. An expression for the metric is derived that allows the use of a standard sequence decoder (e.g., Viterbi algorithm, M-algorithm) for the error-control code. It is then shown that the metric computer has an elegant adaptive implementation based on an extension of the familiar recursive least squares (RLS) algorithm. The adaptive PR operates on a single sample per chip and achieves a performance virtually identical to the algebraic PR, but with significantly less complexity. The receiver performance is studied for CDMA systems with fixed and random spreading sequences, and theoretical performance degradations with regard to the single-user bound are derived. The near-far resistance of the PR is also proven, and demonstrated by simulation     

Adaptive MMSE maximum likelihood CDMA multiuser detection

The well-known code division multiple access maximum likelihood receiver (MF-ML) uses a bank of matched filters as a generator of sufficient statistics for maximum likelihood detection of users transmitted symbols. In this paper, the bank of matched filters is replaced by a bank of adaptive minimum mean squared error (MMSE) filters as the generator of sufficient statistics. This formal replacement of the MF bank by the adaptive MMSE filter bank has significant conceptual consequences and provides improvement by several performance measures. The adaptive MMSE-ML receiver's digital implementation is significantly computationally simplified. The advantages of the proposed adaptive MMSE-ML receiver over the MF-ML receiver are: (1) ability to perform joint synchronization, channel parameter estimation, and signal detection where the signal is sent over an unknown, slowly time-varying, frequency-selective multipath fading channel; (2) increased information capacity in a multicellular environment; and (3) significantly improved bit error rate (BER) performance in a multicellular mobile communications environment. The information capacity and the BER of the proposed MMSE-ML receiver are analyzed. Numerical results showing the BER performance of the MMSE-ML receiver in a multipath channel environment are presented     

基于子空间约束RLS的半盲多用户检测算法

考虑实际的MC-CDMA上行链路,深入研究了基于RLS算法实现的MOE(RLS-MOE)盲自适应多用户检测,提出了MC-CDMA系统下一种基于子空间约束RLS的半盲多用户检测算法.在MOE盲多用户检测的基础上,利用小区内用户的已知扩频码设计了一种MOE半盲多用户检测器.将子空间方法和RLS算法相结合提出一种基于子空间约束的RLS 算法,使用该算法自适应得到MOE的权向量.本文算法利用所有已知用户的扩频码抑制了小区内用户的干扰,子空间约束的RLS 算法降低了噪声的影响,从而改善了系统的性能.修正的PASTd算法实现了信号的自适应跟踪,大大降低了计算量.仿真实验表明,本文算法的输出信干噪比和误码率性能优于RLS-MOE盲多用户检测,更接近于最优值.     

一种新的基于自适应步长的二级CMA盲接收机

在高速数据传输的频率选择性信道的直接序列扩频系统中,基于恒模算法（CMA）的二级盲接收机能够在只知道期望用户的扩频码以及定时信息的情况下进行自适应联合均衡和多用户检测,具有较好的实时处理性能。但是其第一级检测器的自适应求取采用的是递归最小二乘（RLS）算法,该算法在收敛稳定性等方面具有一系列缺陷,从而对整个算法的性能造成了损害。本文将戴彧虹 袁亚湘自适应步长迭代算法作为第一级检测器的自适应处理方式,并给出了新的方案的完整实现流程。理论和仿真结果显示,经过改进后的二级CMA盲自适应接收机比起原先的算法有着更低的误码率和更高的稳态输出信干比（SINR）,在总体性能上有了很大提高。      

A Multiuser Detection Receiver Using Blind Antenna Array and Adaptive Parallel Interference Cancellation

In this paper, the problem of multiuser detection for synchronous code division multiple access systems in both additive white Gaussian noise and multipath channels is addressed. A new multiuser detection receiver that uses an adaptive blind array along with an adaptive parallel interference canceler is proposed. The replacement of a conventional antenna array with a two-dimensional RAKE receiver is also considered for frequency selective Rayleigh fading channels. By using a constrained optimization criterion along with the gradient-projection algorithm, a blind algorithm for the adaptation of the array response vector is proposed. The new algorithm is superior to a few typical blind algorithms in the literature in terms of both performance and computational complexity. The proposed receiver has the ability to cancel very strong multiple access interference coming from the same direction as the desired signal. Simulation results are presented to show the excellent performance of the proposed combination scheme in comparison to that of using either a multiuser detection or adaptive antenna arrays in a severe near-far situation.     

扩频系统中最小误码率意义下的最优干扰抑制技术

通过论证最小化误码率(MBER),最小均方误差(MMSE)以及约束最小均值输出能量(MMOE)之间的关系,将MBER准则下最优干扰抑制器的设计转化为后两种准则下最优干扰抑制器的设计,并分别导出两种自适应算法:递推最小二乘(RLS)和盲递推最小二乘(BRLS).前者抑制干扰效果好,但需要期望信号;后者无需期望信号,但抑制效果较差.本文将两种算法合理配合,给出了动态环境下的干扰抑制方法.     

基于改进EASI算法的DS-CDMA信息码与伪码盲估计

针对直扩序列码分多址(DS-CDMA)系统多用户检测的问题,提出了一种基于性能指标(PI)变步长EASI算法信息码与伪码盲估计的算法.该算法在比较盲源分离(BSS)和DS-CDMA系统模型的基础上,用自适应的方法估计混合矩阵进而估计出伪码,并利用分离矩阵分离观测信号从而估计出信息码.另外,该算法利用PI值来调整步长,使算法收敛速度和稳定性能达到一个理想平衡点.实验结果显示,该算法具有很好的抗多址干扰(MAI)的能力,伪码和信息码的误码率分别在-10 dB和0 dB时达到10-2以下;对不同用户数,5dB时所有扩频码被完全正确检测的概率几乎都在80％以上.     

Adaptive detection for DS-CDMA

A review of adaptive detection techniques for direct-sequence code division multiple access (CDMA) signals is given. The goal is to improve CDMA system performance and capacity by reducing interference between users. The techniques considered are implementations of multiuser receivers, for which background material is given. Adaptive algorithms improve the feasibility of such receivers. Three main forms of receivers are considered. The minimum mean square error (MMSE) receiver is described and its performance illustrated. Numerous adaptive algorithms can be used to implement the MMSE receiver, including blind techniques, which eliminate the need for training sequences. The adaptive decorrelator can be used to eliminate interference from known interferers, though it is prone to noise enhancement. Multistage and successive interference cancellation techniques reduce interference by cancellation of one detected signal from another. Practical problems and some open research topics are mentioned. These typically relate to the convergence rate and tracking performance of the adaptive algorithm     

直扩系统中基于循环平稳特性的低秩盲自适应抗干扰算法

直扩系统中,频移滤波器可得到比传统线性时不变滤波器更好的抗干扰效果。本文在频移滤波器基础上,在约束MMOE准则下,研究一种低秩盲自适应算法---盲循环多级维纳滤波算法。理论分析和仿真表明,这种算法比同准则下的最小递归二乘算法有更低的复杂度和计算量,并且可以获得相当的抗干扰效果。     

A Stabilized Multichannel Fast RLS Algorithm for Adaptive Transmultiplexer Receivers

The transmultiplexer (TMUX) system has been studied for its application to multicarrier communications. The channel impairments including noise, interference, and distortion draw the need for adaptive reconstruction at the TMUX receiver. Among possible adaptive methods, the recursive least squares (RLS) algorithm is appealing for its good convergence rate and steady state performance. However, higher computational complexity due to the matrix operation is the drawback of utilizing RLS. A fast RLS algorithm used for adaptive signal reconstruction in the TMUX system is developed in this paper. By using the polyphase decomposition method, the adaptive receiver in the TMUX system can be formulated as a multichannel filtering problem, and the fast algorithm is obtained through the block Toeplitz matrix structure of received signals. In addition to the reduction of complexity, simulation results show that the adaptive TMUX receiver has a convergence rate close to that of the standard RLS algorithm and the performance approaches the minimum mean square error solution.     

CDMA2000下行接收技术研究--一种改进的带自适应存储的RLS算法

在下行链路中,接收机必须克服多径衰落等信道环境的负面影响,同时收端只想解调所期望用户的信号,抑制由其他用户引起的干扰,此外接收机也需要较低的运算量.本文对Rake接收和两种次优线性多用户检测（DD和MMSE）算法进行了研究和性能比较.在综合考虑了各种接收算法优缺点的基础上提出了一种改进的带自适应存储的RLS多用户接收算法,并对这种算法做了分析和性能仿真.仿真结果表明在相同指标和减少运算量的情况下,该算法可以得到比次优MMSE算法近2 dB左右的增益,系统的性能得到了提高.