Mixing matrix estimation in UBSS based on homogeneous polynomials

Mixing matrix estimation in UBSS based on homogeneous polynomials

For access to this article, please select a purchase option:

Buy eFirst article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Signal Processing — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An algorithm is proposed for mixing matrix estimation in underdetermined blind source separation (UBSS) based on homogeneous polynomials representation, in order to blindly identify a mixing matrix in the case where the source signal is insufficiently sparse. First, the observed signal subspaces (hyperplanes) are identified by polynomial fitting, differentiation, and spectral clustering. Then, the intersection lines between clustering planes are estimated by using normal vectors of each subspace, which are finally proved to be column vectors of the mixing matrix up to scaling and ordering. Based on the algebraic-geometric theory, the proposed algorithm can improve the accuracy of mixing matrix estimation, without being influenced by convergence. Simulation results indicate that the proposed algorithm has higher estimation accuracy than traditional algorithms. Additionally, the single-source and multi-source points of the source signal can be detected simultaneously, which increases the robustness of the algorithm.

Related content

This is a required field
Please enter a valid email address