1995
DOI: 10.1109/74.370583
|View full text |Cite
|
Sign up to set email alerts
|

Using the matrix pencil method to estimate the parameters of a sum of complex exponentials

Abstract: The approximation of a hnction by a sum of complex exponentials is a problem that is at least two centuries old. Fundamentally, all techniques discussed in this article proceed from using the same sequence of data samples and vary only, but importantly, in how those samples are used in achieving the parameter estimation. All of these techniques, in other words, seek the same quantitative parameters to represent the sampled data, but use different routes to get there. The techniques for estimating the parameter… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
532
0
8

Year Published

1999
1999
2015
2015

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 1,030 publications
(542 citation statements)
references
References 38 publications
(12 reference statements)
2
532
0
8
Order By: Relevance
“…Note that more advanced methods for computing the unknown frequencies were developed, such as matrix pencil methods. In [13,14] a relationship between the matrix pencil methods and several variants of the ESPRIT method [15,16] is derived showing comparable performance. Now we replace the steps 1 -5 of Algorithm 4.7 by the least squares ESPRIT method [17, p. 493].…”
Section: Nmmentioning
confidence: 99%
See 1 more Smart Citation
“…Note that more advanced methods for computing the unknown frequencies were developed, such as matrix pencil methods. In [13,14] a relationship between the matrix pencil methods and several variants of the ESPRIT method [15,16] is derived showing comparable performance. Now we replace the steps 1 -5 of Algorithm 4.7 by the least squares ESPRIT method [17, p. 493].…”
Section: Nmmentioning
confidence: 99%
“…Clearly, we can choose the parameter L similarly as suggested in [14] based on the accuracy ε 2 as in Algorithm 4.7. Furthermore we would like to point out that in Algorithm 4.8 the right singular vectors of H related to the small singular values are discarded, otherwise the Algorithm 4.7 uses right singular vectors related to the small singular values in order to compute the roots of the corresponding polynomials.…”
Section: Form the Perturbed Rectangular Hankel Matrix (32)mentioning
confidence: 99%
“…The interest for the characterization of targets led to the development of algorithms for finding resonance poles and their associated residues, using either the impulse response of targets in the time domain or their transfer function in the frequency domain [2,[9][10][11][12][13][14][15][16][17][18]. For our simulations, we can use any of existing methods of poles extraction.…”
Section: Resonances Poles Of Radar Targetsmentioning
confidence: 99%
“…Sensitivity to input time or frequency samples have been handled by the modified LSProny [54] and TLS-Prony [55] methods, and other techniques based on the use of the singular value decomposition [56]. The Matrix Pencil Method (MPM) [7] has also been used for applications in low signal-tonoise ratio environments. Iterative search methods based on NewtonRaphson methods are also applied [57].…”
Section: The Common Sem Solutionmentioning
confidence: 99%
“…Singular value decomposition methods, such as the Matrix Pencil Method [7] have recently been used to minimize the effects of minor fluctuations (improve tolerance to noisy data) in excitation or field strength on the accurate solution of poles and residues. Many recent papers treat SEM as an abstract procedure for approximation of the response of objects to incident radiation, in certain cases referring to Model-Based Parameter Estimation (MBPE), an abstraction of SEM [8][9][10].…”
Section: Introductionmentioning
confidence: 99%