A Modified Burg Algorithm Equivalent In Results to Levinson Algorithm
Rami Kanhouche
Abstract
We present a new modified Burg-Like algorithm for spectral estimation and adaptive signal processing, that yield the same prediction coefficients given by the Levinson algorithm for the solution of the normal equations. An equivalency proof is given for both the 1D signal and 2D signal cases. Numerical simulations illustrate the improved accuracy and stability in spectral power amplitude and localization; especially in the cases of low signal to noise ratio, and (or) augmenting the used prediction coefficients number for a relatively short data records. Also our simulations illustrate that for relatively short data records the unmodified version of Burg Algorithm fail to minimize the mean square residual error beyond certain Order, while the new algorithm continue the minimization with Order elevation.
Create a lesson
Related papers
Sharp upper bounds for Steklov eigenvalues on warped products
Jade Brisson, Bruno Colbois, Alexandre Girouard et al.
Non-Bloch band theory for finite banded non-Hermitian Toeplitz matrices
Yannick de Bruijn, Erik Orvehed Hiltunen
Non-resonant angles in a Robin eigenvalue problem
Konstantin Pankrashkin
Sums of Dirichlet eigenvalues in proximity of the disk and the ball
Matthias Baur
On the inequality μ3 < λ1 for the eigenvalues of the Laplace operator
N. Filonov
Quantitative spectral stability and sharp Fourier estimates for periodic CMV matrices with decaying perturbations
Moacir Aloisio, César R. de Oliveira, Mariane Pigossi