Abstract
In this letter, we present a new nonorthogonal algorithm for joint diagonalization of a set of symmetric matrices. The algorithm alternates between updates of individual demixing matrix rows, and the update of each row is transferred to solving the eigenvector problem. By using some blind source separation simulations, we show that the algorithm obviously obtains an improved performance when the signal-to-noise ratio of the observed signals is relatively low.
| Original language | English |
|---|---|
| Pages (from-to) | 41-44 |
| Number of pages | 4 |
| Journal | IEEE Signal Processing Letters |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2006 |
| Externally published | Yes |
Keywords
- Blind source separation (BSS)
- Eigenvalue and eigenvector
- Interference-to-signal ratio (ISR)
- Joint diagonalization
Fingerprint
Dive into the research topics of 'A new joint diagonalization algorithm with application in blind source separation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver