A modular pipelined implementation of a delayed LMS transversal adaptive filter

The problem of efficiently realizing a delayed least-mean-squares (DLMS) transversal adaptive filter is investigated. A time-shifted version of the DLMS algorithm is derived. Due to its order recursive nature, the restructured algorithm is well suited to parallel implementation. In addition, a pipelined systolic-type architecture which implements the algorithm is presented. The performance of the pipelined system is analyzed, and equations for speedup are derived. The pipelined system is capable of much greater throughput than existing conventional least-mean-square (LMS) implementations, making it a good candidate for real-time applications where high sampling rates are required. Also, due to its high modular nature, the system is easily expandable.<<ETX>>

[1]  R. E. Kalman,et al.  Aspects of network and system theory , 1971 .

[2]  Thomas K. Miller,et al.  An SIMD Multiprocessor Ring Architecture for the LMS Adaptive Algorithm , 1986, IEEE Trans. Commun..

[3]  Fuyun Ling,et al.  The LMS algorithm with delayed coefficient adaptation , 1989, IEEE Trans. Acoust. Speech Signal Process..

[4]  T. Meng,et al.  Arbitrarily high sampling rate adaptive filters , 1987, IEEE Trans. Acoust. Speech Signal Process..

[5]  Dharma P. Agrawal,et al.  Adaptive lattice filter implementations on pipelined multiprocessor architectures , 1990, IEEE Trans. Commun..

[6]  S. T. Alexander,et al.  Channel Equalization Using Adaptive Lattice Algorithms , 1979, IEEE Trans. Commun..

[7]  Shuyang Shi,et al.  Adaptive reference echo cancellation with memory structure , 1991, China., 1991 International Conference on Circuits and Systems.

[8]  S. Tewksbury,et al.  Multiprocessor Implementation of Adaptive Digital Filters , 1983, IEEE Trans. Commun..