DS-CDMA通信系统中基于独立分量分析的盲多用户检测

本文研究了直接序列扩频码分多址(DS-CDMA)通信系统的多用户检测问题,提出了基于独立分量分析(ICA)方法的盲多用户检测算法,实现多用户信号的盲检测。该方法不需知道用户的扩频码就可完成多用户信号的盲检测。仿真结果验证了本文提出的方法的优良性能。     

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

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

基于瞬时混合结构的盲多用户检测

提出一种用于MIMO-OFDM系统中的盲多用户检测方法.基本思想是将现有的盲信源分离算法(BSS)应用到MIMO-OFDM系统的信号检测中.该算法从MIMO-OFDM系统中的频点角度出发,解决了BSS算法在存在时延的系统中的应用问题以及由于被分离后的信号重组而带来的不确定置换和通信系统中的复值信号性质所引发不确定的尺度变化问题.方法的有效性已通过计算机仿真得以验证.     

一种分数低阶统计量广义恒模盲多用户检测算法

针对实际盲多用户检测系统中存在的大量噪声呈现非高斯性,而这种非高斯性使基于高斯噪声假定下的恒模盲多用户检测算法的性能显著退化甚至不能正常工作,本文提出了一种分数低阶统计量的广义恒模盲多用户检测算法.该算法是分数低阶统计量恒模算法的推广,能有效地应对非高斯噪声的影响,具有广泛的适用性.通过以DS-CMDA系统为例,将分数低阶统计量广义恒模肓多用户检测算法与传统恒模盲多用户检测算法(CMA)、分数低阶统计量恒模盲多用户检测算法(FLOS-CMA)进行了对比,实验仿真结果表明:无论在高斯白噪声下还是在α稳定分布噪声下,分数低阶统计量广义恒模盲多用户检测算法均具有良好的抗多址干扰和抑制噪声的性能,并且该算法具有更快的收敛速度.     

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

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

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

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

基于独立分量分析的多天线空时盲接收方案

将独立分量分析(ICA)技术应用于无线通信环境中,通过分析空时分组码(STBC)和垂直-贝尔实验室分层空时(V-BLAST)的本质结构,建立了多种适用于ICA的特定通信系统模型,并以此实现了对发射信号的盲检测,从而代替了基于信道估计的传统接收方法.理论分析表明,ICA盲接收技术的应用可以有效提高系统对信道估计错误的顽健性和系统设计的灵活性.仿真结果验证了所提方案的有效性,并对算法实现的复杂度和收敛特性进行了分析.     

基于盲源分离的CDMA系统信息码与扩频码盲估计

针对码分多(CDMA)系统盲多用户检测问题,提出了一种基于盲源分离(BSS)的信息码盲检测与扩频码盲估计算法.该算法在对CDMA系统进行多用户检测的过程中,不仅不需要知道用户的扩频码,同时利用最小均方误差(MMSE) 则还可以盲估计出不同用户的扩频码序列.仿真结果证明该算法有较大的实用价值.     

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

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

半盲最小二乘恒模算法研究

恒模算法(CMA)是一种广泛应用于阵列处理、均衡、多用户检测中的盲算法.最小二乘恒模算法(LSCMA)由于其全局收敛性及稳定性受到关注.本文针对CDMA系统下行链路,基站知道小区内用户码字而小区外干扰用户码字未知的情形,提出一种适用的半盲LSCM多用户检测(MuD)算法.它将非盲多用户检测(本文中选用解相关MUD)与盲多用户检测技术(本文中选用LSCM检测器)相结合,首先根据小区内已知用户的信息,利用解相关MUD抵消小区内其它用户的干扰,接着利用LSCM算法抵消剩余的干扰.文中将SB-LSCM算法与已经提出的半盲解相关算法、LSCM算法和解相关算法进行了复杂度、SIR和BER性能的比较,并对SB-LSCM算法的SIR性能进行了理论分析.仿真结果表明SB-LSCM算法能够获得与半盲解相关相当的SIR的性能,但是其复杂度更低且在系统负荷大时能够获得优于半盲解相关算法的BER性能.另外,SB-SLCM算法能够获得较LSCM算法更快的收敛速度以及更加优良的性能.     

Fixed-point blind adaptive multiuser detection algorithm for IR UWB systems in multipath channel

Using the hypothesis that data transmitted by different users are statistically independent of each other, this paper proposes a fixed-point blind adaptive multiuser detection algorithm for Time-Hopping (TH) Impulse Radio (IR) Ultra Wide Band (UWB) systems in multipath channel, which is based on Inde-pendent Component Analysis (ICA) idea. The proposed algorithm employs maximizing negentropy criterion to separate the data packets of different users. Then the user characteristic sequences are utilized to identify the data packet order of the desired user. This algorithm only needs the desired user’s characteristic se-quence instead of channel information, power information and time-hoping code of any user. Due to using hypothesis of statistical independence among users, the proposed algorithm has the outstanding Bit Error Rate (BER) performance and the excellent ability of near-far resistance. Simulation results demonstrate that this algorithm has the performance close to that of Maximum-Likelihood (ML) algorithm and is a subopti-mum blind adaptive multiuser detection algorithm of excellent near-far resistance and low complexity.     

Blind Multiuser Detection in Frequency Domain for MC-CDMA Systems Using Particle Swarm Optimization

In digital communication systems, the constant modulus algorithm (CMA) for blind multiuser detector has some disadvantage such as slow convergence speed and weight phase rotation. In this paper, we put forward a novel receiver, which combines CMA blind adaptive multiuser detection and particle swarm optimization (PSO) technique in frequency domain for multi-carrier direct sequence code division multiple access (MC DS-CDMA) systems. By this approach we present an adaptive multistage structure based on PSO technique. In this structure, the weights are obtained by PSO technique between the received signal and its estimate through a CMA. The resulting weights contain reliability information for the hard decisions made in the previous stage. The simulation results show that BER performance of the PSO-based CMA blind multiuser detector is superior to that of steepest decreasing constant modulus algorithm (SDCMA), linearly constrained constant modulus algorithm (LCCMA), CMA based multiuser detection and is worthy due to its significant detection performance to achieve desirable improvement in convergence speed and tractability.     

基于LMK准则的盲自适应多用户检测器

 本文提出了一种加性高斯白噪声(AWGN)信道下,同步直扩码分多址(DS/CDMA)系统的基于LMK(最小平均峰度,Least Mean Kurtosis)准则的线性盲自适应多用户检测器.这种检测器的算法是一种具有较低计算量的基于高阶统计量的算法.分析证明了这种检测器的算法的收敛性和可以实现多用户信号的盲解相关.并对基于该准则的线性盲自适应检测器和基于LMS(最小均方,Least Mean Square)准则的检测器的收敛性能进行了仿真比较.     

MUI-free receiver for a synchronous DS-CDMA system based on blockspreading in the presence of frequency-selective fading

We discuss a synchronous direct-sequence code division multiple-access (DS-CDMA) system based on block spreading in the presence of frequency-selective fading. Note that block spreading, which is also known as chip interleaving, refers to a spreading of a data block sequence, which is obtained by dividing a data symbol sequence into consecutive blocks. For such a system, we develop a simple new receiver that completely removes the multiuser interference (MUI) without using any channel information. The MUI-free operation is obtained by the use of a shift-orthogonal set of code sequences on which this receiver is based. Within the framework of the MUI-free receiver, we further present a subspace deterministic blind single-user channel estimation algorithm. As a benchmark for the MUI-free receiver and the corresponding subspace deterministic blind single-user channel estimation algorithm, we consider the linear multiuser equalizer and the corresponding subspace deterministic blind multiuser channel estimation algorithm developed by Liu and Xu (1996) for a standard synchronous DS-CDMA system in the presence of frequency-selective fading. We show that the complexity of the MUI-free receiver using the corresponding subspace deterministic blind single-user channel estimation algorithm is much smaller than the complexity of the linear multiuser equalizer using the corresponding subspace deterministic blind multiuser channel estimation algorithm. We further show that the performance of the MUI-free receiver is comparable with the performance of the linear multiuser equalizer. This is for the case in which the channels are known as well as for the case in which the channels are estimated with the corresponding subspace deterministic blind channel estimation algorithm     

一种粒子滤波的盲多用户检测快速算法

该文在时间观察状态空间模型基础上,针对粒子滤波计算复杂的问题,构造了一种在同步快变平衰落信道下计算复杂度低的粒子滤波的DS-CDMA盲多用户检测快速算法。该算法通过对超过门限数目的粒子分类,以不同类别粒子的概率差值作为粒子滤波所需粒子数目是否足够的判断准则,自动调节不同情况下所需的粒子数目,并对不同类别粒子概率差值下盲多用户检测性能进行分析。仿真结果表明,该文算法可以在保证盲多用户检测性能的前提下有效地降低运算复杂度,且检测性能与概率差值成正比。     

基于子空间跟踪算法的盲多用户检测技术研究

本文提出一种基于压缩投影逼近子空间跟踪(PASTd)算法与Kalman滤波算法相结合的盲自适应多用户检测算法.基于本算法,仅使用期望用户的特征波形和定时信息,多用户检测器可以盲获得.仿真实验表明,在多径非频率选择性衰落信道和用户数目变化的动态环境中,本文提出的盲多用户检测算法虽然在计算量上较LMS算法略为提高,但其收敛性能却优于后者,与RLS算法和Kalman滤波算法相比,本文提出的算法具有更低的计算复杂度和更优的收敛性能.     

多径衰落信道下的一种盲多用户检测方法

多径衰落信道下的盲自适应多用户检测算法的运算复杂度通常都比较大,提出了一种基于MSWF和CMA的盲自适应多用户检测方法,该方法避免了矩阵求逆和信道估计运算,具有相对较小的运算复杂度。通过模拟实验比较了几种算法的误码率性能,结果表明,所提方法具有明显的优势。     

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

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

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.