Modular architectures for adaptive multichannel lattice algorithms

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.

[1]  E. Satorius,et al.  Application of Least Squares Lattice Algorithms to Adaptive Equalization , 1981, IEEE Trans. Commun..

[2]  B. Friedlander Lattice methods for spectral estimation , 1982, Proceedings of the IEEE.

[3]  Friedlander Recursive lattice forms for adaptive control , 1980 .

[4]  Monson H. Hayes,et al.  ARMA Modeling of time varying systems with lattice filters , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Lloyd J. Griffiths,et al.  An adaptive lattice structure for noise-cancelling applications , 1978, ICASSP.

[6]  M. Morf,et al.  Recursive least squares ladder estimation algorithms , 1981 .

[7]  Hanoch Lev-Ari Modular architectures for adaptive multichannel lattice algorithms , 1983, ICASSP.

[8]  Hideaki Sakai,et al.  Circular lattice filtering using Pagano's method , 1982 .

[9]  Thomas Kailath,et al.  Least-squares adaptive lattice and transversal filters: A unified geometric theory , 1984, IEEE Trans. Inf. Theory.

[10]  John G. Proakis,et al.  Adaptive Algorithms for Estimating and Suppressing Narrow-Band Interference in PN Spread-Spectrum Systems , 1982, IEEE Trans. Commun..

[11]  Thomas Kailath,et al.  Schur and Levinson algorithms for nonstationary processes , 1981, ICASSP.

[12]  Nasir Ahmed,et al.  On a realization and related algorithm for adaptive prediction , 1980 .

[13]  D. V. Bhaskar Rao,et al.  Wavefront Array Processor: Language, Architecture, and Applications , 1982, IEEE Transactions on Computers.

[14]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[15]  Hideaki Sakai,et al.  Recursive least squares circular lattice and escalator estimation algorithms , 1983 .

[16]  H. Lev-Ari Prediction Error Adaptive Multichannel Lattice Algorithms , 1983, 1983 American Control Conference.

[17]  H. T. Kung Why systolic architectures? , 1982, Computer.

[18]  M. Morf,et al.  Square root covariance ladder algorithms , 1982 .

[19]  T. Kailath,et al.  Normalized lattice algorithms for least-squares FIR system identification , 1983 .

[20]  R. C. Montgomery,et al.  Adaptive identification for the dynamics of large space structures , 1982 .

[21]  B. Friedlander,et al.  Lattice filters for adaptive processing , 1982, Proceedings of the IEEE.

[22]  Jean-Marc Delosme,et al.  Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.

[23]  F. Ling,et al.  A generalized multichannel least squares lattice algorithm based on sequential processing stages , 1984 .

[24]  J. G. McWhirter,et al.  Recursive Least-Squares Minimization Using A Systolic Array , 1983, Optics & Photonics.

[25]  Ilse C. F. Ipsen,et al.  Systolic Networks for Orthogonal Decompositions , 1983 .