Prony's method

Prony analysis of a time-domain signal

Prony analysis (Prony's method) was developed by Gaspard Riche de Prony in 1795. However, practical use of the method awaited the digital computer. Similar to the Fourier transform, Prony's method extracts valuable information from a uniformly sampled signal and builds a series of damped complex exponentials or damped sinusoids. This allows the estimation of frequency, amplitude, phase and damping components of a signal.

The method

Let f(t) be a signal consisting of N evenly spaced samples. Prony's method fits a function

f̂(t)=∑i=1NAieσitcos⁡(ωit+ϕi)

to the observed f(t). After some manipulation utilizing Euler's formula, the following result is obtained, which allows more direct computation of terms:

f̂(t)=∑i=1N12Ai(ejϕieλi+t+e−jϕieλi−t),

where

λi±=σi±jωi are the eigenvalues of the system,
σi=−ω0,iξi are the damping components,
ωi=ω0,i1−ξi2 are the angular-frequency components,
ϕi are the phase components,
Ai are the amplitude components of the series,
j is the imaginary unit (j2=−1).

Representations

Prony's method is essentially a decomposition of a signal with M complex exponentials via the following process:

Regularly sample f̂(t) so that the n-th of N samples may be written as

Fn=f̂(Δtn)=∑m=1MBmeλmΔtn,n=0,…,N−1.

If f̂(t) happens to consist of damped sinusoids, then there will be pairs of complex exponentials such that

Bi(1)=12Aieϕij,Bi(2)=12Aie−ϕij,λi(1)=σi+jωi,λi(2)=σi−jωi,

where

Bi(1)eλi(1)t+Bi(2)eλi(2)t=12Aieϕije(σi+jωi)t+12Aie−ϕije(σi−jωi)t=Aieσitcos⁡(ωit+ϕi).

Because the summation of complex exponentials is the homogeneous solution to a linear difference equation, the following difference equation will exist:

f̂(Δtn)=∑m=1Mf̂[Δt(n−m)]Pm,n=M,…,N−1.

The key to Prony's Method is that the coefficients in the difference equation are related to the following polynomial:

zM−P1zM−1−⋯−PM=∏m=1M(z−eλm).

These facts lead to the following three steps within Prony's method:

1) Construct and solve the matrix equation for the Pm values:

[FM⋮FN−1]=[FM−1…F0⋮⋱⋮FN−2…FN−M−1][P1⋮PM].

Note that if N≠2M, a generalized matrix inverse may be needed to find the values Pm.

2) After finding the Pm values, find the roots (numerically if necessary) of the polynomial

zM−P1zM−1−⋯−PM.

The m-th root of this polynomial will be equal to eλm.

3) With the eλm values, the Fn values are part of a system of linear equations that may be used to solve for the Bm values:

[Fk1⋮FkM]=[(eλ1)k1…(eλM)k1⋮⋱⋮(eλ1)kM…(eλM)kM][B1⋮BM],

where M unique values ki are used. It is possible to use a generalized matrix inverse if more than M samples are used.

Note that solving for λm will yield ambiguities, since only eλm was solved for, and eλm=eλm+q2πj for an integer q. This leads to the same Nyquist sampling criterion to which discrete Fourier transforms are subject

|Im⁡(λm)|=|ωm|<πΔt.

See also

Notes

  1. ↑ Hauer, J. F.; Demeure, C. J.; Scharf, L. L. (1990). "Initial results in Prony analysis of power system response signals". IEEE Transactions on Power Systems. 5 (1): 80–89. Bibcode:1990ITPSy...5...80H. doi:10.1109/59.49090. hdl:10217/753.

References