In this chapter we show that the LMS algorithm can be speeded up without changing any of its adaptive characteristics. The parallel LMS adaptive filtering algorithm and its modifications are presented. High speed is achieved by increasing the parallelism in the LMS adaptive algorithm through a proper modification of the LMS adaptive algorithm. An iterative procedures for efficient computation of the lower triangular inverse matrix and the input signal covariance matrix are presented.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

High Speed Least Mean Square Adaptive Filtering

  • Rimantas Pupeikis,
  • Kazys Kazlauskas

摘要

In this chapter we show that the LMS algorithm can be speeded up without changing any of its adaptive characteristics. The parallel LMS adaptive filtering algorithm and its modifications are presented. High speed is achieved by increasing the parallelism in the LMS adaptive algorithm through a proper modification of the LMS adaptive algorithm. An iterative procedures for efficient computation of the lower triangular inverse matrix and the input signal covariance matrix are presented.