Linear complexity parallel algorithm for discrete-time Wiener filters with optimum lag

A parallel algorithm of linear complexity for efficient updating of the solution of a Toeplitz system of equations with a shifted right hand side is presented. If in the initial system, the right-hand side is f=f(0), . . ., f(N), the whole computation will take 6N+1 multiplications/divisions and 3N+1 additions/subtractions per processor.<
>