Modular architectures for adaptive multichannel lattice algorithms

Abstract

A modular architecture for adaptive multichannel lattice algorithms is presented. This architecture requires no matrix computations and has a regular structure, which significantly simplifies its implementation as compared to the multichannel (matrix) version of the same algorithms. Because the suggested architecture exhibits a high degree of parallelism and local communication, it is well suited for implementation in dedicated (VLSI) hardware. The derivation of this modular architecture demonstrates a powerful principle for modular decomposition of multichannel recursions into systolic-arraylike architectures. The scope of applicability of this principle extends beyond multichannel lattice (and related least-squares) algorithms to other algorithms involving matrix computations, such as multiplication; factorization, and inversion.