A QR-type algorithm for near-to-Toeplitz matrices

An alternative derivation is presented of a QR-type algorithm for near-to-Toeplitz matrices that arise in linear prediction, where the data matrix is arbitrarily windowed. The algorithm generalizes a result due to C.P. Rialan and L.L. Scharf (1988) and the derivation followed is believed to be more transparent than an equivalent result due to C.J. Demeure and L.L. Scharf (1987).<
>