Efficient implementation of linear predictive coding algorithms

Abstract

In linear predictive coding (LPC) analysis, the linear predictors are computed using the classical Levinson-Durbin algorithm. But the Levinson-Durbin algorithm is a processing bottleneck as it involves the addition of inner products in the calculation of the reflection coefficients. This paper develops and reports on modifications to the algorithm used in various speech processing and coding applications for efficient implementations.