An efficient systolic array implementation of the sign-LMS algorithm

A bit-level systolic array of the implementation of the LMS algorithm is presented. The array is divided into a 2D convolver array and a linear updater array. The structure is 100% data flow efficient, requiring N/2 rows to implement N coefficients. The updater is made up of N/2 simple cells. The sign-LMS algorithm is used for updating the coefficients. All coefficients are updated every 2R clocks where R is the number of bits per coefficient and the clock is the bit-level clock (array clock). >

[1]  David B. Chester,et al.  A fully systolic adaptive filter implementation , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[2]  John M. Cioffi,et al.  A high-speed adaptive equalizer for magnetic disk drives , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[3]  John V. McCanny,et al.  OPTIMISED BIT LEVEL SYSTOLIC ARRAY FOR CONVOLUTION. , 1984 .

[4]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

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

[6]  John V. McCanny,et al.  Use of unidirectional data flow in bit-level systolic array chips , 1986 .

[7]  D. P. Agrawal,et al.  A modular pipelined implementation of a delayed LMS transversal adaptive filter , 1990, IEEE International Symposium on Circuits and Systems.