谱峰搜索类多重信号分类MUSIC(multiple signal classification,MUSIC)算法作为测向算法中的经典算法,由于具有良好的参数估计性能,因此被广泛使用.但由于庞大的计算量,提高了测向系统的复杂度以及研发成本.相比之下,利用多项式求根获...谱峰搜索类多重信号分类MUSIC(multiple signal classification,MUSIC)算法作为测向算法中的经典算法,由于具有良好的参数估计性能,因此被广泛使用.但由于庞大的计算量,提高了测向系统的复杂度以及研发成本.相比之下,利用多项式求根获取目标信源方位信息的求根MUSIC(root multiple signal classification,root-MUSIC)算法降低了测向的计算复杂度.但由于root-MUSIC算法涉及复系数多项式求根运算,因此其计算量依然很大.为进一步有效降低算法的计算量,本文基于空间谱函数的极值处导数为零这一性质,提出一种基于实系数多项式闭式求根的快速阵列测向算法.所提算法利用坐标映射关系,在新的坐标系u域内构造一个与传统z域root-MUSIC算法同阶次的实系数求根多项式.同时,由于多项式的根关于实轴对称,利用Bairstow算法进一步将该实系数多项式分解为若干个二次多项式,最后利用一元二次方程求根公式直接给出对目标信源方位信息的估计结果.理论分析和仿真实验表明:新算法相比于传统root-MUSIC算法极大降低了计算量,提高了测向速度,同时保持了相同的估计精度.展开更多
For a multivariate polynomial equation with coefficients in a computable ordered field, two criteria of this equation having real solutions are given. Based on the criteria, decision methods for the existence of real ...For a multivariate polynomial equation with coefficients in a computable ordered field, two criteria of this equation having real solutions are given. Based on the criteria, decision methods for the existence of real zeros and the semidefiniteness of binaly polynomials are provided. With the aid of computers, these methods are used to solve several examples. The technique is to extend the original field involved in the question to a computable non-Archimedean ordered field containing infinitesimal elements.展开更多
文摘谱峰搜索类多重信号分类MUSIC(multiple signal classification,MUSIC)算法作为测向算法中的经典算法,由于具有良好的参数估计性能,因此被广泛使用.但由于庞大的计算量,提高了测向系统的复杂度以及研发成本.相比之下,利用多项式求根获取目标信源方位信息的求根MUSIC(root multiple signal classification,root-MUSIC)算法降低了测向的计算复杂度.但由于root-MUSIC算法涉及复系数多项式求根运算,因此其计算量依然很大.为进一步有效降低算法的计算量,本文基于空间谱函数的极值处导数为零这一性质,提出一种基于实系数多项式闭式求根的快速阵列测向算法.所提算法利用坐标映射关系,在新的坐标系u域内构造一个与传统z域root-MUSIC算法同阶次的实系数求根多项式.同时,由于多项式的根关于实轴对称,利用Bairstow算法进一步将该实系数多项式分解为若干个二次多项式,最后利用一元二次方程求根公式直接给出对目标信源方位信息的估计结果.理论分析和仿真实验表明:新算法相比于传统root-MUSIC算法极大降低了计算量,提高了测向速度,同时保持了相同的估计精度.
基金Project supported by the National Natural Science Foundation of China (Grant No. 19661002)the Climbing Project
文摘For a multivariate polynomial equation with coefficients in a computable ordered field, two criteria of this equation having real solutions are given. Based on the criteria, decision methods for the existence of real zeros and the semidefiniteness of binaly polynomials are provided. With the aid of computers, these methods are used to solve several examples. The technique is to extend the original field involved in the question to a computable non-Archimedean ordered field containing infinitesimal elements.
