基于均勻圓陣的MUSIC快速測向算法研究
發(fā)布時間：2018-07-28 14:05
【摘要】：基于均勻圓陣的MUSIC測向算法具有優(yōu)秀的性能,但是涉及的運(yùn)算復(fù)雜度很高,難以滿足實(shí)時性的要求。本文主要研究均勻圓陣的MUSIC快速測向算法,具體如下:(1) UCA-RB-MUSIC算法首先采用波束空間變換將均勻圓陣復(fù)雜的陣列流型變換為類似均勻線陣的范德蒙結(jié)構(gòu),然后采用一種酉變換實(shí)現(xiàn)波束空間數(shù)據(jù)協(xié)方差矩陣由復(fù)數(shù)域到實(shí)數(shù)域的轉(zhuǎn)換。本文針對UCA-RB-MUSIC算法中酉變換運(yùn)算復(fù)雜的問題,提出一種新的酉變換矩陣,其在不損失性能的同時減少了運(yùn)算復(fù)雜度。(2)子空間估計在高分辨率測向算法中占有舉足輕重的地位,但是它一般需要計算陣元接收數(shù)據(jù)協(xié)方差矩陣并對其做特征分解,運(yùn)算復(fù)雜度很高。對此,本文首先研究了特征分解的硬件實(shí)現(xiàn)算法,并對單側(cè)Jacobi算法進(jìn)行改進(jìn),使其在迭代運(yùn)算的同時以很小的硬件開銷實(shí)現(xiàn)特征向量按特征值大小的自動排序。其次,本文研究了基于多級維納濾波(MSWF)的快速子空間估計技術(shù),并對其在低信噪比情況下性能急劇下降的問題給出一種改進(jìn)方法。該方法改進(jìn)了低信噪比情況下的MSWF類子空間估計性能,但同時有一定概率引起偽峰的出現(xiàn)。(3)在研究波達(dá)方向估計問題過程中一般假設(shè)信源數(shù)為己知的,然而其在實(shí)際應(yīng)用中通常是需要估計的。對此,本文研究了基于MSWF的信源數(shù)估計方法,并針對其在低信噪比情況下性能急劇下降的問題提出一種改進(jìn)方法。(4)本文針對均勻圓陣的求根MUSIC算法中子空間估計過程運(yùn)算復(fù)雜、耗時大的問題,引入基于MSWF的快速子空間估計技術(shù),同時對其遞推過程采用一種預(yù)處理方法,使運(yùn)算過程由復(fù)數(shù)運(yùn)算轉(zhuǎn)為高效的實(shí)數(shù)運(yùn)算。均勻圓陣中MSWF類子空間估計方法依然存在低信噪比情況下性能急劇下降的問題,對此本文提出另一種改進(jìn)方法。該方法針對性能下降的本質(zhì)原因,大幅削弱噪聲對子空間估計性能的影響,但是該方法需要預(yù)估噪聲功率。MSWF類子空間估計方法與均勻圓陣求根MUSIC算法有多種組合方式,文章最后通過仿真實(shí)驗分析了多種組合方式的測向性能。
[Abstract]:The MUSIC direction finding algorithm based on uniform circular array has excellent performance, but the computational complexity involved is very high, so it is difficult to meet the requirement of real-time. In this paper, the MUSIC fast direction finding algorithm for uniform circular array is studied. The main results are as follows: (1) the complex array flow pattern of uniform circular array is transformed by UCA-RB-MUSIC algorithm into a Vandermonde structure similar to uniform linear array. Then a unitary transformation is used to transform the covariance matrix of beamspace data from complex domain to real field. Aiming at the complexity of unitary transformation in UCA-RB-MUSIC algorithm, a new unitary transformation matrix is proposed in this paper, which reduces the computational complexity without loss of performance. (2) subspace estimation plays an important role in high-resolution direction-finding algorithm. However, it usually needs to compute and decompose the covariance matrix of data received by elements, so it has a high computational complexity. In this paper, the hardware implementation algorithm of feature decomposition is studied firstly, and the one-sided Jacobi algorithm is improved to realize the automatic sorting of eigenvector by eigenvalue at the same time of iterating operation with very small hardware overhead. Secondly, the fast subspace estimation technique based on multistage Wiener filter (MSWF) is studied, and an improved method is proposed to solve the problem that its performance drops sharply in the case of low signal-to-noise ratio (SNR). This method improves the performance of MSWF subspace estimation under low SNR, but at the same time there is a certain probability to cause pseudo peaks. (3) in the study of DOA estimation, it is generally assumed that the number of sources is known. However, it usually needs to be estimated in practical applications. In this paper, the source number estimation method based on MSWF is studied, and an improved method is proposed to solve the problem of the sharp deterioration of its performance in the case of low signal-to-noise ratio. (4) the neutron space estimation process of MUSIC algorithm for uniform circular array is complex. In this paper, a fast subspace estimation technique based on MSWF is introduced, and a preprocessing method is used in the recursive process to change the operation from complex operation to efficient real number operation. The MSWF subspace estimation method in uniform circular array still has the problem of sharp degradation of performance in the case of low signal-to-noise ratio (SNR). In this paper, another improved method is proposed. The effect of noise on the performance of subspace estimation is greatly weakened for the essential cause of performance degradation. However, this method needs to estimate the noise power. MSWF-class subspace estimation method and uniform circular array root-finding MUSIC algorithm have many combinations. Finally, the performance of multiple combination methods is analyzed by simulation experiments.
【學(xué)位授予單位】：哈爾濱工程大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN911.7
本文編號：2150447
[Abstract]:The MUSIC direction finding algorithm based on uniform circular array has excellent performance, but the computational complexity involved is very high, so it is difficult to meet the requirement of real-time. In this paper, the MUSIC fast direction finding algorithm for uniform circular array is studied. The main results are as follows: (1) the complex array flow pattern of uniform circular array is transformed by UCA-RB-MUSIC algorithm into a Vandermonde structure similar to uniform linear array. Then a unitary transformation is used to transform the covariance matrix of beamspace data from complex domain to real field. Aiming at the complexity of unitary transformation in UCA-RB-MUSIC algorithm, a new unitary transformation matrix is proposed in this paper, which reduces the computational complexity without loss of performance. (2) subspace estimation plays an important role in high-resolution direction-finding algorithm. However, it usually needs to compute and decompose the covariance matrix of data received by elements, so it has a high computational complexity. In this paper, the hardware implementation algorithm of feature decomposition is studied firstly, and the one-sided Jacobi algorithm is improved to realize the automatic sorting of eigenvector by eigenvalue at the same time of iterating operation with very small hardware overhead. Secondly, the fast subspace estimation technique based on multistage Wiener filter (MSWF) is studied, and an improved method is proposed to solve the problem that its performance drops sharply in the case of low signal-to-noise ratio (SNR). This method improves the performance of MSWF subspace estimation under low SNR, but at the same time there is a certain probability to cause pseudo peaks. (3) in the study of DOA estimation, it is generally assumed that the number of sources is known. However, it usually needs to be estimated in practical applications. In this paper, the source number estimation method based on MSWF is studied, and an improved method is proposed to solve the problem of the sharp deterioration of its performance in the case of low signal-to-noise ratio. (4) the neutron space estimation process of MUSIC algorithm for uniform circular array is complex. In this paper, a fast subspace estimation technique based on MSWF is introduced, and a preprocessing method is used in the recursive process to change the operation from complex operation to efficient real number operation. The MSWF subspace estimation method in uniform circular array still has the problem of sharp degradation of performance in the case of low signal-to-noise ratio (SNR). In this paper, another improved method is proposed. The effect of noise on the performance of subspace estimation is greatly weakened for the essential cause of performance degradation. However, this method needs to estimate the noise power. MSWF-class subspace estimation method and uniform circular array root-finding MUSIC algorithm have many combinations. Finally, the performance of multiple combination methods is analyzed by simulation experiments.
【學(xué)位授予單位】：哈爾濱工程大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN911.7
【參考文獻(xiàn)】
相關(guān)期刊論文 前5條
1 于紅旗;黃知濤;周一宇;徐欣;;一種不需要特征值分解的MUSIC方法[J];國防科技大學(xué)學(xué)報;2007年04期
2 黃磊,吳順君,張林讓,馮大政;快速子空間分解方法及其維數(shù)的快速估計[J];電子學(xué)報;2005年06期
3 黃浩學(xué),吳嗣亮;基于均勻圓陣的信號源DOA和多普勒頻率估計算法[J];電子學(xué)報;2001年05期
4 吳仁彪;一種通用的高分辨率波達(dá)方向估計預(yù)處理新方法[J];電子科學(xué)學(xué)刊;1993年03期
5 殷勤業(yè),鄒理和,Robert W.Newcomb;一種高分辨率二維信號參量估計方法——波達(dá)方向矩陣法[J];通信學(xué)報;1991年04期
相關(guān)博士學(xué)位論文 前1條
1 趙大勇;陣列信號處理中的DOA估計關(guān)鍵技術(shù)研究[D];哈爾濱工程大學(xué);2011年
，本文編號：2150447
本文鏈接：http://sikaile.net/kejilunwen/wltx/2150447.html
最近更新
教材專著
