Applications of Polynomial Common Factor Computation in Signal Processing

We consider the problem of computing the greatest common divisor of a set of univariate polynomials and present applications of this problem in system theory and signal processing. One application is blind system identification: given the responses of a system to unknown inputs, find the system. Assuming that the unknown system is finite impulse response and at least two experiments are done with inputs that have finite support and their Z-transforms have no common factors, the impulse response of the system can be computed up to a scaling factor as the greatest common divisor of the Z-transforms of the outputs. Other applications of greatest common divisor problem in system theory and signal processing are finding the distance of a system to the set of uncontrollable systems and common dynamics estimation in a multi-channel sum-of-exponentials model.

[1]  Zhonggang Zeng,et al.  The approximate GCD of inexact polynomials , 2004, ISSAC '04.

[2]  M. N. Belur,et al.  Computing approximate GCD of univariate polynomials , 2010, 18th Mediterranean Conference on Control and Automation, MED'10.

[3]  Daniel Boley,et al.  Measuring how far a controllable system is from an uncontrollable one , 1986, IEEE Transactions on Automatic Control.

[4]  Harish K. Pillai,et al.  Computing the radius of controllability for state space systems , 2012, Syst. Control. Lett..

[5]  Ludwig Elsner,et al.  An algorithm for computing the distance to uncontrollability , 1991 .

[6]  N. Higham.  MATRIX NEARNESS PROBLEMS AND APPLICATIONS , 1989 .

[7]  Sabine Van Huffel,et al.  An algorithm for approximate common divisor computation , 2006 .

[8]  Jan C. Willems,et al.  Introduction to Mathematical Systems Theory. A Behavioral , 2002 .

[9]  Petre Stoica,et al.  Common factor estimation and two applications in signal processing , 2004, Signal Process..

[10]  Sabine Van Huffel,et al.  Common pole estimation in multi-channel exponential data modeling , 2006, Signal Process..

[11]  I. Markovsky,et al.  Model order estimation based on a method for computing distance to uncontrollability , 2016 .

[12]  J. Willems.  Paradigms and puzzles in the theory of dynamical systems , 1991 .

[13]  Ming Gu,et al.  Fast Methods for Estimating the Distance to Uncontrollability , 2006, SIAM J. Matrix Anal. Appl..

[14]  T. Kailath,et al.  A least-squares approach to blind channel identification , 1995, IEEE Trans. Signal Process..

[15]  Ivan Markovsky,et al.  Variable projection methods for approximate (greatest) common divisor computations , 2017, Theor. Comput. Sci..

[16]  Karim Abed-Meraim,et al.  Blind system identification , 1997, Proc. IEEE.

[17]  Daniel Kressner,et al.  On the structured distance to uncontrollability , 2009, Syst. Control. Lett..

[18]  C. Paige.  Properties of numerical algorithms related to computing controllability , 1981 .

[19]  F Rikus Eising,et al.  Between controllable and uncontrollable , 1984 .

[20]  Edward J. Davison,et al.  Real controllability/stabilizability radius of LTI systems , 2004, IEEE Transactions on Automatic Control.

[21]  Yingbo Hua,et al.  A subspace method for the computation of the GCD of polynomials , 1997, Autom..

[22]  David Rupprecht.  An algorithm for computing certified approximate GCD of n univariate polynomials , 1999 .

[23]  Petre Stoica,et al.  Common factor detection and estimation , 1997, Autom..

[24]  Nicola Guglielmi,et al.  An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility , 2017, SIAM J. Numer. Anal..

[25]  L. Lathauwer,et al.  Sum-of-exponentials modeling and common dynamics estimation using Tensorlab , 2017 .

[26]  Zhonggang Zeng,et al.  The approximate GCD of inexact polynomials Part II: a multivariate algorithm , 2004, ISSAC 2004.

[27]  Eric Moulines,et al.  Subspace methods for the blind identification of multichannel FIR filters , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[28]  Adrian S. Lewis,et al.  Pseudospectral Components and the Distance to Uncontrollability , 2005, SIAM J. Matrix Anal. Appl..

[29]  Dario Bini,et al.  A Fast Algorithm for Approximate Polynomial GCD Based on Structured Matrix Computations , 2010 .

[30]  Erich Kaltofen,et al.  Challenges of Symbolic Computation: My Favorite Open Problems , 2000, J. Symb. Comput..