A Fast Implementation of Burg's Method
Koen Vos · 2013
In this paper we derive an ecient implementation of the Burg method for maximum entropy spectral analysis. The new algorithm has a complexity of about Nm+5m 2 multiplications, compared to 3Nm m 2 for the conventional implementation, for data length N and order m. The algorithm also allows for straightforward regularization.