Journal of Northeastern University(Natural Science) ›› 2024, Vol. 45 ›› Issue (3): 305-313.DOI: 10.12068/j.issn.1005-3026.2024.03.001

• Information & Control •     Next Articles

Jacobi-like Joint Diagonalization Algorithm Based on QR Decomposition

Ce JI1,2, Ye LI1(), Bo-qun LI3   

  1. 1.School of Computer Science & Engineering,Northeastern University,Shenyang 110169,China
    2.Key Laboratory of Intelligent Computing in Medical Image,Ministry of Education,Northeastern University,Shenyang 110169,China
    3.School of Electronic and Information Engineering,University of Science and Technology Liaoning,Anshan 114051,China.
  • Received:2022-11-11 Online:2024-03-15 Published:2024-05-17
  • Contact: Ye LI
  • About author:LI Ye,E-mail:liye.dongda@foxmail.com

Abstract:

In order to improve the blind separation performance of approximate joint diagonalization of real matrix sets and to avoid trivial solutions, a Jacobi?like joint diagonalization algorithm based on QR decomposition is proposed. Using the numerical stability of QR decomposition, the Jacobi rotation matrix is used to decompose the separation matrix into the product of several elementary triangular matrices and orthogonal matrices. The structure of Jacobi rotation matrix and the related elements of the target matrix transformation are used to obtain the optimal parameters. The high-dimensional minimization problem is iteratively transformed into a series of low-dimensional sub-problems, which enhances the recovery accuracy of the source signal. The algorithm complexity is reduced by solving the simplified Frobenius-norm objective function. The simulation results of mixed electrocardiogram (ECG) signals show that compared with QRJ2D, LUCJD and EGJLUD, the proposed algorithm has certain advantages in separation accuracy and convergence speed.

Key words: blind source separation(BSS), non-orthogonal joint diagonalization, QR decomposition, Jacobi-like algorithm, ECG signal model

CLC Number: