.png){kind=icon}
.png){kind=icon}
Return
Common factor estimation and two applications in signal processing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2003.11.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of finding common factors (or common roots) of a set of polynomials without rooting is of interest in many fields of research. When the polynomials are observed in noise, i.e., their coefficients are corrupted by errors, the problem becomes challenging. In this paper we suggest a method of estimating the greatest common divisor of a set of polynomials whose coefficients are perturbed by noise. The corresponding algorithm is called COFE (COmmon Factor Estimation). The COFE algorithm has several applications of which in this paper we discuss two in detail. One of these is MUSIC (MUltiple SIgnal Classification) which is reformulated as a COFE problem. The advantages of COFE MUSIC over the existing MUSIC is the case by which we estimate the parameters. The other application is system identification, where maximum likelihood estimates of the parameters of an ARARX system can be directly obtained by the suggested COFE algorithm in a simple manner. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
GCD (Greatest Common Divisor)
MUSIC (MUltiple SIgnal classification)
Parameter Estimation
COFE (COmmon Factor Estimation)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W
Organization
No organization information available