首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
非相干分布源DOA和角度扩展去耦估计方法   总被引:3,自引:0,他引:3  
该文提出了一种新的非相干分布源的DOA和角度扩展估计算法。根据空间频率模型下的非相干分布源协方差矩阵的结构特点,可将协方差矩阵分离成两个分别由相位信息和幅度信息重建的矩阵。对矩阵的各主次对角线元素均进行平滑,可得到包含相位信息和幅度信息的平滑向量。利用最小均方拟合方法,可从相位信息中估计得到方位角;估计得到的方位角信息代入到幅度信息中即可获得角度扩展信息的估计,实现非相干分布源的DOA和角度扩展去耦估计。计算机仿真验证了算法的性能。  相似文献   

2.
A low-complexity algorithm is presented for the estimation of the nominal direction-of-arrivals (DOAs) of incoherently distributed (ID) sources. The presented algorithm estimates the nominal DOAs of ID sources by a novel propagator method which makes use of the approximate rotational invariance relationship between two closely spaced identical uniform linear arrays. Without any search and the eigendecomposition of the sample covariance matrix, our algorithm can provide lower computational complexity than other known methods. In addition, it can be applied to the multisource scenario with different angular distribution shapes. Simulation results prove the effectiveness of the presented algorithm.  相似文献   

3.
Distributed source localization using ESPRIT algorithm   总被引:16,自引:0,他引:16  
A new algorithm based on ESPRIT is proposed for the estimation of the central angle and angular extension of distributed sources. The central angles are estimated using TLS-ESPRIT for both incoherently distributed (ID) and coherently distributed (CD) sources. For CD sources, the extension width is estimated by constructing a one-dimensional (1-D) distributed source parameter estimator (DSPE) spectrum for each source. For ID sources, the extension widths are estimated using the central moments of the distribution. The algorithm can be used for sources with different angular distributions  相似文献   

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

5.
麻妍梅  邓科  殷勤业 《信号处理》2017,33(11):1468-1474
本文针对非相干混合点信源和分布式信源,提出了一种基于对称均匀线阵的波达方向估计算法。该算法利用点信源和分布式信源协方差矩阵结构的不同,采用空间差分技术将两种信源分离。对于点信源,采用传统MUSIC算法估计其波达方向;对于分布式信源,利用信号子空间的旋转不变性来估计其波达方向。该算法不仅消除了点信源对分布式信源的影响,也无需估计分布参数,大大降低了计算复杂度。且采用2N+1个阵元的对称均匀线阵可估计出 2N 个混合信源,其中分布式信源最多为 N 个,有效减小了阵列的孔径损失。仿真结果表明该算法的性能优于广义特征值分解的算法。   相似文献   

6.
In this paper, a low-complexity method is proposed for the parametric estimation of an incoherently distributed (ID) source, using a uniform linear array. Based on the Taylor approximation property of the noise-free covariance matrix, the proposed method firstly decouples the estimation of the nominal direction-of-arrival (DOA) from that of the angular spread. And then utilizing the nominal DOA estimation and a special cost function, the angular spread can be estimated by constructing one-dimensional (1-D) searching spectrum. Compared with some existing techniques, our approach requires a much lower computational cost and can exhibit a better estimation performance in a single ID source case, especially for low signal-to-noise ratio. Simulation results illustrate the performance of the proposed method.  相似文献   

7.
In this paper, a simplified parametric estimator for tridimensional localization of single incoherently distributed (ID) source with small angular spread is proposed. The proposed estimator firstly obtains two sample covariance matrices using the observation data of a L-shape array. And then the secondary diagonal elements of the sample covariance matrices are used to estimate the nominal azimuth and elevation of single ID source. Our technique does not involve any spectrum searching and the eigen-decomposition of the sample covariance matrix, and thus the computational burden has been significantly alleviated. Moreover, it is also a blind estimator which doesn’t require any prior knowledge about the angular power density of the ID source. Numerical examples illustrate the performance of the proposed estimator.  相似文献   

8.
In this paper, a new algorithm for parametric localization of multiple incoherently distributed sources is presented. This algorithm is based on an approximation of the array covariance matrix using central and noncentral moments of the source angular power densities. Based on this approximation, a new computationally simple covariance fitting-based technique is proposed to estimate these moments. Then, the source parameters are obtained from the moment estimates. Compared with earlier algorithms, our technique has lower computational cost and obtains the parameter estimates in a closed form. In addition, it can be applied to scenarios with multiple sources that may have different angular power densities, while other known methods are not applicable to such scenarios.  相似文献   

9.
We consider the problem of estimating the nominal direction of arrival (DOA) of an incoherently distributed source. This problem is encountered due to the presence of local scatterers in the vicinity of a transmitter or due to signals propagating through a random inhomogeneous medium. Since the spatial covariance matrix has full rank for an incoherently distributed source, the performance of most high-resolution DOA estimation algorithms conceived under coherently distributed sources, as well as point source models, degrades when scattering is present. In addition, several DOA estimation techniques devised under a distributed source model require a high-dimensional nonlinear optimization problem. In this paper, we propose a novel method based on the conventional beamforming approach, which estimates the nominal DOA from a spatial maximum peak of the output power. The proposed method is computationally more attractive than the maximum likelihood (ML) estimator, although the performance degrades in comparison with the ML estimator, whose asymptotic performance is equivalent to the Cramer–Rao bound (CRB). We derive and compare the asymptotic performances of the proposed method and the redundancy-averaged covariance matching (RACM) method in the single-source case. The simulation results illustrate that the asymptotic performance of the proposed method is better than that of the RACM method.   相似文献   

10.
当样本数不足时,由采样协方差矩阵特征分解得到的噪声子空间偏离其真实值,使得多重信号分类(MUSIC)算法目标角度(DOA)估计性能下降。为了解决这个问题,该文提出了一种迭代算法通过校正信号子空间来提高MUSIC算法性能。该方法首先利用采样协方差矩阵特征分解得到的噪声子空间粗略估计目标角度;其次基于信源的稀疏性和导向矢量的低秩特性,由上一步得到的目标角度以及其邻域角度对应的导向矢量构造一个新的信号子空间;最后通过解一个优化问题来校正信号子空间。仿真结果表明,该算法有效地提高了子空间估计精度。基于新的信号子空间实现MUSIC DOA估计可以使得性能得到改善,且在低样本数下改善尤为明显。  相似文献   

11.
基于稀疏表示技术,该文提出一种相干分布式非圆信号的参数估计新方法。该方法将信号的非圆特性引入分布式信源模型,充分利用非圆信号的特性,联合阵列输出协方差矩阵和椭圆协方差矩阵,并将其矢量化之后表示在受制于稀疏限制的过完备字典上;然后将DOA估计转化为一个稀疏重构问题,能够一次性求解出中心DOA和角度扩展。仿真结果表明,该方法适用于各种非圆率的非圆信号,具有较好的信噪比性能和分辨力,所提出的方法还能对圆和非圆信号同时存在的情况进行有效估计。  相似文献   

12.
If one incorporates a beamformer composed of conjugate centro-symmetric weight vectors as a preprocessor to an eigenstructure direction finding algorithm, a real-valued decomposition can be employed to estimate the noise and signal subspaces from the sample covariance matrix. The effect of employing the real processing methodology on the angle estimation performance of beamspace MUSIC is explored. Specifically, the distribution of the real-valued signal subspace eigenvectors is derived and used in an asymptotic analysis of the bias and variance of the MUSIC estimator. The theoretical analysis shows that processing the real part of the beamspace sample covariance matrix offers significant performance gains, in addition to the obvious computational benefit, relative to the conventional complex-valued procedure, particularly in the case of correlated sources. Monte Carlo simulations are included to verify the theoretical expressions. A trade-off study of the estimation accuracy versus the desire to provide adequate rejection of unwanted signals in a sector-based interrogation scheme for various beamforming architectures is also presented  相似文献   

13.
A robust version of the multiple signal classification (MUSIC) bearing estimation algorithm based on robust statistics is developed for a direct sequence-code division multiple access impulsive noise channel. The proposed subspace algorithm is computed by using the antenna array covariance matrix, which is derived from the robust maximum likelihood estimator of location. Each element of the robust covariance matrix is computed as the sample myriad of a window of the received observations. The MUSIC antenna array scheme is jointly used to mitigate the effects of multipath and impulsive noise. Simulation results demonstrate that the proposed scheme significantly outperforms the other linear and nonlinear schemes  相似文献   

14.
In this paper, we propose a new algorithm for estimating the two-dimensional (2D) nominal direction-of-arrivals (DOAs) of multiple coherently distributed (CD) sources by utilizing three parallel uniform linear arrays (ULAs). The proposed algorithm firstly shows that some rotational eigenstructures exist approximately for three pair of shifted ULAs. And then a modified propagator method is used to estimate three rotational invariance matrices which denote the rotational eigenstructures. Finally, the nominal angular parameters of CD sources are obtained from the eigenvalues of the rotational invariance matrices. Without spectrum searching, the estimation and eigendecomposition of the sample covariance matrix, our approach is computationally more attractive compared with the earlier algorithms. In addition, it can be applied to the scenario with multiple sources that may have different angular distribution shapes. Simulation results illustrate the performance of the algorithm.  相似文献   

15.
姚晖  吴瑛 《信号处理》2013,29(8):1058-1063
论文提出了一种具有低复杂度的相干分布源波达方向和角度扩展估计算法。该算法将点源模型中的求根MUSIC算法推广应用至分布源模型。利用空间频率下的相干分布源广义方向矢量可以表示成参数去耦形式的结构特点,并根据相干分布源的角信号密度函数,构造参数估计的多项式求根形式,然后通过交替迭代的求根方法得到分布源的中心波达方向和角度扩展的估计值。该算法参数估计性能与DSPE算法相当,其计算复杂度要远小于DSPE算法,并且适用于不同分布类型的相干分布源同时存在的情况。计算机仿真验证了算法的性能。   相似文献   

16.
The problem of modified ML estimation of DOAs of multiple source signals incident on a uniform linear array (ULA) in the presence of unknown spatially correlated Gaussian noise is addressed here. Unlike previous work, the proposed method does not impose any structural constraints or parameterization of the signal and noise covariances. It is shown that the characterization suggested here provides a very convenient framework for obtaining an intuitively appealing estimate of the unknown noise covariance matrix via a suitable projection of the observed covariance matrix onto a subspace that is orthogonal complement of the so-called signal subspace. This leads to a formulation of an expression for a so-called modified likelihood function, which can be maximized to obtain the unknown DOAs. For the case of an arbitrary array geometry, this function has explicit dependence on the unknown noise covariance matrix. This explicit dependence can be avoided for the special case of a uniform linear array by using a simple polynomial characterization of the latter. A simple approximate version of this function is then developed that can be maximized via the-well-known IQML algorithm or its variants. An exact estimate based on the maximization of the modified likelihood function is obtained by using nonlinear optimization techniques where the approximate estimates are used for initialization. The proposed estimator is shown to outperform the MAP estimator of Reilly et al. (1992). Extensive simulations have been carried out to show the validity of the proposed algorithm and to compare it with some previous solutions  相似文献   

17.
A novel eigenstructure-based method for direction estimation is presented. The method assumes that the emitter signals are uncorrelated. Ideas from subspace and covariance matching methods are combined to yield a noniterative estimation algorithm when a uniform linear array is employed. The large sample performance of the estimator is analyzed. It is shown that the asymptotic variance of the direction estimates coincides with the relevant Cramer-Rao lower bound (CRB). A compact expression for the CRB is derived for the ease when it is known that the signals are uncorrelated, and it is lower than the CRB that is usually used in the array processing literature (assuming no particular structure for the signal covariance matrix). The difference between the two CRBs can be large in difficult scenarios. This implies that in such scenarios, the proposed methods has significantly better performance than existing subspace methods such as, for example, WSF, MUSIC, and ESPRIT. Numerical examples are provided to illustrate the obtained results  相似文献   

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

19.
王凌  李国林  谢鑫  齐率 《雷达学报》2012,1(1):43-49
针对传统联合估计方法计算量大、需要多维谱峰搜索的问题,该文提出了一种基于垂直阵列结构的任意初始相位非圆信号2 维DOA (Direction Of Arrival)和初相联合估计方法,利用垂直阵列特点,将3维参数估计问题转化为可并行处理的3个2维参数估计,在每一个子阵上,同时使用噪声子空间正交性和信号子空间旋转不变性,将2维参数估计进一步转化为1维估计问题,最终只需要对扩展协方差矩阵进行一次特征分解即可实现2维DOA和初相的联合估计及自动配对。该方法适用于空间信源处于过载的情形和低信噪比、短快拍环境,可估计信源数为2(M1)。数值仿真验证了该算法的有效性。   相似文献   

20.
The problem of subspace estimation using multivariate nonparametric statistics is addressed. We introduce new high-resolution direction-of-arrival (DOA) estimation methods that have almost optimal performance in nominal conditions and are robust in the face of heavy-tailed noise. The extensions of the techniques for the case of coherent sources are considered as well. The proposed techniques are based on spatial sign and rank concepts. We show that spatial sign and rank covariance matrices can be used to obtain convergent estimates of the signal and noise subspaces. In the proofs, the noise is assumed to be spherically symmetric. Moreover, we illustrate how the number of signals may be determined using the proposed covariance matrix estimates and a robust estimator of variance. The performance of the algorithms is studied using simulations in a variety of noise conditions including noise that is not spherically symmetric. The results show that the algorithms perform near optimally in the case of Gaussian noise and highly reliably if the noise is non-Gaussian  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号