本文選題：陣列信號(hào) + 波達(dá)方向�。� 參考：《計(jì)算機(jī)應(yīng)用研究》2014年12期

【摘要】：稀疏表示DOA估計(jì)算法具有很高的分辨率,但是其計(jì)算量較大。為此,提出一種基于預(yù)估計(jì)的稀疏表示DOA估計(jì)快速算法。首先,利用陣列協(xié)方差矩陣特征向量的性質(zhì),通過(guò)DFT對(duì)入射信號(hào)進(jìn)行DOA預(yù)估計(jì);其次,利用預(yù)估計(jì)結(jié)果降低過(guò)完備字典的長(zhǎng)度;最后,進(jìn)行稀疏分解得到DOA估計(jì)的精確結(jié)果。由于采用的字典長(zhǎng)度較短,該算法的計(jì)算量非常小。仿真實(shí)驗(yàn)結(jié)果表明,該算法具有較高的成功概率、較快的估計(jì)速度和較低的估計(jì)誤差。因此,提出的算法在工程實(shí)際中應(yīng)用前景廣闊。
[Abstract]:The sparse representation DOA estimation algorithm has a high resolution, but its computational complexity is large. For this reason, a fast algorithm based on pre estimation sparse representation for DOA estimation is proposed. First, the DOA preestimation is carried out on the incident signal through the DFT of the eigenvector of the array covariance matrix. Secondly, the preestimation results are used to reduce the overcomplete dictionary. In the end, the precise results of DOA estimation are obtained by sparse decomposition. Because of short dictionary length, the computational complexity of the algorithm is very small. The simulation experiment results show that the algorithm has high probability of success, faster estimation speed and lower estimation error. Therefore, the proposed algorithm has a broad application prospect in engineering practice.
【作者單位】： 電子工程學(xué)院通信對(duì)抗系;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(61171170)
【分類號(hào)】：TN911.23

【參考文獻(xiàn)】

相關(guān)期刊論文 前2條

1 李鵬飛;張e，

本文編號(hào)：1947812