SLIDING WINDOWS AND LATTICE ALGORITHMS FOR COMPUTING QR FACTORS IN THE LEAST-SQUARES THEORY OF LINEAR PREDICTION

In this correspondence we pose a sequence of linear prediction problems that differ a little from those previously posed. The solutions to these problems introduce a family of “sliding” window techniques into the least squares theory of linear prediction. By using these techniques we are able to QR factor the Toeplitz data matrices that arise in linear prediction. The matrix Q is an orthogonal version of the data matrix and the matrix R is a Cholesky factor of the experimental correlation matrix. Our QR and Cholesky algorithms generate generalized reflection coefficients that may be used in the usual ways for analysis, synthesis, or classification. © 1990 IEEE