{'fraction_non_alphanumeric': 0.021413276231263382, 'fraction_numerical': 0.0, 'mean_word_length': 5.685714285714286, '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}}
Properties of the multiplicative general parameter adaptive algorithm

The multiplicative general parameter (MGP) algorithm is a computationally efficient reduced-rank adaptive filter algorithm which typically uses only a few adaptive parameters. In this paper, we derive the stability condition of the MGP algorithm. Furthermore, use of the algorithm in polyphase filters is discussed. Examples of both single-rate and multirate adaptive polyphase filters are shown.