In this paper, we propose an algorithm for real-time signal processing of convolutive blind source separation (CBSS), which is a promising technique for acoustic source separation in a realistic environment, e.g., room/office or vehicle. First, we apply an overlap-and-save (sliding windows with overlapping) strategy that is most suitable for real-time CBSS processing; this approach can also aid in solving the permutation problem. Second, we consider the issue of separating sources in the frequency domain. We introduce a modified correlation matrix of observed signals and perform CBSS by diagonalization of the matrix. Third, we propose a method that can diagonalize the modified correlation matrix by solving a so-called normal equation for CBSS. One desirable feature of our proposed algorithm is that it can solve the CBSS problem explicitly, rather than stochastically, as is done with conventional algorithms. Moreover, a real-time separation of the convolutive mixtures of sources can be performed. We designed several simulations to compare the effectiveness of our algorithm with its counterpart, the gradient-based approach. Our proposed algorithm displayed superior convergence rates relative to the gradient-based approach. We also designed an experiment for testing the efficacy of the algorithm in real-time CBSS processing aimed at separating acoustic sources in realistic environments. Within this experimental context, the convergence time of our algorithms was substantially faster than that of the gradient-based algorithms. Moreover, our algorithm converges to a much lower value of the cost function than that of the gradient-based algorithm, ensuring better performance.
|Number of pages||15|
|Journal||IEEE Transactions on Circuits and Systems I: Regular Papers|
|Publication status||Published - Jan 2006|
- Convolutive blind source separation (CBSS)
- Explicit algorithm
- Modified correlation matrix
- Real-time processing