Parame tric Polynomial Spectral Fa ctoriza tion

摘要

For polynomial spectral factorization, an important mathematical tool in signal processingand control, an algebraic approach has been proposed by Kanno et al. that enables us to carryout parametric polynomial spectral factorization (PPSF). In this paper, we nvestigate theefficiency of PPSF by means of comprehensive Grobner systems (CGS). More specifically,three methods are devised and their computabilities are compared. A discussion on whichapproach is most suited to PPSF is provided, and furthermore remarks are given on how muchimprovement of CGS computation can be made for solving general practical problems.