首页 | 本学科首页   官方微博 | 高级检索  
     检索      

改进的复值非高斯最大化盲源分离算法
引用本文:贾雁飞,赵立权,杨莘元.改进的复值非高斯最大化盲源分离算法[J].黑龙江大学自然科学学报,2010,27(2).
作者姓名:贾雁飞  赵立权  杨莘元
作者单位:1. 北华大学电气信息工程学院,吉林,132013
2. 东北电力大学信息工程学院,吉林,132012
3. 哈尔滨工程大学信息与通信工程学院,哈尔滨,150001
摘    要:复值非高斯最大化盲源分离算法的收敛速度,受其采用的反双曲正弦函数计算复杂度的影响较大,针对这一问题,提出了一种收敛速度更快的改进型复值非高斯最大化算法。该算法采用一个低计算复杂度的非线性函数替代原算法中的反双曲正弦函数。该函数的计算复杂度是反双曲正弦函数的三分之一。在相同条件下,基于该非线性函数的复值非高斯最大化盲源分离算法的收敛速度相比原算法提高了1倍左右,更适合于对接收信号进行实时处理,而且信号分离误差小,同时该算法同样适用于任意非高斯的常态和非常态信源。仿真试验验证了算法的有效性。

关 键 词:盲源分离  计算复杂度  复值非高斯最大化  收敛速度

Improved complex maximization of nongaussianity blind source separation algorithm
JIA Yan-fei,ZHAO Li-quan,YANG Shen-yuan.Improved complex maximization of nongaussianity blind source separation algorithm[J].Journal of Natural Science of Heilongjiang University,2010,27(2).
Authors:JIA Yan-fei  ZHAO Li-quan  YANG Shen-yuan
Abstract:Due to higher computational complexity of anthyperbolic function, that was used in complex maximization of nongaussianity algorithm, influenced convergence speed of algorithm, the fast complex maximization of nongaussi-anity algorithm that based a new lower computational complexity nonlinear function was proposed. Computational complexity of the new function is about third of anthyperbolic function. In the same condition, the convergence speed of fast maximization of nongaussianity algorithm that based on the new nonlinear function was half of maximization of non-gaussianity algorithm, so it is more suitable for dealing the received signals in time. The algorithm had smaller error and could apply to any proper and improper sources. Simulation proved efficiency and correctness of the algorithm.
Keywords:blind source separation  computation complexity  complex maximization of nongaussianity  conver-gence speed
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号