{'fraction_non_alphanumeric': 0.027906976744186046, 'fraction_numerical': 0.0, 'mean_word_length': 5.6419753086419755, '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}}
Sparse least mean fourth adaptive algorithm for censored regression

In the linear systems, the conventional least mean fourth (LMF) algorithm has faster convergence and lower steady-state error than LMS algorithm, However, in many applications, the censored observations occur frequently. In this paper, a least mean fourth (LMF) algorithm with censored regression is proposed for adaptive filtering. When the identified system possesses a certain extent of sparsity, the least mean fourth algorithm for Censored Regression (CRLMF) algorithm may encounter performance degradation. Therefore, a reweighted zero-attracting LMF algorithm based on the censored regression model (RZA-CRLMF) is proposed further. Simulations are carried out in system identification and echo cancellation scenarios. The results verify the effectiveness of the proposed CRLMF and RZA-CRLMF algorithms. Moreover, in sparse system, the RZA-CRLMF algorithm improves further the filter performance in terms of the convergence speed and the mean squared deviation for the presence of sub-Gaussian noise.