{'fraction_non_alphanumeric': 0.020481927710843374, 'fraction_numerical': 0.0, 'mean_word_length': 5.543307086614173, '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}}
Adaptive regularization in frequency-domain NLMS filters

Regularization is an important part of adaptive filter design. Traditionally, the regularization parameter has been empirically selected, as there has not been a lot of work in the literature for determining an optimal method for finding its best value. In this work, we propose an adaptive method for finding the regularization parameter in the normalized least-mean-square (NLMS) algorithm. Furthermore, we apply this regularization approach in a frequency-domain version of the NLMS algorithm, in which a separate regularization parameter is computed for each frequency bin. Simulation results show that computing the regularization parameter for each frequency bin separately provided better performance for the filter, for the common case of colored noise excitation.