幂迭代超分辨率快速算法
POWER ITERATION SUPPER-RESOLUTION FAST ALGORITHM
-
摘要: 本文提出了一种阵列信号超分辨率快速算法,并分析了它的收敛速度。这种算法基于协方差矩阵的特征值平移和矩阵的幂迭代,而不需要矩阵求逆。它的收敛速度快,一般只需几次迭代就能收敛,且算法结构简单,易于实现。
-
关键词:
- 阵列信号处理; 超分辨率; 快速算法
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]张永军，陈宗骘.特征值平移超分辨率算法.电子科学学刊,1996, 18(5): 449-454. -
计量
- 文章访问数: 2448
- HTML全文浏览量: 61
- PDF下载量: 394
- 被引次数: 0
下载:
