A Descent Algorithm-Based Parallel Variable Dual Matrix Model and Application to Blind Source Separation

• Published in: Circuits, systems, and signal processing Vol. 34; no. 1; pp. 269 - 300
• Main Authors: Zeng, T.-J., Feng, Q.-Y.
• Format: Journal Article
• Language: English
• Published: Boston Springer US 01.01.2015; Springer Nature B.V
• Subjects: Algorithms; Circuits and Systems; Constraints; Convergence; Cost function; Descent; Electrical Engineering; Electronics and Microelectronics; Engineering; Instrumentation; Mathematical models; Matrix; Searching; Signal processing; Signal,Image and Speech Processing; Variables; Blind source separation; Joint diagonalization; Parallel variable dual-matrix model; Descent algorithm
• ISSN: 0278-081X; 1531-5878
• DOI: 10.1007/s00034-014-9847-9

In this paper, we focus on the problem of blind source separation (BSS). To solve the problem efficiently, a new algorithm is proposed. First, a parallel variable dual-matrix model (PVDMM) that considers all the numerical relations between a mixing matrix and a separating matrix is proposed. Different constrained terms are used to construct the cost function for every sub-algorithm. These constrained terms reflect a numerical relation. Therefore, a number of undesired solutions are excluded, the search region is reduced, and the convergence efficiency of the algorithm is ultimately improved. Parallel sub-algorithms are proven to converge to a separable matrix only if the cost function approaches zero. Second, a descent algorithm (DA) as a PVDMM optimizing approach is proposed in this paper as well. Apparently, the efficiency of the algorithm depends completely on the DA. Unlike the traditional descent method, the DA defines step length by solving inequality instead of merely utilizing the Wolfe- or Armijo-type search rule. Stimulation results indicate that the DA can improve computational efficiency. Under mild conditions, the DA has been proven to have strong convergence properties. Numerical results also show that the method is very efficient and robust. Finally, we applied the combinative algorithm to the BSS problem. Computer simulations illustrate its good performance.