投影近似子空间跟踪算法及其在盲线性多用户检测中的应用

本文针对CDMA系统中的多用户检测,探讨信号子空间作为一种无约束最小化问题的解这一新的解释,在此基础上分析并研究了一种新的跟踪信号子空间的方法PASTd算法。分析表明,通过适当的投影近似,最小化任务简化为众所周知的指数加权最小二乘问题,从而可以运用递归最小二乘(RLS)方法来有效地跟踪信号子空间。该算法的计算复杂度为O(nr)。计算机仿真结果证明了PASTd算法的有效性,从而该算法对于基于子空间的盲线性多用户检测器的实现具有研究和参考意义。     

子空间约束的最小二乘常模算法

常模算法(CMA)是一种性能优良的盲多用户检测算法.最小二乘常模算法(LSCMA)因其全局收敛性和稳定性而备受关注,但是在信噪比低时性能不理想.本文将最小二乘常模算法,紧缩近似投影子空间(PASTd)算法和奇异值分解(SVD)相结合,提出了一种子空间约束的最小二乘常模算法,称为SUB_LSCMA,其复杂度比已有的基于直接对接收信号自相关矩阵做特征值分解(ED)的LSCMA_SUB[6]复杂度低.仿真结果表明这种算法的收敛速度、跟踪性能和误码性能和LSC-MA_SUB基本相同.     

一种基于天线阵列的预处理盲多用户检测算法

该文提出了一种基于天线阵列的预处理判决反馈最小二乘恒模盲多用户检测算法,称为P-DFB-LSCMA算法。它是对天线阵列接收信号经预处理,采用判决反馈最小二乘恒模算法进行多用户检测。仿真结果表明,P-DFB-LSCMA算法比仅采用判决反馈最小二乘恒模算法(DFB-LSCMA)和传统的LSCMA算法性能要好,特别在低信噪比下性能仍优于后二者。     

用于波束形成的最小二乘广义模值算法研究

对用于波束形成的最小二乘广义模值算法(LSGMA)在多种信号环境下的收敛性能进行了分析;在此基础上提出一种新的多用户盲波束形成算法--迭代最小二乘广义模投影(ILSP-GMA)算法,克服LSGMA算法当恒模干扰信号强于所需信号时会错误收敛的缺陷.仿真结果表明该算法可有效适用于多用户情况,并可获得较原迭代最小二乘投影算法(ILSP)更快的收敛速度.     

基于ε逼近算法的CDMA盲自适应多用户检测

把码分多址通信系统的盲多用户信号检测问题转化为一个带约束的二次规划问题，利用二次规划问题的ε逼近算法给出了一种新的CDMA盲自适应多用户检测方法，仿真结果表明，该算法不但具有较强的多址干扰抑制性能，而且具有很快的收敛速度。对于时变信道特别适用。     

空时CDMA多用户信号检测

本文利用最小均方误差(MMSE)和最大似然(ML)准则,推导了空时CDMA多用户检测算法,分析了空时多用户检测与单用户检测的关系,并提出一种空时CDMA多用户检测接收机结构.计算机仿真结果说明了本文提出的空时CDMA多用户检测算法,与单用户检测方法相比其误码性能有相当的改进.     

l0-范数约束的稀疏多径信道RLS常模盲均衡算法

针对稀疏多径信道下MPSK信号的快速盲均衡问题,提出了一种l0-范数约束的递归最小二乘常模盲均衡算法.该算法借鉴传统的递归最小二乘常模盲均衡算法思想,结合稀疏自适应滤波理论,首先利用l0-范数对均衡器抽头系数进行稀疏性约束,构造出一种l0-范数约束的加权最小二乘误差代价函数,然后依据递归最小二乘算法推导出均衡器抽头系数更新公式.该算法发挥递归最小二乘常模算法收敛速度快的优势,并对幅度极小系数附加零点吸引调整,从而实现不同幅度抽头系数的快速收敛.理论分析与仿真结果表明,与现有算法相比,该算法在保证较低剩余符号间干扰的前提下,能有效提高均衡器的收敛速度.     

基于最小二乘恒模算法及子空间方法的盲多用户检测算法

恒模算法（CMA)是一种广泛应用于阵列处理、均衡、多用户检测中的盲算法。最小二乘恒模算法(LSCMA)由于其全局收敛性及稳定性受到关注，但是它在信噪比较低时性能不是很理想。本文将最小二乘恒模算法与子空间方法相结合，提出一种基于子空间分解的恒模算法，称为LSCM_SUB算法。仿真结果表明这种算法的收敛性能比LSCMA要好，尤其是在信噪比低的时候。     

基于最小误码率准则的多载波CDMA系统多用户检测算法

本文介绍了一种将正交频分复用(OFDM)技术和码分多址(CDMA)技术相结合的多载波CDMA (MC-CDMA)系统,分析了MC-CDMA系统的发射端和接收端的结构,建立了MC-CDMA系统的信号模型,详细分析了MC-CDMA中的多址干扰形式,以及针对MC-CDMA系统的多用户检测原理,提出了一种基于最小误码率准则的多用户检测算法。理想的基于最小误码率准则的多用户检测算法在实际中难于实现,本文采用估计概率密度函数的方法,推导出了一种自适应实现的最小误码率多用户检测算法。仿真结果表明,该算法能够有效抑制多址干扰,降低误码率,同时,该算法还具有比基于最小均方误差准则的多用户检测器更低的误码率的优点。      

一种快速递归全局最小二乘算法

针对FIR系统输入和输出信号均被噪声干扰的情况,提出一种快速递归全局最小二乘(XS-RTLS)算法用于迭代计算全局最小二乘解,算法沿着输入数据的符号方向并采用著名的快速增益矢量,搜索约束瑞利商(c-RQ)的最小值得到系统参数估计。算法关于方向更新矢量的内积运算可通过加减运算实现,有效降低了计算复杂度;另外XS-RTLS算法没有进行相关矩阵求逆递归运算,因而具有长期稳定性,算法的全局收敛性通过Laslle不变性原理得到证明。最后通过仿真比较了XS-RTLS算法和递归最小二乘(RLS)算法在非时变系统和时变系统中的性能,验证了XS-RTLS算法的长期稳定性。     

Adaptive space-time feedforward/feedback detection for high datarate CDMA in frequency-selective fading

We investigate linear and nonlinear space-time minimum mean-square-error (MMSE) multiuser detectors for high data rate wireless code-division multiple-access (CDMA) networks. The centralized reverse-link detectors comprise a space-time feedforward filter and a multiuser feedback filter which processes the previously detected symbols of all in-sector users. The feedforward filter processes chip-rate samples from a bank of chip-matched filters which operate on the baseband outputs from an array of antennas. We present an adaptive multiuser recursive least squares (RLS) algorithm which determines the MMSE adjusted filter coefficients with less complexity than individual adaptation for each user. We calculate the outage probabilities and isolate the effects of antenna, diversity, and interference suppression gains for linear and nonlinear filtering and for CDMA systems with varying levels of system control (e.g., timing control, code assignment, cell layout). For eight users transmitting uncoded 2-Mb/s quadrature phase-shift keying with a spreading gain of eight chips per symbol over a fading channel with a multipath delay spread of 1.25 μs, the performance of a three-antenna feedforward/feedback detector was within 1 dB (in signal-to-noise ratio per antenna) of ideal detection in the absence of interference. By training for 10% of a 5-ms frame, RLS adaptation enabled the same detector to suffer less than a 0.5-dB penalty due to the combined effects of imperfect coefficients and error propagation. The advantage of nonlinear feedforward/feedback detection over linear feedforward detection was shown to be significantly larger for a CDMA system with enhanced system control     

Averaged stochastic gradient algorithms for adaptive blindmultiuser detection in DS/CDMA systems

In this paper, we present a blind adaptive gradient (BAG) algorithm for code-aided suppression of multiple-access interference (MAI) and narrow-band interference (NBI) in direct-sequence/code-division multiple-access (DS/CDMA) systems. This BAG algorithm is based on the concept of accelerating the convergence of a stochastic gradient algorithm by averaging. This ingenious concept of averaging was invented by Polyak and Juditsky (1992)-this paper examines its application to blind multiuser detection and NBI suppression in DS/CDMA systems. We prove that BAG has identical convergence and tracking properties to recursive least squares (LMS) but has a computational cost similar to the least mean squares (LMS) algorithm-i.e., an order of magnitude lower computational cost than RLS. Simulations are used to compare our averaged gradient algorithm with the blind LMS and LMS schemes     

A New Algorithm for Optimum Multiuser Detection in Synchronous CDMA Systems

Optimum multiuser detection for Code Division Multiple Access (CDMA) systems requires the solution of an NP-hard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In order to reduce the complexity of the optimum multiuser detection, we propose a Reduced Complexity Maximum Likelihood (RCML) algorithm that includes a set of novel certain boundary rules and characteristics. We investigate the performance and complexity tradeoffs for the RCML algorithm by conducting a set of simulations; Maximum Likelihood (ML) detection as a reference for performance comparisons, and relaxation based Semidefinite Programming (SDPB) algorithm as a reference for complexity comparisons. We show that the RCML algorithm is a promising algorithm for its computational savings over relaxation based algorithms in lightly-to-moderately loaded CDMA systems, and for its optimality in highly loaded CDMA systems.     

Blind adaptive multiuser detection for asynchronous dual-rateDS/CDMA systems

In this paper, the authors consider an asynchronous direct-sequence code division multiple access (DS/CDMA) system wherein users are allowed to transmit their symbols at one out of two available data rates. Three possible access schemes are considered, namely, the variable spreading length (VSL), the variable chip rate (VCR), and the variable chip rate with frequency shift (VCRFS) formats. Their performance is compared for the case that a linear one-shot multiuser receiver is employed. It is also shown that detection of the users transmitting at the higher rate requires a periodically time-varying processing of the observables. Moreover, the problem of blind adaptive receiver implementation is studied, and a cyclic blind recursive-least-squares (RLS) algorithm is provided which is capable of converging to the periodically time-varying high-rate users detection structure. Numerical results show that the proposed receivers are near-far resistant, and that the VCRFS access technique achieves the best performance. Finally as to the adaptive blind receiver implementation, computer simulations have revealed that the cyclic RLS algorithm for blind adaptive high-rate users demodulation outperforms the conventional RLS algorithm in most cases of primary importance     

Code-aided interference suppression for DS/CDMA communications. II.Parallel blind adaptive implementations

For pt.I see ibid., vol.45, no.9, p.1101-11 (1997). An adaptive code-aided technique for the simultaneous suppression of narrow-band interference (NBI) and multiple-access interference (MAI) in direct-sequence code-division multiple-access (DS/CDMA) networks is proposed. This technique is based on the recursive least-squares (RLS) version of the minimum mean-square error (MMSE) algorithm for multiuser detection. The convergence dynamics of the RLS blind adaptive algorithm for suppressing the combined NBI and MAI are analyzed. The steady-state performance of this algorithm in terms of the signal-to-interference ratio (SIR) is also derived. Systolic array structures for parallel implementations of the RLS adaptive interference suppression algorithms are then proposed. Versions of the rotation-based QR-RLS algorithms for both the blind adaptation mode and the decision-directed adaptation mode are derived. These algorithms exhibit high degrees of parallelism, and can be mapped to VLSI systolic arrays to exploit massively parallel signal processing computation     

Population Declining Ant Colony Optimization Multiuser Detection in Asynchronous CDMA Communications

In this paper we present a population declining ant colony optimization (PDACO) multiuser detector for asynchronous CDMA communications. Ant colony optimization (ACO) algorithms have already been used in multiuser detection in CDMA systems; however, as the pheromone accumulates, we may not get a global optimum because it stops searching early. PDACO can enlarge searching range through increasing the initial population of the ant colony, and the population declines in successive iterations. So, the performance of PDACO is superior with the same computational complexity. PDACO is applied to multiuser detection in asynchronous CDMA systems over slowly multipath Rayleigh-fading channels in this paper. Via computer simulations it is shown that the performance of PDACO detector is much better in bit-error rate and near-far effect resistance than conventional detector, ACO detector and genetic algorithm detector, and is close the optimal multiuser detector.     

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     

准同步DS-CDMA多用户检测算法

实际应用中的DS-CDMA系统,用户之间的传输时延控制在一定范围内。该文针对这一应用特点,着重研究准同步DS-CDMA多用户检测算法。通过降低部分相关矩阵的阶数,降低系统复杂度。然后对准同步DS-CDMA多用户检测算法进行分析,并仿真给出数值结果,证明其具有一定的抗频偏能力,以及误码性能优于传统CDMA系统性能。     

基于免疫应答的RBF网络在动态多用户检测中的应用

径向基函数神经网络是一种具有局部逼近能力的前向神经网络,可用作码分多址中的多用户检测器,有较好的检测性能;但是目前的RBF网络多用户检测器收敛慢,不能针对实时变化的动态信道作跟踪.针对动态信道中的多用户检测问题,借鉴免疫系统二次应答原理提出了一种基于免疫机制的RBF网络.该方法结合免疫记忆机制和免疫应答机制设计免疫算子,针对动态模型中的稳定部分和突变部分作不同强度的训练;借鉴免疫系统的二次应答机制,较大地降低了算法复杂度,并且收敛快、鲁棒性强,提高了在变化的信道中的多用户检测器的动态追踪能力.     

基于混沌寻优的CDMA最佳多用户检测方法

混沌运动广泛存在于非线性系统中,它具有遍历性与随机性等优良性质,且在某个域内不可重复的走向每个状态.本文利用混沌的这些优良品质提出了实现码分多址(CDMA)系统上最佳多用户检测的一种混沌寻优方法.计算机模拟表明我们提出的算法具有能克服多址干扰,能寻优到全局极小点,以及能抑制噪声干扰等优点,这为研究CDMA系统上的最佳多用户检测器开辟了一条新的途径.