共查询到20条相似文献,搜索用时 140 毫秒
1.
2.
3.
影响DOA精度因素的研究 总被引:1,自引:0,他引:1
在信号DOA估计中,基于子空间旋转不变性的TLS-ESPRIT算法深受欢迎。文中首先介绍了TLS-ESPRIT算法并简要的对该算法进行分析。同时针对空间存在单信号和多信号两种情况,分析了影响TLS-ESPRIT算法精度的因素,主要讨论了入射角大小和空间存在多信号源对算法估计精度的影响,在计算机上进行了仿真研究,并得出结论。同时给出了提高TLS-ESPRIT算法适用范围,减小误差的有效方法。 相似文献
4.
5.
6.
7.
8.
针对传统共变算法在对称α稳定分布(SαS)噪声中方差趋于无穷,实际应用效果不佳的缺点,本文提出了一种基于预处理的共变时差估计算法,该算法将接收信号通过任意满足奇对称单调增的有界函数进行预处理后,再使用共变算法,理论证明了改进算法方差降为了有限值,从而提高了时差估计精度及算法实际应用价值。最后提出了两种满足上述条件的预处理函数,并对其和已有的反正切函数进行仿真,验证了本文算法在SαS分布噪声环境下提高算法估计精度的有效性和在高斯噪声环境下的适用性。 相似文献
9.
根据自回归(AR) SαS模型的α谱,分析了基于分数低阶矩(FLOM)法估计AR SαS模型参数的不足.提出了一种基于分数低阶协方差(FLOC)的AR SαS模型参数估计方法,并给出了基于FLOC的AR SαS模型α谱方法.分别对AR SαS模型参数的估计、α稳定分布噪声中单一正弦信号的估计和两个正弦信号的分辨进行了仿真.仿真结果表明,基于FLOC的AR SαS模型α谱估计方法对于不同的α值均具有较好的韧性.特别是在α值较小,即α稳定分布噪声概率密度函数(PDF)拖尾比较严重时,本文所提出的基于FLOC的AR SαS模型α谱估计方法,其性能明显优于基于FLOM的AR SαS模型α谱估计方法. 相似文献
10.
11.
12.
13.
14.
运用特征子空间分析方法的关键问题在于信号或噪声子空间的估计,在实际中有些信号的统计特性通常是随时间变化的,这时需要随时根据新的阵列接收数据对信号或噪声子空间进行更新,以得到参数的实时估计值,在该文中建立了多维信号参量联合估计的3D Unitary ESPRIT算法,然后提出了基于球面平均 ULV分解的子空间跟踪算法,将子空间跟踪算法与多维信号多量联合估计算法相结合,得到多维时变信号参数的跟踪估计算法,仿真计算结果验证了该算法的有效性。 相似文献
15.
Modified ESPRIT (M-ESPRIT) algorithm for time delay estimation in both any noise and any radar pulse context by a GPR radar 总被引:1,自引:0,他引:1
This paper presents M-ESPRIT, a modified version of the ESPRIT algorithm, for the purpose of time delay estimation of backscattered radar signals. The proposed algorithm takes both the transmitted pulse shape and any noise into account. It can process raw data from experimental device without the preprocessing which would be required with the conventional ESPRIT algorithm. 相似文献
16.
一种新的子空间跟踪方法在DOA估计中的应用 总被引:1,自引:0,他引:1
介绍了一种新的子空间跟踪方法(双迭代最小二乘(Bi—LS)子空间跟踪方法)在DOA估计中的应用。特征子空间方法的关键是对信号或噪声子空间的估计。在实际中,有些信号的统计特性是时变的,为得到参数的即时估计值,需要随时根据新的阵列接受数据对信号或噪声子空间进行更新。将Bi—LS子空间跟踪算法和自适应ESPRIT算法相结合,形成一种快速递推的自适应ESPRIT算法,对时变信号DOA进行跟踪估计。其计算复杂度小,仿真结果验证了该算法的有效性。 相似文献
17.
该文提出了一种基于QR分解的Power-ESPRIT (以下简称QP-ESPRIT算法) 新算法。首先使用采样数据协方差矩阵的幂(Power)获得噪声子空间的估计,然后对噪声子空间进行QR分解并使用R矩阵估计信源个数,提出了无特征分解的信源个数检测算法SDWED算法。进而,信号子空间的特征向量就可以由Q矩阵确定,从而应用ESPRIT算法获得信源波达方向的估计。该算法不需要预先知道信源个数的先验知识以及分离信号与噪声特征值的门限。在确定信源个数和子空间估计的同时,本文算法与传统的基于奇异值分解算法相比,具有近似性能时却拥有较低的计算复杂度。仿真结果证明了该方法的有效性。 相似文献
18.
Multiresolution ESPRIT algorithm 总被引:4,自引:0,他引:4
Lemma A.N. van der Veen A.-J. Deprettere E.F. 《Signal Processing, IEEE Transactions on》1999,47(6):1722-1726
Multiresolution ESPRIT is an extension of the ESPRIT direction finding algorithm to antenna arrays with multiple baselines. A short (half wavelength) baseline is necessary to avoid aliasing, and a long baseline is preferred for accuracy. The MR-ESPRIT algorithm allows the combination of both estimates. The ratio of the longest baseline to the shortest one is a measure of the gain in accuracy. Because of various factors, including noise, signal bandwidth, and measurement error, the achievable gain in accuracy is bounded 相似文献
19.
20.
Certain array geometries greatly simplify and enhance high resolution array processing. Two techniques are used-the ESPRIT algorithm, which employs two shifted but otherwise identical subarrays, and forward-backward averaging, which can be applied to axis-symmetrical arrays. The former has been shown to provide an efficient solution to bearing estimation while the latter incorporates the a priori knowledge about the symmetry, effectively increasing the number of data vectors available and decorrelating coherent or highly correlated signals. A combination of the two techniques implies a special array geometry that includes uniformly spaced linear arrays. The resulting algorithm yields parameter estimates that are constrained on the unit circle, satisfying the postulated data model provided merely that the arguments of these estimates are distinct. However, if the arguments of some parameter estimates coincide in a given scenario, the ESPRIT algorithm does not yield different results for distinct signals and these estimates can be rejected. Perhaps the most significant advantage of combining forward-backward averaging with ESPRIT parameter estimation is the substantial reduction in computational complexity that can be achieved. Based on the centro-Hermitian property of the data and noise covariance matrices, the computational complexity of the ESPRIT solution is reduced almost by a factor of four and the algorithm can be formulated entirely over the field of real numbers 相似文献