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

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

基于子空间盲多用户检测算法的设计和仿真

随着数字移动通信技术的飞速发展,以码分多址(CDMA)为核心的第三代移动通信(3G)技术已经走入人们的日常生活。CDMA系统具有容量大、软容量、抗多径衰落强等优点,但多址干扰(MAI)的存在却严重的影响了系统的性能和容量,因此如何消除和抑制这种干扰就成了CDMA技术研究的热门话题之一,第三代移动通信系统已经将多用户检测技术(MUD)作为克服多址干扰的有效方法之一。文中主要研究了直接序列扩频码分多址(DS-CDMA)系统中的盲多用户检测算法,深入的研究了基于卡尔曼滤波的盲多用户检测算法,通过在卡尔曼滤波算法上引入子空间提高了原有卡尔曼滤波算法的效率。     

多径衰落信道中一种新的基于CMA的盲多用户检测算法

该文基于 CLSCMA算法提出了一种新的盲自适应多用户检测算法,这种算法适用于多径衰落信道。这种多用户检测算法能很好抵消多址干扰和克服多径衰落,算法的收敛性能和子空间自适应多用户检测算法相当,而稳态性能稍强于子空间多用户检测算法。因而是一种优秀的盲自适应多用户检测算法,具有一定的应用和研究价值。     

MIMO系统中基于干扰子空间投影的盲空时多用户检测算法

该文针对多天线码分多址系统,提出了一种盲空时多用户检测算法。该算法结合空域、时域二维信息,利用Alamouti空时分组码与MIMO信道的结构特征,通过跟踪干扰子空间对多天线信道进行估计。在此基础上,通过将接收信号投影到干扰子空间的正交补空间上,实现了抑制多址干扰的空时多用户检测。该算法不仅能够自适应地跟踪信道的变化,且具有较低的算法复杂度。仿真结果表明该算法能够有效地抑制多天线码分多址系统中的多址干扰,改善系统的性能。     

一种基于子空间的盲多用户检测算法分析

多用户检测技术是扩频通信中解决多址干扰问题的一种重要技术。介绍了基于子空间盲多用户检测的原理。通过空间分解得到信号子空间,利用信号子空间的特征值和特征向量得到解相关多用户检测器,分析了其性能,并通过仿真证明其在有效性、抗远近效应等方面都较理想,是一种很有前途的多用户检测方法。     

逼近幂迭代子空间跟踪算法在多用户系统中的应用研究

本文将基于逼近幂迭代的子空间跟踪算法应用于多用户系统中.该算法利用适当的补偿矩阵逼近经典幂迭代子空间跟踪方法,在不增加计算复杂度的基础上保证了算法的全局收敛.将该算法应用于波达方向(DOA)估计及盲多用户检测系统中,利用接收的数据矢量估计信号子空间,进而可得到DOA的精确估计及检测器的权向量.仿真验证了算法在多用户系统中的有效性.     

MIMO系统中一种子空间追踪的盲空时多用户检测方法

文章提出在空时分组编码的MIMO系统中利用OPAST这种子空问追踪算法进行盲空时多用户检测.仿真结果表明,这种子空间追踪算法可以联合实现平坦瑞利衰落信道估计和空时多用户检测.针对不同的空时分组编码的MIMO通信系统模型,这种盲自适应空时多用户检测方法可以抵抗严重的远近效应和抑制多址干扰,并具有很好的动态跟踪能力.     

一种联合均衡和多用户检测的SDCMA盲算法

该文提出了用于MC DS-CDMA系统中的两种SDCMA(最陡下降常模算法)盲检测方法,一种是SDCMA盲均衡算法,在此基础上,提出了另一种联合均衡和多用户检测的SDCMA盲算法。同时还将这两种算法与基于子空间的MMSE(最小均方误差)盲检测算法进行比较。仿真结果表明,这两种SDCMA算法的BER(误比特率)性能均优于子空间法,而且联合均衡和多用户检测的SDCMA盲算法利用同时对均衡权值向量和多用户检测器向量进行自适应更新,能较大程度地改善系统性能,是这3种盲算法中性能最佳的一个。     

基于子空间跟踪的盲MMSE多用户检测算法

在深入研究子空间方法盲多用户检测器子空间跟踪算法的基础上,针对OPAST算法中矩阵Z(i)的迭代运算过程导致子空间跟踪算法发散的问题,提出一种改进算法--newOPAST算法,并应用于盲MMSE多用户检测器中.仿真结果表明,该算法具有稳定的全局收敛性,并保持了较低的算法复杂度,而其输出信噪比和误码率性能接近高算法复杂度的经典算法.     

异步DS-CDMA系统盲空时信道估计及多用户检测

该文提出了适用于频率选择性瑞利衰落信道中的异步DS-CDMA系统盲空时信道估计及多用户检测算法。通过研究多径信号码空间和数据矢量空间,采用噪声子空间技术进行异步DS-CDMA系统盲空时信道参数估计,同时利用了多径传播和接收机同步失调的特性,以利于把盲线性滤波优化技术应用于稳健的干扰抑制。使用一种修改的ULV更新算法进行噪声子空间跟踪,该算法不需要相关矩阵的秩估计,直接估计噪声子空间,不进行信号子空间跟踪。并且研究了线性约束最小方差(LCMV)盲空时多用户检测及其基于Householder变换约束最小均方算法(HCLMS)的自适应实现。仿真结果验证了该文算法的有效性。     

基于Kalman滤波的盲多用户检测算法

盲多用户检测技术是第三代移动通信的关键技术,本文仿真分析了DS-CDMA通信系统中盲多用户检测的Kalman滤波算法的性能.并且将子空间算法和Kalman滤波算法进行结合,使得盲多用户检测的Kalman滤波算法的计算量大大降低.     

Multi-input multi-output fading channel tracking and equalizationusing Kalman estimation

This paper addresses the problem of channel tracking and equalization for multi-input multi-output (MIMO) time-varying frequency-selective channels. These channels model the effects of inter-symbol interference (ISI), co-channel interference (CCI), and noise. A low-order autoregressive model approximates the MIMO channel variation and facilitates tracking via a Kalman filter. Hard decisions to aid Kalman tracking come from a MIMO finite-length minimum-mean-squared-error decision-feedback equalizer (MMSE-DFE), which performs the equalization task. Since the optimum DFE for a wide range of channels produces decisions with a delay Δ > 0, the Kalman filter tracks the channel with a delay. A channel prediction module bridges the time gap between the channel estimates produced by the Kalman filter and those needed for the DFE adaptation. The proposed algorithm offers good tracking behavior for multiuser fading ISI channels at the expense of higher complexity than conventional adaptive algorithms. Applications include synchronous multiuser detection of independent transmitters, as well as coordinated transmission through many transmitter/receiver antennas, for increased data rate     

多站无源跟踪边缘化卡尔曼滤波算法

多站无源跟踪量测方程非线性强,对跟踪算法的稳定性及精度提出了更高的要求。为实现稳定高精度跟踪,提出了新的基于边缘化卡尔曼滤波（MKF）的多机无源跟踪算法。该算法将非线性的量测方程表示为p阶Hermite多项式的加权和,将加权矩阵的先验分布建模为高斯过程,求得其后验分布后对其进行积分来消除加权矩阵的影响,最终可得对状态及其协方差矩阵估计的闭式解。以只测角跟踪为例对所提算法性能进行验证,仿真结果表明,相对于扩展卡尔曼滤波（EKF）算法、不敏卡尔曼滤波（UKF）算法及容积卡尔曼滤波（CKF）算法,所提算法具有更好的跟踪性能。      

An asynchronous multiuser CDMA detector based on the Kalman filter

We introduce a multiuser receiver based on the Kalman filter, which can be used for joint symbol detection and channel estimation. The proposed algorithm has the advantage of working even when the spreading codes used have a period larger than one symbol interval (“long codes”), unlike adaptive equalizer-type detectors. Simulation results which demonstrate the performance advantage of the proposed receiver over the conventional detector, the minimum mean squared error (MMSE) detector and a recursive least squares (RLS) multiuser detector are presented. A thorough comparison of the MMSE detector and the proposed detector is attempted because the Kalman filter also solves the MMSE parameter estimation problem, and it is concluded that, because the state space model assumed by the Kalman filter fits the code division multiple access (CDMA) system exactly, a multiuser detector based on the Kalman filter must necessarily perform better than a nonrecursive, finite-length MMSE detector. The computational complexity of the detector and its use in channel estimation are also studied     

An efficient PASTd-algorithm implementation for multiple directionof arrival tracking

We propose a simple direction-of-arrival (DOA) tracking scheme involving the projection approximation subspace tracking with deflation (PASTd)-algorithm and a Kalman filter. The DOAs are obtained via a Newton-type method initialized with the DOAs predicted by the Kalman filter. The data association is then avoided. The tracking capability of the proposed algorithm is demonstrated by computer simulations in scenarios involving targets with crossing trajectories     

An adaptive asynchronous CDMA multiuser detector forfrequency-selective Rayleigh fading channels

An adaptive asynchronous code-division multiple-access (CDMA) multiuser detector is proposed that uses a recently derived extended Kalman filter based algorithm (see Lim, T.J. and Rasmussen, L.K., IEEE Trans. Commun., vol.45, p.213-20, 1997) to perform joint data detection and parameter tracking in frequency-selective Rayleigh fading channels. A receiver structure based on this adaptive multiuser detector is presented and its performance in terms of parameter tracking and bit error rate (BER) is investigated. The receiver is a form of an adaptive RAKE that exploits multipaths to achieve performance gain     

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.     

Blind Adaptive Multiuser Detection for the MC‐CDMA Systems Using Orthogonalized Subspace Tracking

In this paper, we study the performance of subspace‐based multiuser detection techniques for multicarrier code‐division multiple access (MC‐CDMA) systems. We propose an improvement in the PASTd algorithm by cascading it with the classical Gram‐Schmidt procedure to orthonormalize the eigenvectors after their sequential extraction. The tracking of signal subspace using this algorithm, which we call OPASTd, has a faster convergence as the eigenvectors are orthonormalized at each discrete time sample. This improved PASTd algorithm is then used to implement the subspace blind adaptive multiuser detection for MC‐CDMA. We also show that, for multiuser detection, the complexity of the proposed scheme is lower than that of many other orthogonalization schemes found in the literature. Extensive simulation results are presented and discussed to demonstrate the performance of the proposed scheme.     

基于子空间的线性约束最小二乘恒模算法

线性约束最小二乘恒模算法能够有效克服恒模算法中存在的干扰捕获问题,然而,在实际的系统中,由于受到来自噪声子空间分量的影响,从而导致性能下降。针对这一问题,该文提出了一种基于子空间方法的线性约束最小二乘恒模(SLSCM)多用户检测算法并对其性能进行了理论分析。该算法收敛速度快,信道跟踪能力强,有较好的输出信干噪比和误码率性能。理论分析和仿真实验验证了该文算法的有效性和优越性。     

The Subspace-Based Linear Conjugate CMA in BPSK-Modulated MC-CDMA Systems

A subspace-based linear conjugate constant modulus algorithm (CMA) for blind adaptive multiuser detection in BPSK-Modulated MC-CDMA systems is proposed. First, a linear conjugate CMA algorithm is presented which jointly elaborates the received signal and its complex conjugate to utilize the information contained in the pseudo-autocorrelation of the observable, thus is capable of achieving much better performance. Second, to further improve the performance, the subspace method is applied to the linear conjugate CMA algorithm to obtain a subspace-based linear conjugate CMA algorithm, which mitigates the influence of the noise subspace. Finally, an improved projection approximation subspace tracking with deflation algorithm is proposed for adaptive signal subspace estimation to reduce the computational complexity. The proposed algorithm provides an improved robustness against the signature waveform mismatch, good tracking capability in dynamic environment and better output signal-to-interference-plus-noise-ratio and bit error rate performance. The superiority of the proposed algorithm is demonstrated through computer simulations.