共查询到16条相似文献,搜索用时 203 毫秒
1.
2.
针对恒模算法(constant modulus algorithm, CMA)在脉冲噪声环境下性能退化的问题,本文基于最大相关熵准则(maximum correntropy criterion, MCC)对恒模算法中基于最小均方误差(mean square error, MSE)准则的代价函数进行修正,推导出适用于脉冲噪声环境的基于MCC准则的恒模盲均衡算法(MCC_CMA)。该算法利用通信信号的恒模特性,首先得到发送信号与均衡器输出信号模值的误差信号,再通过使模值误差信号的相关熵最大来获得其迭代误差调节项,避免了传统高阶统计量算法在脉冲噪声环境下性能退化的问题。对高斯噪声以及α-稳定分布和混合高斯分布两种脉冲噪声环境下的信道均衡问题的仿真实验表明,相对于经典的自适应恒模盲均衡算法,MCC_CMA算法不依赖噪声的先验知识就能获得较快的收敛速度、较低的剩余码间干扰和误码率,并且在不同脉冲强度的脉冲噪声环境下都能够得到较好的均衡结果,表明MCC_CMA算法具有很好的鲁棒性。 相似文献
3.
4.
阵列指向性偏差会导致线性约束最小二乘恒模算法(LSCMA)的性能急剧下降,为此提出了一种基于二次型约束的鲁棒LSCMA算法。该算法通过对期望信号波达方向附近小区域内的方向向量的误差模值进行约束来构造一种新的代价函数,并在此函数下迭代更新权重向量,以提高算法的鲁棒性。该算法收敛速度快,稳态性能好,能够有效地解决干扰捕获问题,对阵列指向性偏差具有很强的鲁棒性,从而改善了阵列输出的信干噪比,使其更接近最优值。仿真结果表明:与线性约束最小二乘恒模算法相比,所提鲁棒算法提高了输出性能,降低了计算量,易于实时实现,且能适应实际复杂的通信环境。 相似文献
5.
6.
7.
以常数模和判决引导准则设计的双模式盲均衡算法可显著提高均衡性能,目前已有双模式盲均衡算法均需设置切换参数且切换参数选择和设定缺乏理论依据.为解决双模式盲均衡算法中切换参数难以确定的问题,提出来一种组合代价函数的双模式盲均衡新算法.利用常数模和判决引导准则通过加权设计代价函数,在盲均衡器更新过程中自适应调节权值实现算法由常数模算法向判决引导算法的切换,避免了在双模式算法中设计切换参数,提高了算法的泛化性能.为克服常数模算法相位盲的缺点,在虚实分开改进的常数模算法基础上优化组合代价函数以及盲均衡器更新算法的设计,进一步提高了算法收敛性能.仿真结果证明,组合代价函数双模式盲均衡新算法可充分发挥常数模算法和判决引导算法的优点,具有更快的收敛速度和更小的稳态剩余误差. 相似文献
8.
9.
10.
11.
12.
Fuzzy step size least mean square algorithm tuned linearly constrained constant modulus algorithm for multi‐carrier code division multiple access blind multiuser detector 下载免费PDF全文
Adaptive fuzzy logic step size least mean square algorithm (FLCLMS) tuning unit is designed to adjust the step size of the linear constrained constant modulus algorithm for blind multiuser detection (MUD) in multi‐carrier code division multiple access (MC‐CDMA) systems is presented. In wireless communications system, the conventional constant modulus algorithm for blind MUD has some disadvantages such as slow convergence speed and phase rotation. To overcome these shortages, a modified constant modulus algorithm was developed for blind multiuser detector. On the basis of the deterministic behavior of the FLCLMS algorithm, it has also proposed simplification over the cost function calculation, obtaining more efficient algorithm and creating new perspective for the MUD implementation. The proposed algorithm ensures the algorithm convergence to the desired user and suppresses the multiple access interference in this cost function. Thus, the performance of the system is improved. The computational experiments show that the proposed FLCLMS not only can find optimal or closed‐to‐optimal solutions but also can obtain the low computation complexity both better and more robust results than existing algorithm reported recently in the literature. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
13.
针对传统固定步长CMA盲均衡算法中收敛速度和剩余误差这对矛盾,提出了一种新型变步长恒模盲均衡算法,即由瑞利分布函数实施对其步长的调节,通过调整该步长公式中的两个参数以加快收敛速度和减小剩余误差,并且在此基础上对该算法进行了改进。用4QAM信号,通过典型电话信道对固定步长的CMA算法,基于瑞利步长的CMA和改进后的CMA算法进行计算机仿真。通过对仿真出的算法收敛曲线以及输出星座图进行分析,最终得出在瑞利步长算法的基础上改进后的CMA算法克服了前两种算法的缺点,即具有收敛速度更快,剩余误差更小的优点。 相似文献
14.
The linearly constrained constant modulus algorithm (LCCMA) applied to blind DS-CDMA multiuser detection was widely considered in the last few years. In some papers, global convergence of the linearly constrained constant modulus (LCCM) algorithm was incorrectly claimed, after which corrections were published by other authors (see the Introduction section for references). In this letter, analysis of the LCCM criterion is extended to prove convexity of the LCCM cost function between any point and the global minimum, subject to certain conditions, by using the definition of a continuous convex function. 相似文献
15.