检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子科技大学电子工程学院,四川成都611731
出 处:《雷达科学与技术》2016年第1期81-85,共5页Radar Science and Technology
基 金:国家自然科学基金(No.61371184;61301262);中国博士后科学基金特别资助项目(No.115719);中央高校基本科研业务费(No.ZYGX2013J022)
摘 要:对于极化敏感L型阵列的多参数联合估计问题,采用传统的多重信号分类(MUSIC)算法所需计算量大,采用旋转不变子空间(ESPRIT)算法需要考虑参数配对问题。提出了模值约束下的求根多重信号分类(root-MUSIC)算法,首先利用L型阵列中两个相互垂直的线阵构造两子阵接收数据的自相关函数,采用root-MUSIC算法进行波达方向角(DOA)估计,然后根据模值约束条件构造代价函数,通过闭合式解得到极化参数估计。该算法与传统MUSIC算法相比,大大减少了计算量,同时能够实现参数自动配对,避免了ESPRIT算法的不足。计算机仿真结果表明,该算法的角度估计性能与传统MUSIC算法接近,优于E SPRIT算法,且算法收敛速度快。A large amount of computation is required when using the traditional MUSIC algorithm and the parameter matching problem should be considered when using ESPRIT algorithm for multi-parameters estimation of L-shaped polarization sensitive array. A root-MUSIC algorithm with modulus constraint is proposed. This algorithm estimates the DOA and polarization parameters in two separate steps. In step one, the autocorrelation function of the received data from two mutually vertical linear arrays is constructed, and DOA parameter is estimated by root-MUSIC algorithm; in step two, the cost function is constructed according to constraint condition and polarization parameters are obtained with closed-form formulas. Compared with the traditional MUSIC algorithm, the proposed algorithm greatly reduces the amount of calculation. It can realize automatic matching parameters at the same time, which avoids the deficiency of the ESPRIT algorithm. The computer simulation results show that the angle estimation performance of the proposed algorithm is close to traditional MUSIC algorithm, and is better than ESPRIT algorithm. Furthermore, the proposed algorithm has fast convergence speed.
关 键 词:极化敏感阵列 参数估计 模值约束 求根多重信号分类法
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.187.189