On the splitting of classical algorithms in linear prediction theory

The Levinson algorithm has been shown recently to be redundant in complexity. It can be broken down into two simpler algorithms; either of these "split Levinson algorithms" needs only to be processed. In the present paper it is shown that the Schur algorithm, the lattice algorithm, and the normalized lattice algorithm for computing reflection coefficients can be broken down in a similar manner. The number of multiplications in each of the resulting split algorithms is reduced, with respect to the classical version, by a factor lying between 1.5 and 2.