A fast asymptotically efficient algorithm for blind separation of a linear mixture of block-wise stationary autoregressive processes

摘要

We propose a novel blind source separation algorithm called Block AutoRegressive Blind Identification (BARBI). The algorithm is asymptotically efficient in separation of instantaneous linear mixtures of blockwise stationary Gaussian autoregressive processes. A novel closed-form formula is derived for a Cramer Rao lower bound on elements of the corresponding Interference-to-Signal Ratio (ISR) matrix. This theoretical ISR matrix can serve as an estimate of the separation performance on the particular data. In simulations, the algorithm is shown to be applicable in blind separation of a linear mixture of speech signals.