.png){kind=icon}
返回
A recursive solution to nonunitary joint diagonalization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2012.06.020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Joint diagonalization of a set of matrices is an essential tool in many signal processing applications. This letter is devoted to seeking a recursive solution to nonunitary joint diagonalization. The proposed algorithm recursively minimizes an exponentially wind-owed least squares (LS) criterion, leading to a computationally cheaper recursive update rule for joint diagonalization. This merit enables us to develop (block) online algorithm for source separation and other applications. Simulation results on synthetic data and blind separation of real speech signals validate the effectiveness of the proposed algorithm. (C) 2012 Published by Elsevier B.V.
Keyword:
Joint diagonalization (JD)
Recursive solution
Blind source separation (BSS)
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
Expression of Tankyrase 1 in Gastric Cancer and Its Correlation with Telomerase ActivityTankyrase 1在胃癌中的表达及其与端粒酶活性的相关性
PREAI
分享收藏分享收藏
分享收藏A preliminary investigation into the use of acid-tolerant precipitated calcium carbonate fillers in papermaking of deinked pulp derived from recycled newspaper.png)
BioResources
OAAI
BioResourcesIF0
OAAI分享收藏
查看更多内容