Journal of Xidian University

Previous Articles     Next Articles

Tensor decomposition of generalized generating function-based blind identification of underdetermined mixtures

ZHOU Zhiwen;HUANG Gaoming;GAO Jun   

  1. (College of Electronic Engineering, Naval Univ. of Engineering, Wuhan  430033, China)
  • Received:2015-07-20 Online:2016-10-20 Published:2016-12-02
  • Contact: ZHOU Zhiwen E-mail:mini_paper@sina.com
  • Supported by:

    周志文(1989-),男,海军工程大学博士研究生,E-mail:mini_paper@sina.com.

Abstract:

Aimed at the problem of underdetermined blind identification, an algorithm based on generalized generating function decomposition is proposed, which no longer imposes sparsity restrictions on source signals. First, the second derivative matrices of the generalized generating function are stacked to the third-order tensor form, from which the number of source signals can be blindly estimated. Then the tensor is decomposed with singular value decomposition, and the mixture matrix is estimated by the joint diagonalization method. Simulation results validate the effectiveness of the proposed algorithm, and show that the proposed algorithm can acquire a better estimation precision than other classical algorithms with the same SNRs in the conditions of well-posed and underdetermined mixtures, meanwhile it extends the field of blind source separation application via the generalized generating function restricted only to the well-posed case.

Key words: underdetermined blind identification, general generating function, tensor decomposition, joint diagonalization, sparse component analysis

CLC Number: 

  • null