一种稀疏阵列近场目标的降维搜索定位算法  

A Dimensionality Reduction Search Localization Algorithm for Sparse Array Near-Field Target

作　　者：龚军涛 黄光明[1] 肖龙 吴彬 卿浩博 GONG Juntao;HUANG Guangming;XIAO Long;WU Bin;QING Haobo(Southwest China Research Institute of Electronic Equipment,Chengdu 610036,China)

机构地区：[1]中国电子科技集团公司第二十九研究所,成都610036

出　　处：《电子信息对抗技术》2024年第6期66-74,共9页Electronic Information Warfare Technology

摘　　要：为实现稀疏阵列近场目标定位,提出一种基于稀疏阵列相位差解模糊的定位算法。该算法在稀疏阵列近场条件下进行角度遍历寻优,建立目标与阵列之间的距离差近似模型。在目标方向上对阵列测量相位差进行距离补偿得到等效线性阵列,再对等效线性阵列进行相位差解模糊,从而计算出目标距离估计值,实现目标定位。同时给出了基于解模糊条件的阵列设计方法,并推导了均匀线阵角度、距离的克拉美罗界(Cramer-Rao Bound,CRB)解析表达式。仿真实验表明,该算法解模糊概率高,定位方法可行,是一种有效的阵列近场定位算法。In order to realize sparse array near field target location,a location algorithm based on sparse array phase difference unwrapping is proposed.Under the condition of sparse array near field,an approximate model of distance difference between the target and the array is established by searching only in angle space.In finite area,the measured phase difference of the array is compensated in the direction of the target to obtain the equivalent linear array,and then the parameters of angle and range of target are estimated to realize the target location.At the same time,the array design method based on phase unwrapping condition is given,and the Cramer-Rao bound(CRB)analytical expressions of uniform linear array angle and distance are derived.The high probability and validity of the localization method using sparse array are verified by simulation.The method is an effective near-field location algorithm for array.

关 键 词：稀疏阵列 近场 定位 解模糊 

分 类 号：TN971.1[电子电信—信号与信息处理]