{'fraction_non_alphanumeric': 0.013062409288824383, 'fraction_numerical': 0.0, 'mean_word_length': 4.897435897435898, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Mean weight behavior of the Filtered-X LMS algorithm

This paper presents a stochastic analysis of the Filtered-X LMS algorithm. The mean weight vector recursion is derived for slow adaptation and for a white reference signal without use of independence theory. The Wiener solution is determined explicitly as a function of the input statistics and the impulse responses of the primary and secondary signal paths. It is shown that the steady-state mean weights for the Filtered-X LMS algorithm converge to the Wiener solution only if the estimate of the secondary path is without error. Monte Carlo simulations show excellent agreement with the behavior predicted by the theoretical model.