多子阵互耦条件下的一维波达方向估计及互耦白校正

该文研究多子阵（multiple subarrays）阵元互耦条件下的波达方向（DOA）估计,假设阵列由多个位置已知的均匀线阵（ULA）组成,但线阵阵元间存在互耦效应。利用均匀线阵互耦矩阵的带状、对称Toeplitz性及多子阵互耦矩阵的块状对角特性,提出了一种解耦合波达方向估计及互耦自校正算法。该算法在未知阵元互耦参数的情况下,可准确估计出信源的波达方向。另外,算法在精确估计波达方向的同时,还可准确估计出阵元问的互耦系数,实现多子阵的互耦自校正。算法的波达方向估计只需一维谱峰搜索,避免了通常多参数联合估计的多维非线性搜索及迭代运算,可明显减小算法运算量。文中讨论了算法参数可辨识性的必要条件,并分析计算了多参数联合估计的克拉美-罗界（CRB）。理论分析及蒙特卡罗仿真结果表明,该算法具有计算量小、DOA估计分辨力高、互耦校正效果好等优点。     

多子阵互耦条件下的一维波达方向估计及互耦自校正

该文研究多子阵(multiple subarrays)阵元互耦条件下的波达方向(DOA)估计,假设阵列由多个位置已知的均匀线阵(ULA)组成,但线阵阵元间存在互耦效应。利用均匀线阵互耦矩阵的带状、对称Toeplitz性及多子阵互耦矩阵的块状对角特性,提出了一种解耦合波达方向估计及互耦自校正算法。该算法在未知阵元互耦参数的情况下,可准确估计出信源的波达方向。另外,算法在精确估计波达方向的同时,还可准确估计出阵元间的互耦系数,实现多子阵的互耦自校正。算法的波达方向估计只需一维谱峰搜索,避免了通常多参数联合估计的多维非线性搜索及迭代运算,可明显减小算法运算量。文中讨论了算法参数可辨识性的必要条件,并分析计算了多参数联合估计的克拉美-罗界(CRB)。理论分析及蒙特卡罗仿真结果表明,该算法具有计算量小、DOA估计分辨力高、互耦校正效果好等优点。     

基于最大非圆率信号的改进SWEDE算法

SWEDE(Subspace method Without Eigen DEcomposition)算法是一种不需要协方差阵分解的波达方向估计算法。该方法能降低传统超分辨算法的计算量和复杂度,但也同时降低了均匀线性阵的可测最大信号数。本文基于非圆信号具有椭圆协方差矩阵不为零的特征,并结合SWEDE算法的基本思想,提出了一种改进SWEDE算法:NC-SWEDE算法。该算法利用最大非圆率信号的增维数据模型,相当于将线性阵的可利用阵元数加倍,因而提高了SWEDE算法可测的最大信源数,并提高了算法的分辨力和估计精度。由于引入了非圆信号的相位参数,该算法需要进行二维谱峰搜索,本文采用求极值方法达到了降维的目的。本文分别进行了NC-SWEDE算法最大可分辨信号数、不同 矩阵取法下的算法性能及与传统SWEDE算法性能比较的仿真实验,结果验证了该算法的优越性。      

互耦条件下均匀线阵DOA盲估计

阵元间存在互耦时,经典的波达角(DOA)估计算法性能急剧下降甚至失效。针对互耦条件下均匀线阵DOA估计问题,该文提出一种基于盲源分离的DOA盲估计算法。首先,利用源信号的统计特性,由盲源分离方法估计广义阵列流形矩阵;然后,利用均匀线阵互耦矩阵带状、Toeplitz矩阵的特点,将DOA估计问题转化为多个可分离非线性最小二乘问题,由多个1维频域搜索得到DOA的估计。该算法无需高维搜索或多维迭代,对互耦自由度要求更低,互耦自由度未知时仍旧适用,稳健度高。数值仿真验证了该文算法的有效性。     

互耦效应下用单快拍数据实现相干信源完全解相干和解耦合

阵元间存在互耦时,会对阵列流型产生扰动,同时当空间来波存在相干信源时,协方差矩阵会产生秩亏,这两类问题都会使子空间类估计算法性能急剧下降甚至失效。针对互耦效应下的解相干问题,该文提出了一种仅利用阵列单快拍即可实现完全解相干和解互耦算法互耦效应下的修正单次快拍算法(MC-ENDTOP)。该方法将原单快拍算法应用背景推广至任意形式来波信号,利用一次快拍构造等效接收数据协方差矩阵,通过数据分解,将互耦系数从阵列流型矩阵中剥离,从而实现了完全解互耦,并将其归入分解后的等效信号协方差矩阵中,由于等效信号协方差矩阵为对角阵,且对角元素与信号相关性无关,因此进一步实现了完全解相干。仿真验证了该文算法能够抑制互耦影响,估计性能和无互耦时相当,且适用于实时性要求高的场合。     

基于互相关抽样分解的分布式非圆信号DOA快速估计

在非相干分布式非圆信号波达方向(DOA)估计中,针对利用信号非圆特性后输出矩阵维数扩展带来的较大运算量问题,该文提出一种基于互相关抽样分解的DOA快速估计算法。该算法仅需要从子阵间的扩展互相关矩阵中抽样出少量行元素和列元素,构成两个低维子矩阵,进而通过低秩近似分解便可快速地同时求出左右奇异矢量,即分别对应两个子阵的信号子空间,避免了计算整个互相关矩阵及其奇异值分解运算;最后利用两个子阵信号子空间的旋转不变性通过最小二乘得到DOA估计。仿真分析表明,当行列抽样数大于信源数的两倍时,所提算法与直接基于互相关矩阵奇异值分解的非相干分布式非圆信号DOA估计算法性能相近,但复杂度得到了大幅度降低;而相比于传统的低复杂度非相干分布源DOA估计算法,所提算法利用信号非圆特性具有更高的估计性能。     

一种互耦和相干源条件下的DOA估计方法

空间平滑算法是一种常用的解相干处理方法,而阵元间互耦的存在会导致空间平滑算法失效,从而无法准确估计相干源DOA。针对这个问题,文中提出了一种新的DOA估计方法。该方法基于信号子空间和噪声子空间的正交性原理,利用入射信号源中的独立信号源可以有效估计出互耦矩阵,再通过估计的互耦矩阵对接收数据协方差矩阵进行互耦补偿,克服了互耦对空间平滑算法的影响,从而保证了相干源DOA能准确估计。计算机仿真实验表明了该方法的有效性。     

多径条件下均匀线阵DOA估计及互耦误差自校正

针对多径信道环境下存在互耦误差的均匀线阵,提出了一种联合波达方向估计及互耦 误差自校正算法。在不改变阵列互耦误差的条件下,首先利用虚拟阵列平移预处理方法,将 相干信源协方差矩阵恢复到满秩。进而利用互耦误差的对称Toeplitz特性,基于子空间原理 构造一代阶函数,采用秩损的方法得到互耦误差条件下的DOA估计及阵列互耦误差。数值仿 真结果表明,该算法具有良好的DOA估计性能与互耦误差自校正性能。     

基于交替迭代的混合信号DoA与ULA互耦误差估计算法

针对互耦条件下均匀线阵(Uniform Linear Array, ULA),该文基于交替迭代提出一种适用于混合信号模型的波达方向(Direction of Arrival, DoA)与互耦误差估计算法.算法首先利用ULA互耦矩阵的带状Toeplitz结构,提出一种基于门限的非相干信源DoA估计方法,进而实现互耦误差初步估计;在此基础上,以交互迭代方式实现混合信号DoA估计及互耦误差更新.算法最多只需二次交互迭代,就可实现收敛.计算机仿真结果表明:该算法在较少接收快拍数及低信噪比情况下,均具有良好的DoA及互耦误差估计性能.     

自由度和互耦联合优化的三阶嵌套阵

针对现有嵌套阵自由度低、 互耦率高的问题,本文采用均匀线阵进行级联,提出一种高自由度低互耦的三阶嵌套阵,该结构保留了嵌套阵的原有优势,具有物理阵元位置和自由度的闭式解,且极大程度地降低了阵元互耦.首先,对传统的回波信号模型引入互耦矩阵,建立了互耦条件下回波信号模型;然后,给出了三阶嵌套阵的布阵方式,并推导了"差联合阵列...     

一种自动匹配的分布式非圆信号二维DOA快速估计方法

在相干分布式非圆信号2维波达方向(DOA)估计中,针对利用非圆特性后维数扩展带来的较大复杂度问题,且现有的低复杂度算法均需要额外的参数匹配,该文提出一种基于互相关传播算子的自动匹配2维DOA快速估计算法。该算法考虑L型阵列,在建立相干分布式非圆信号扩展阵列模型的基础上,首先证明了L阵中两个子阵的广义方向矢量(GSV)均具有近似旋转不变特性,然后通过阵列输出信号的互相关运算消除了额外噪声,最终利用子阵GSV的近似旋转不变关系通过传播算子方法得到中心方位角与俯仰角估计。理论分析和仿真实验表明,所提算法无须谱峰搜索和协方差矩阵特征分解运算,具有较低的计算复杂度,并且能够实现2维DOA估计的自动匹配;同时,相比于现有的相干分布式非圆信号传播算子算法,所提算法以较小的复杂度代价获得了性能的较大提升。     

DOA estimation of noncircular signals for coprime linear array via locally reduced-dimensional Capon

We investigate the issue of direction of arrival (DOA) estimation of noncircular signals for coprime linear array (CLA). The noncircular property enhances the degree of freedom and improves angle estimation performance, but it leads to a more complex angle ambiguity problem. To eliminate ambiguity, we theoretically prove that the actual DOAs of noncircular signals can be uniquely estimated by finding the coincide results from the two decomposed subarrays based on the coprimeness. We propose a locally reduced-dimensional (RD) Capon algorithm for DOA estimation of noncircular signals for CLA. The RD processing is used in the proposed algorithm to avoid two dimensional (2D) spectral peak search, and coprimeness is employed to avoid the global spectral peak search. The proposed algorithm requires one-dimensional locally spectral peak search, and it has very low computational complexity. Furthermore, the proposed algorithm needs no prior knowledge of the number of sources. We also derive the Crámer-Rao bound of DOA estimation of noncircular signals in CLA. Numerical simulation results demonstrate the effectiveness and superiority of the algorithm.     

非圆信号方位、俯仰及初相联合估计

该文利用双平行线阵的阵列结构,提出了用于非圆信号二维方向和初相联合估计的扩展MUSIC(EN-MUSIC)算法。EN-MUSIC算法估计得到的方位角、俯仰角与初相一一对应,自动配对,其可测向信号数大于子阵阵元数,方位及俯仰测角精度与非圆信号二维测向酉ESPRIT(2D-NC-UESPRIT)算法大致相当,优于波达方向矩阵法(DOAM)。     

共形阵列非圆信号波达方向估计算法

受共形载体变曲率结构的影响,各天线单元指向不尽相同,使得共形天线阵列呈现极化多样性。因此,共形天线阵列的建模过程中需考虑不同阵元的极化响应特性。基于柱面共形天线阵列的快拍数据模型,利用非圆信号的特性对阵列输出进行扩展,基于秩亏理论和子空间原理实现信号波达方向（DOA）估计,所提方法估计精度高,不需要参数配对。存在相干信源时,提出对扩展后的虚拟阵列进行划分,对划分出的子阵进行虚拟的空间平滑,实现解相干的预处理操作。仿真结果表明该方法能有效应用于柱面共形阵列非圆信号DOA估计,并提高了空间分辨率。      

基于子阵近场零陷权的联合波达方向估计方法

针对海底长线阵在近场辐射声干扰及空间水平非均匀噪声下的远距离估计目标波达方向 (DoA)问题,该文提出一种基于长线阵分子阵近场零陷权的联合目标方位估计方法。该方法将长线阵分解为多个高重叠子阵,对各个子阵利用零陷抑制技术去除近场强干扰对目标探测的影响,再利用各子阵对远距离目标方位估计结果差异性小、非目标所在频率即噪声对应空间谱最大值随机的特点,空间频率方差加权综合各子阵的目标方位估计结果,从而抑制空间非均匀噪声,实现对远距离目标的探测。仿真结果表明,与长线阵常规波束形成、长线阵近场零陷常规波束形成、长线阵近场零陷传统多重信号分类方法相比,该文方法能够有效降低空间谱背景级60 dB以上,输出信噪比提高15 dB以上,具有较强的提高信噪比能力及较高的空间分辨力,因此具有较好的工程应用价值。     

Direction finding in partly calibrated sensor arrays composed of multiple subarrays

We consider the direction-finding problem in partly calibrated arrays composed of several calibrated and identically oriented (but possibly nonidentical) subarrays that are displaced by unknown (and possibly time-varying) vector translations. A new search-free eigenstructure-based direction-finding approach is proposed for such class of sensor arrays. It is referred to as the rank-reduction (RARE) estimator and enjoys simple implementation that entails computing the eigendecomposition of the sample array covariance matrix and polynomial rooting. Closed-form expressions for the deterministic Cramer-Rao bounds (CRBs) on direction-of-arrival (DOA) estimation for the considered class of sensor arrays are derived. Comparison of these expressions with simulation results show that the finite-sample performance of RARE algorithms in both time-invariant and time-varying array cases is close to the corresponding bounds. Moreover, comparisons of the derived CRBs with the well-known bounds for the fully calibrated time-invariant array case help to discover several interesting properties of DOA estimation in partly calibrated and time-varying arrays.     

Direct tracking of noncircular sources for multiple arrays via improved unscented particle filter method

Direct tracking problem of moving noncircular sources for multiple arrays is investigated in this study. Here, we propose an improved unscented particle filter (I-UPF) direct tracking method, which combines system proportional symmetry unscented particle filter and Markov Chain Monte Carlo (MCMC) algorithm. Noncircular sources can extend the dimension of sources matrix, and the direct tracking accuracy is improved. This method uses multiple arrays to receive sources. Firstly, set up a direct tracking model through consecutive time and Doppler information. Subsequently, based on the improved unscented particle filter algorithm, the proposed tracking model is to improve the direct tracking accuracy and reduce computational complexity. Simulation results show that the proposed improved unscented particle filter algorithm for noncircular sources has enhanced tracking accuracy than Markov Chain Monte Carlo unscented particle filter algorithm, Markov Chain Monte Carlo extended Kalman particle filter, and two-step tracking method.     

Underdetermined mixing matrix estimation bycomprehensive application of cluster validity indexes

To solve the problem of mixing matrix estimation for underdetermined blind source separation (UBSS) when thenumber of sources is unknown, this paper proposed a novel mixing matrix estimation method based on averageinformation entropy and cluster validity index (CVI). Firstly, the initial cluster center is selected by using fuzzy C-means (FCM) algorithm and the corresponding membership matrix is obtained, and then the number of clusters isobtained by using the joint decision of CVI and average information entropy index of membership matrix, thenmultiple cluster number estimation results can be obtained by using multiple CVIs. Then, according to the results ofthe number of multiple clusters estimation, the number of radiation sources is determined according to the principleof the subordination of the minority to the majority. The cluster center vectors obtained from the clustering operationof the estimated number of radiation sources are fused, that is the mixing matrix is estimated based on the degree ofsimilarity of the cluster center vectors. When the source signal is not sufficiently sparse, the time-frequency singlesource detection processing can be combined with the proposed method to estimate the mixing matrix. Theeffectiveness of the proposed method is validated by experiments.