Title :
Linear complexity parallel algorithm for discrete-time Wiener filters with optimum lag
Author :
Koltracht, I. ; Kailath, T.
Author_Institution :
Dept. of Math., Connecticut Univ., Storrs, CT, USA
fDate :
10/1/1988 12:00:00 AM
Abstract :
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
Keywords :
filtering and prediction theory; filters; parallel algorithms; Toeplitz system; discrete-time Wiener filters; linear complexity; optimum lag; parallel algorithm; shifted right hand side; Computational complexity; Concurrent computing; Costs; Equations; Mathematics; Parallel algorithms; Signal processing; Signal processing algorithms; Speech processing; Wiener filter;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
