共查询到18条相似文献,搜索用时 296 毫秒
1.
针对稀疏分解方法进行均匀圆阵(UCA)的二维波达方向(DOA)估计运算复杂度大的问题,提出了一种基于协方差矩阵高阶幂稀疏分解的二维DOA估计新算法。该算法首先利用协方差矩阵高阶幂无需进行特征值分解和信源数估计的特性,构建了协方差矩阵高阶幂的稀疏分解向量;然后运用粒度分层思想,构造了粗区域估计和细方位估计的分层多粒度的快速分解模型,分层字典的长度大大减少,在保持估计精度的前提下,算法运算时间远小于现有的恒定冗余字典的稀疏分解方法,从而解决了基于稀疏分解的圆阵二维DOA估计问题。论文提出的算法与二维MUSIC算法相比,估计精度高,且能满足对相干信号的估计。仿真结果验证了算法的有效性和可行性。 相似文献
2.
3.
针对二维混合多输入多输出(MIMO)相控阵雷达发射阵列子阵分割带来的自由度损失问题,提出一种基于二维嵌套阵列的二维混合MIMO相控阵雷达接收阵列设计新方法。首先,给出一种由稀疏阵列和密集阵列构成的嵌套阵接收阵列的二维混合MIMO相控阵雷达信号模型;其次,通过对接收信号的协方差矩阵进行Khatri-Rao乘积处理,得到阵元位置差的差异阵列,形成接收阵元数目的虚拟扩展;最后,通过空间平滑处理进行波达方向估计。仿真实验表明,与传统二维混合MIMO相控阵雷达相比,所提方法在不增加实际阵元数目的情况下可以有效扩展虚拟阵元数目,提高雷达阵列自由度,进而提高二维混合MIMO相控阵雷达波达方向估计精度。 相似文献
4.
研究了稀疏阵列下二维波达方向(DOA)的估计问题,提出一种基于不动点迭代的空间谱估计(FPC-MUSIC)算法。首先建立基于矩阵填充的DOA估计信号模型,并验证该信号模型满足零空间性质(NSP),其次通过不动点迭代算法将稀疏阵列信号恢复为完整信号,最后利用恢复信号估计二维DOA。该算法可在稀疏阵列下大幅度降低谱估计平均副瓣,在大幅度降低阵元数的同时具有较高的估计精度。计算机仿真表明:FPC-MUSIC算法可在稀疏阵列下准确估计二维DOA,验证了该算法的有效性和优越性。 相似文献
5.
给出了一种在高斯白噪声环境下对多个窄带信号进行二维波达方向估计的新方法.该方法根据给出的天线阵列结构的特点,首先构造四个相关矩阵,进而构造一个大的矩阵,对其进行一次特征值分解,由ESPRIT原理实现了信号波达方向的准确估计.该方法精度较高,不存在错误估计,有一定的实用性. 相似文献
6.
7.
研究双基地多输入多输出(Multiple-input Multiple-output, MIMO)雷达中的角度和多普勒频率联合估计问题,提出了一种基于四线性分解(Quadrilinear Decomposition)的离开角(Direction of Departure, DOD)、波达角(Direction of Arrival, DOA)和多普勒频率的联合估计算法。通过对接收端匹配滤波器的输出进行延迟操作,得到符合四线性模型的数据,根据四线性交替最小二乘(Quadrilinear Alternating Least Squares, QALS)进行迭代,得到方向矩阵和多普勒频率矩阵的估计,进而得到角度和频率的估计。该算法无需谱峰搜索,无需知道反射系数,可实现角度和频率的自动配对,且能用于非均匀阵,该算法的角度估计性能优于多维ESPRIT方法和三线性交替最小二乘(Trilinear Alternating Least Squares, TALS)方法。论文分析了所提算法复杂度,并推导了克拉美-罗界(Cramer-Rao bound, CRB)。仿真结果验证了该算法的有效性。 相似文献
8.
9.
提出了一种适用于任意阵列的极化和二维DOA联合估计算法。该算法基于信号空时二维结构特征,利用空域采样和时域采样构造时空矩阵,通过DOA矩阵方法进行极化和二维DOA参数估计,不需要二维谱峰搜索,计算量小。仿真实验证明了算法的有效性。 相似文献
10.
在相干分布式非圆(CDNC)信号波达方向(DOA)估计中,针对阵列输出矩阵扩展后维数增加带来的较大运算量问题,基于降维的多级维纳滤波(MSWF)技术,引入回溯优化思想,提出了一种快速估计算法。该算法首先利用信号非圆特性扩展阵列输出矩阵,然后通过MSWF递推分解快速求出信号子空间,避免了计算阵列协方差矩阵及特征分解,并且在递推过程中引入回溯优化机制提高了各级匹配滤波器的估计性能,最后由最小二乘(LS)或者总体最小二乘(TLS)得到DOA估计。仿真分析表明,所提算法与相干分布式非圆信号旋转不变子空间算法(CDNC-ESPRIT)性能相当,但复杂度得到了大幅度降低,相比于基于MSWF的非圆信号快速子空间(NC-MSWF-FS)算法,在较小的复杂度代价下大幅度提升了低信噪比时的估计性能,并且对初始参考信号的选取具有了较强的鲁棒性。 相似文献
11.
Improved clutter mitigation performance using knowledge-aided space-time adaptive processing 总被引:2,自引:0,他引:2
Bergin J.S. Teixeira C.M. Techau P.M. Guerci J.R. 《IEEE transactions on aerospace and electronic systems》2006,42(3):997-1009
This paper presents a framework for incorporating knowledge sources directly in the space-time beamformer of airborne adaptive radars. The algorithm derivation follows the usual linearly-constrained minimum-variance (LCMV) space-time beamformer with additional constraints based on a model of the clutter covariance matrix that is computed using available knowledge about the operating environment. This technique has the desirable property of reducing sample support requirements by "blending" the information contained in the observed radar data and the a priori knowledge sources. Applications of the technique to both full degree of freedom (DoF) and reduced DoF beamformer algorithms are considered. The performance of the knowledge-aided beam forming techniques are demonstrated using high-fidelity simulated X-band radar data 相似文献
12.
Wideband cancellation of interference in a GPS receive array 总被引:8,自引:0,他引:8
We have demonstrated that by using an adaptive space-time array the interference from multiple, strong interferers plus multipath can be canceled down close to the noise floor without producing serious loss or distortion of a GPS signal. Design criteria are presented and limitations are examined. We also compare space-time processing with suboptimum space-frequency processing, and demonstrate by simulation that for equal computational complexity space-time processing slightly outperforms suboptimum space-frequency processing 相似文献
13.
Li W. Leung H. Yifeng Zhou 《IEEE transactions on aerospace and electronic systems》2004,40(3):824-836
Space and time alignments are the prerequisites for the successful fusion of multiple sensors. A space-time registration model is proposed to estimate the system biases and to perform time synchronization together for mobile radar and electronic support measure (ESM) systems. A space-time registration model for radar and ESM is first developed, and an unscented Kalman filter (UKF) is proposed to estimate the space-time biases and target states simultaneously. The posterior Cramer-Rao bounds (PCRBs) are derived for the proposed UKF registration algorithm for ESM detection probability less than or equal to one. Theoretical analyses are performed to evaluate the accuracy and robustness of the proposed method. Computer simulations show that the UKF registration algorithm is indeed effective and robust for different radar and ESM tracking scenarios. 相似文献
14.
15.
Optimal and adaptive reduced-rank STAP 总被引:1,自引:0,他引:1
《IEEE transactions on aerospace and electronic systems》2000,36(2):647-663
This paper is concerned with issues and techniques associated with the development of both optimal and adaptive (data dependent) reduced-rank signal processing architectures. Adaptive algorithms for 1D beamforming, 2D space-time adaptive processing (STAP), and 3D STAP for joint hot and cold clutter mitigation are surveyed. The following concepts are then introduced for the first time (other than workshop and conference records) and evaluated in a signal-dependent versus signal independent context: (1) the adaptive processing “region-of-convergence” as a function of sample support and rank, (2) a new variant of the cross-spectral metric (CSM) that retains dominant mode estimation in the direct-form processor (DFP) structure, and (3) the robustness of the proposed methods to the subspace “leakage” problem arising in many real-world applications. A comprehensive performance comparison is conducted both analytically and via Monte Carlo simulation which clearly demonstrates the superior theoretical compression performance of signal-dependent rank-reduction, its broader region-of-convergence, and its inherent robustness to subspace leakage 相似文献
16.
17.
Popp R.L. Pattipati K.R. Bar-Shalom Y. 《IEEE transactions on aerospace and electronic systems》1999,35(4):1145-1160
In recent years, there has been considerable interest within the tracking community in an approach to data association based on the m-best two-dimensional (2D) assignment algorithm. Much of the interest has been spurred by its ability to provide various efficient data association solutions, including joint probabilistic data association (JPDA) and multiple hypothesis tracking (MHT). The focus of this work is to describe several recent improvements to the m-best 2D assignment algorithm. One improvement is to utilize a nonintrusive 2D assignment algorithm switching mechanism, based on a problem sparsity threshold. Dynamic switching between two different 2D assignment algorithms, highly suited for sparse and dense problems, respectively, enables more efficient solutions to the numerous 2D assignment problems generated in the m-best 2D assignment framework. Another improvement is to utilize a multilevel parallelization enabling many independent and highly parallelizable tasks to be executed concurrently, including 1) solving the multiple 2D assignment problems via a parallelization of the m-best partitioning task, and 2) calculating the numerous gating tests, state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the 2D assignment problem) via a parallelization of the data association interface task. Using both simulated data and an air traffic surveillance (ATS) problem based on data from two Federal Aviation Administration (FAA) air traffic control radars, we demonstrate that efficient solutions to the data association problem are obtainable using our improvements in the m-best 2D assignment algorithm 相似文献
18.
提出利用均匀线阵接收的数据构造一种矩阵进行奇异值(SVD)分解,以实现对相干噪声源的方位估计。利用这种方法,通过改变阵列中心位置便可确定机器多噪声源位置。计算机模拟和声学实验证实了这种方法的可行性。 相似文献