{'fraction_non_alphanumeric': 0.01756756756756757, 'fraction_numerical': 0.002702702702702703, 'mean_word_length': 5.226890756302521, '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}}
Implementations of adaptive IIR filters with lowest complexity

The problem of implementing adaptive IIR filters of minimum complexity is considered. The complexity is determined by the number of multiplications in the implementation of the structures generating both the adaptive filter output and the sensitivities to be used in any gradient-based algorithm. This complexity is independent of the specific adaptive algorithm used. It is established that the sensitivity generation requires a minimum of N additional states, where N is the order of the filter, and that the lowest complexity is /sub 3/N+1 multiplications. This result is used to show minimum complexity implementations of direct-form and cascade-form adaptive IIR filters.