Adaptive pilot filtering for LMS algorithm
W.Y. Chen
Abstract
W.Y. Chen
Abstract
An adaptive pilot filtering procedure is proposed to increase the convergence speed of the LMS (least mean square) algorithm. The procedure uses an adaptive filter with only a few filter coefficients to filter both the received signal and the original signal for the purpose of whitening the received signal. The convergence speed of the adaptive pilot filtering procedure combined with the LMS algorithm is comparable to that of the Kalman algorithm for some applications. The procedure combined with the main LMS algorithm requires less than twice the computation power of a conventional LMS algorithm.>
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An adaptive pilot filtering procedure is proposed to increase the convergence speed of the LMS (least mean square) algorithm. The procedure uses an adaptive filter with only a few filter coefficients to filter both the received signal and the original signal for the purpose of whitening the received signal. The convergence speed of the adaptive pilot filtering procedure combined with the LMS algorithm is comparable to that of the Kalman algorithm for some applications. The procedure combined with the main LMS algorithm requires less than twice the computation power of a conventional LMS algorithm.>
Key concepts: Adaptive filter, Least mean squares filter, Algorithm, Convergence (economics), Computer science, Computation, SIGNAL (programming language), Kalman filter