.png){kind=icon}
.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
GCD (Greatest Common Divisor)
MUSIC (MUltiple SIgnal classification)
Parameter Estimation
COFE (COmmon Factor Estimation)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。