摘要
由于传统相位干涉仪大部分采用多维搜索解模糊,存在计算量大等问题。文章研究了多基线下相位干涉仪解模糊快速算法,提出了一种基于最长基线相位差解模糊的算法,并分析了算法的理论依据。本文算法将传统的多维搜索问题转化为一维搜索,降低了计算量。仿真试验表明,本文算法在相位差误差大于传统的双基线解模糊要求相位差误差上限的情况下,也能正确解模糊,降低了对相位差噪声的要求;并与直接搜索法测向和多组解模糊波达角估计算法进行比较,表明本文算法不仅计算量小而且测向正确率高,具有一定的工程应用价值。
There is a problem that the calculation is large in unwrapping phase ambiguity of in- terferometer, because it mostly needs to search multiple dimensions. The quickly unwrapping phase ambiguity algorithm of muhi-baseline interferometer is studied in the passage. And a new quickly unwrapping phase ambiguity algorithm is put forward based on the phase difference of the longest baseline when the phase ambiguity is used to estimate direction of arriw^l. The re- quirement is calculated. The algorithm transforms the problem from multi-dimensional search- ing to one-dimensional searching and leads to reduce computation cost. The simulation results suggest that the algorithm reduces the requirements of the noise of phase difference, the calcu- lation is smaller, and the accuracy is higher, comparing with the estimation of direction of arri- val by searching directly and muhi-pare unwrap ambiguity.
出处
《电子对抗》
2014年第6期9-13,共5页
Electronic Warfare
关键词
相位干涉仪
长基线
解模糊
phase interferometer
the longest baseline
unwrap ambiguity