Superlattice/superladder computational organization for linear prediction and optimal FIR filtering
Elias Koukoutsis, G. Carayannis, Christos C. Halkias · IEEE Transactions on Signal Processing · 1991
A family of computational organizations for the solution of the Toeplitz systems appearing in the digital signal processing (DSP) techniques of linear prediction and optimal FIR filtering is presented. All these organizations are based on a structure called superlattice which governs the Toeplitz solving procedure and provides many possible implementations. Algorithmic schemes for the implementation of these organizations, suitable for single-processor and multiprocessor environments, are developed. Among them there are order recursive algorithms, parallel-algorithms of O(p) complexity which use O(p) processing elements, and partitioned-parallel algorithms. The last can make full use of any number of available, parallel-working processors, independently of the system order. Superlattice-type algorithms are described for many Toeplitz-based problems.>