一种基于ML淮则的地频率选择性多径衰落的多用户检测算法

本文采用ＭＬ准则得出了适于频率选择性衰落的线性解相关算法。仿真表明本方法性能优于Ｚｖｏｎａｒｒ提出的先解相关再最大比值合并的算法；且该方法由于采用等价扩频序列实现，硬件耗费也较少。     

导频辅助MC-CDMA系统的解相关干扰消除多用户检测器

我们提出了一种新的基于导频辅助的MC-CDMA系统的信道估计和解相关、解相关干扰消除检测器。这里的基于导频辅助的MC-CDMA系统的信道估计采用了一种新的算法．通过设计每个用户的导频信息．无需增加系统的过多负担,就可以实现较好的信道估计。解相关检测器采用了伪逆算法,解相关干扰消除检测器则用解相关检测器的输出作为一级输入,结合并行干扰消除算法。仿真结果显示了信道估计和多用户检测器的较好性能。     

基于解相干的MUSIC算法估计性能分析

MUSIC算法作为DOA估计的经典算法,在处理高度相关的信号时,算法性能急剧下降甚至完全失效。为了正确地估计出相干信号的DOA,就必须要对相干信号进行解相干。采用前／后向空间平滑技术与修正MUSIC算法是两种估计相关信号DOA的有效方法。通过算法仿真实验,证明了理论的正确性。     

一种变步长解相关NLMP快速算法

提出了一种在α稳定分布信号条件下能快速稳定收敛的变步长、解相关NLMP(VSDNLMP)算法.根据输入信号的相关性原理,提出基于P阶分数相关的解相关方法,改进NLMP算法的更新方向向量,提高算法的收敛速度;同时采用变步长因子进一步提高NLMP算法性能.在高斯和非高斯α稳定分布有色信号环境下的仿真结果表明:在强相关信号条件下,VSDNLMP算法性能明显优于NLMP算法;VSDNLMP算法的收敛速度和稳态失调都较之NLMP算法有较大的改善;该文算法具有良好的鲁棒性.     

Burg算法与自相关在科氏流量计中的应用

传统科氏流量计信号处理采用DFT谱分析方法,对数据进行加窗处理,导致谱分辨率降低。为提高谱分辨率,将Burg算法引入科氏流量计频率解算,无需对窗口之外数据进行假设。为解决信号初相以及噪声干扰对谱分辨率的影响,对Burg算法进行了分析并改进,引入了自相关算法。在此建立了科氏流量计的信号模型,采用Matlab对本算法进行仿真验证,结果表明该算法的解算精度优于一般流量计的要求,算法可以用于科氏流量计频率解算。     

低复杂度的QR解相关多用户检测算法

针对常规解相关多用户检测算法因对相关矩阵求逆的运算量随用户数增加呈指数增加而失去了实用价值,提出了不需对相关阵求逆的计算复杂度低的快速QR解相关多用户检测算法。该快速算法运算量与常规解相关算法相比,运算量减少了70％,而检测性能丝毫没有降低。显然,该算法优于常规算法,具有实用意义。     

基于互质阵列的相干与非相干目标DOA估计算法

提出基于互质阵列的相干与非相干混合目标空间达波方向(DOA)估计算法。首先,基于差协同阵等效的概念,将互质阵列相关矩阵的元素重排形成增广相关矩阵;然后采用矩阵重构对增广相关矩阵进行解相关处理;最后,对解相关的增广相关矩阵进行多重信号分类(MUSIC)空间谱搜索,实现对目标的DOA估计。仿真结果表明,该算法可实现对数目多于互质阵列物理阵元的相干与非相干混合目标的DOA估计。对比矩阵重构、前向空间平滑和前后向空间平滑3种解相关算法,矩阵重构解相关获得了更大的可分辨目标数目,在低信噪比(SNR)下呈现出更佳的估计误差性能,而空间平滑解相关在低快拍情况下具备更优的估计误差性能。     

一种改进的相关干涉仪测向算法

针对多阵元相位干涉仪测向过程中的解模糊概率问题,在相位差误差条件下建立了解模糊概率与基线长度比之间的关系,给出一种相关干涉仪基线设计方法,并研究了相关干涉仪的解模糊条件;提出一种改进的相关干涉仪算法,缩小了相关干涉仪的取值范围,优化了相关函数,该方法最大程度地利用了干涉仪孔径尺寸,保证了测向精度,提升了运算速度,同时具有更强的解模糊稳定性.仿真试验表明,改进的相关干涉仪算法有效可行.     

CDMA系统中半盲恒模算法的性能分析

本文对应用于CDMA上行链路多用户检测中半盲恒模算法的收敛性能、SIR性能和复杂度进行了深入研究。我们在无噪环境下分析了半盲恒模算法全局收敛的条件;通过算法SIR性能的分析,可知半盲算法可以获得更加优良的抵消MAI的能力;通过半盲恒模算法、盲恒模算法、解相关算法的复杂度比较,可知半盲恒模算法以略高于解相关算法复杂度的代价获得优于解相关算法和恒模算法的SIR性能和BER性能。     

基于小波变换的加权最小二乘相位解缠算法

提出了一种求解加权最小二乘相位解缠问题的新算法,采用相位导数方差相关图定义了相位数据的初始权重,给出了利用多分辨率小波变换进行相位解缠的具体实现方法.利用离散小波变换,将原线性系统转化成具有较好收敛条件的等价新系统,通过独立求解新系统中的低频部分,加快了系统的收敛速度.仿真实验表明:该算法具有收敛速度快、解缠效果好等特点.     

Preselection-type coherent decorrelating detector for asynchronous DS-CDMA

A new multiuser coherent decorrelating detector is proposed for the reverse-link asynchronous channels of DS-CDMA. The main feature of the proposed scheme is that it selects the largest interferences to be decorrelated, using the received power of the users and the crosscorrelation between the users. The proposed preselection-type coherent decorrelating detector offers better bit error rate (BER) performance than the conventional decorrelating detector, especially when the number of the received signals swamps the processing gain     

一种自适应分布式多用户检测算法

本文针对移动CDMA加性白高斯噪声和衰落信道 ,提出了一种自适应分布式多用户检测算法 .它由空间分集和解相关检测复合组成 .解相关检测器的性能近似最佳多用户检测器 ,且不依赖于其它用户的信号能量及衰落特性 .基于随机梯度技术的盲自适应分集合并方案由最佳似然比检验准则构成 .对其性能做了理论分析和数值估计 ,并与传统的选择法、等增益法及最大比值法做了比较 .所提出的方法易于实时实现 ,可以较大地提高接收机性能和系统容量增益     

Edge decision assisted decorrelators for asynchronous CDMA channels

Asynchronous decorrelating detector is a linear multiuser detector in code-division multiple-access (CDMA) environment. It has relatively good performance and low-computational complexity. However, the ideal asynchronous decorrelating detector requires the observation of the entire input bit sequence. Implementation of this ideal detector based on a long bit sequence results in long delays and high computational complexity. In fact, if the observed window does not cover the entire data sequence, the classical asynchronous decorrelating detector is no longer near-far resistant. In this paper, we propose a method using initial decisions on bits for both edges of the finite observed window. These initial decisions are used to assist subsequent decisions of the whole sequence inside the observed window based on the decorrelating method. This new edge decision assisted decorrelator (EDAD) method is shown to be near-far resistant     

Linear Interference Cancellation of Asynchronous CDMA Systems by Preconditioned CG Method

It is well known that the iterative method is used for solving a set of linear equations corresponding to linear interference cancellation structures. An ideal computation of the decorrelating or the linear minimum mean-squared-error (LMMSE) detector requires order K ³ flops, where K is the number of users. To alleviate the computational complexity, iterative decorrelating and the LMMSE detectors are proposed. In this paper, the symmetric successive over relaxation (SSOR) preconditioning scheme is applied to the conjugate gradient (CG) method. The performance of the detectors is investigated and it is found that the SSOR preconditioned CG (PCG) method can provide significantly faster convergence than CG method.     

一种频率选择性衰落信道下的盲自适应去相关Rake接收机

多用户检测是DS－CDMA系统中的一项关键技术,而Rake接收是解决多径效应的一种有效方法,本文将基于Kalman滤波的多用户检测器与Rake接收相结合,提出了一种频率选择性衰落信道下的盲自适应去相关Rake接收机,研究结果表明,这种接收机具有较强的抑制多址干扰和克服“远－近”效应能力,并且能快速收敛。     

SSOR preconditioned CG method for the linear interference cancellation of asynchronous CDMA systems

An ideal computation of the decorrelating or the linear minimum mean-squared-error (LMMSE) detector requires computational complexity of order K ³ when there K is the number of users. To alleviate the computational complexity, iterative decorrelating and LMMSE detectors are proposed for solving a set of linear equations corresponding to linear interference cancellation structures. Iterative conjugate gradient (CG) method has been used for the linear interference cancellation detectors. Its main advantages are to reduce the order of computation complexity and their suitability to highly parallel implementations. In this paper, the symmetric successive overrelaxation (SSOR) preconditioning scheme is applied to the CG method. The performance of the detectors is investigated and it is found that the SSOR preconditioned CG method can provide significantly faster convergence than CG method.     

Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound

A fast optimal algorithm based on the branch-and-bound (BBD) method is proposed for the joint detection of binary symbols of K users in a synchronous code-division multiple-access channel with Gaussian noise. Relationships between the proposed algorithms (depth-first BBD and fast BBD) and both the decorrelating decision-feedback (DF) detector and sphere-decoding algorithm are clearly drawn. It turns out that decorrelating DF detector corresponds to a "one-pass" depth-first BBD; sphere decoding is, in fact, a type of depth-first BBD, but one that can be improved considerably via tight upper bounds and user ordering, as in the fast BBD. A fast "any-time" suboptimal algorithm is also available by simply picking the "current-best" solution in the BBD method. Theoretical results are given on the computational complexity and the performance of the "current-best" suboptimal solution.     

Performance of a Multiuser Detector with Multicarrier Transmission for a DS/CDMA System

In this paper, a new multiuser detector combining decorrelating detector and multicarrier transmission scheme is proposed and analyzed in a frequency selective Rayleigh fading channel. The bit error probability and asymptotic multiuser efficiency are derived as performance measures. From numerical results, it is shown that the proposed detector achieves better BER performance and lower computational complexity compared to a conventional decorrelating detector. It is also shown that the proposed detector is robust to partial narrowband interference, and alleviates near-far problem effectively. The results in this paper can be applied to design of a wideband CDMA system.     

A spatial-temporal decorrelating receiver for CDMA systems withbase-station antenna arrays

We investigate multiuser signal detection with a base-station antenna array for a synchronous DS-CDMA uplink using nonorthogonal codes in Rayleigh fading channels. We have developed a new formulation for a spatial-temporal decorrelating detector using the maximum-likelihood criteria. The detector is shown to be near-far resistant. We propose to implement the spatial-temporal decorrelating receiver iteratively by applying the space-alternating generalized expectation-maximization (SAGE) algorithm. Simulation results show that the SAGE-based decorrelating receiver significantly outperforms the conventional single-user receiver and with performance close to that of a spatial-temporal decorrelating receiver with known channel parameters. We have observed that adding base-station antennas can actually improve convergence of the proposed iterative receiver     

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