{'fraction_non_alphanumeric': 0.018223234624145785, 'fraction_numerical': 0.0, 'mean_word_length': 5.463235294117647, '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}}
Fast convergence algorithms for the adaptive envelope-constrained filter design

Envelope-constrained (EC) filtering is to design a finite impulse response filter such that the output of the filter is guaranteed to be within a prescribed output pulse mask with respect to a given input pulse. The standard unconstrained least mean squares (LMS) or recursive least squares (RLS) algorithms are not applicable to this kind of adaptive filtering problem coupled with inequality constraints. A new type of recursive algorithms was proposed recently for designing an adaptive EC filter, and the corresponding convergence properties were established. In this paper, it is shown that faster convergence can be achieved by incorporating a simplified line search into the developed recursive algorithms. The modified recursive algorithms are very efficient, and very simple to implement.