Combined blind/nonblind source separation based on the natural gradient
M. Joho, H Mathis, G.S. Moschytz
Abstract
M. Joho, H Mathis, G.S. Moschytz
Abstract
It is a known fact that blind algorithms have convergence times of an order of magnitude longer than their nonblind counterparts. However, as shown in this letter, the knowledge of a subset of signals can greatly accelerate the convergence of blind source separation. The convergence behavior of the proposed algorithm is compared with the blind-only case.
OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is a known fact that blind algorithms have convergence times of an order of magnitude longer than their nonblind counterparts. However, as shown in this letter, the knowledge of a subset of signals can greatly accelerate the convergence of blind source separation. The convergence behavior of the proposed algorithm is compared with the blind-only case.
Key concepts: Convergence (economics), Blind signal separation, Mathematics, Computer science, Algorithm, Mathematical optimization, Telecommunications, Economics