The classical Levinson algorithm for computing the predictor polynomial relative to a real positive definite Toeplitz matrix is shown to be redundant in complexity. It can be broken down into two simpler algorithms, either of which needs only to be processed. This result can be interpreted in the fr...
No comments yet
Be the first to share your thoughts!