冪迭代超分辨率快速算法
POWER ITERATION SUPPER-RESOLUTION FAST ALGORITHM
-
摘要: 本文提出了一種陣列信號(hào)超分辨率快速算法,并分析了它的收斂速度。這種算法基于協(xié)方差矩陣的特征值平移和矩陣的冪迭代,而不需要矩陣求逆。它的收斂速度快,一般只需幾次迭代就能收斂,且算法結(jié)構(gòu)簡(jiǎn)單,易于實(shí)現(xiàn)。
-
關(guān)鍵詞:
- 陣列信號(hào)處理; 超分辨率; 快速算法
Abstract: This paper provides array signal processing super-resolution fast algorithm. This algorithm based on the eigenvalue value shift of covariance matrix and its power iteration. It does not needs the inverse matrix. It converges quickly and only needs several iteration to converge to solution. Its architecture is very simple and easily implemented. -
Durrani T S, Sharman K C. Eigenfilter approaches to adaptive array processing. IEE Proc.-F, 1983, 130(1): 22-28.[2]Cadzow J A, Kim Y S, Shine D C. General direction-of-arrival estimation: A signal subspace approaches. IEEE Trans. on AES, 1987, AES-25(1): 32-47.[3]張永軍，陳宗騭.特征值平移超分辨率算法.電子科學(xué)學(xué)刊,1996, 18(5): 449-454. -
計(jì)量
- 文章訪問(wèn)數(shù): 2515
- HTML全文瀏覽量: 78
- PDF下載量: 399
- 被引次數(shù): 0
下載:
