Journal
IEEE TRANSACTIONS ON SIGNAL PROCESSING
Volume 62, Issue 8, Pages 1913-1925Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2014.2303947
Keywords
Givens and Shear rotations; non-orthogonal joint diagonalization; performance comparison of NOJD algorithm
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available