A new algorithm for complex non-orthogonal joint diagonalization based on shear and givens rotations

  • Mesloub A
  • Abed-Meraim K
  • Belouchrani A
  • 11

    Readers

    Mendeley users who have this article in their library.
  • 17

    Citations

    Citations of this article.

Abstract

This paper introduces a new algorithm to approximate non-orthogonal joint diagonalization (NOJD) of a set of complex matrices. This algorithm is based on the Frobenius norm formulation of the joint diagonalization (JD) problem and takes advantage from combining Givens and Shear rotations to attempt the approximate JD. It represents a non-trivial generalization of the JDi (Joint Diagonalization) algorithm (Souloumiac 2009) to the complex case. The JDi is first slightly modified then generalized to the CJDi (i.e., Complex JDi) using complex to real matrix transformation. Several methods already exist in the literature. Consequently, we provide herein a brief overview of existing NOJD algorithms. Then we provide an extensive comparative study to illustrate the effectiveness and stability of the CJDi with respect to various system parameters and application contexts.

Author-supplied keywords

  • Givens and shear rotations
  • Non-orthogonal joint diagonalization
  • Performance comparison of NOJD algorithm

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free