检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军信息工程大学信息工程学院,郑州450002
出 处:《信号处理》2009年第7期1076-1078,共3页Journal of Signal Processing
摘 要:最小二乘恒模算法(LSCMA)是阵列信号处理中广泛使用的一种能全局收敛且稳定性强的算法,但是在低信噪比的情况下会发生干扰捕获问题。正交化(Hung-Turner)算法在低信噪比情况下有较好的收敛性能,且计算简单。本文提出了一种正交化算法和最小二乘恒模算法的联合算法。仿真结果表明这种算法能较好的解决干扰捕获问题,其收敛性能比LSCMA要好,尤其在低信噪比的情况下。The LSCMA is a constringent and steady algorithm which is spreadly used in array signal processing. But it has a problem of interference capture in low SNR. The orthogonal Hung-Turner algorithm has a good convergence compared to the LSCMA, besides,it is much easier. This paper proposes a conjoint algorithm which is a Hung-Turner algorithm one as well as a LSCMA. From the result of the simulation, we can see that this algorithm can solve the interference capture problem very well, and its convergence is better than LSCMA, particularly in low SNR.
分 类 号:TN957.51[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222