{'fraction_non_alphanumeric': 0.01877133105802048, 'fraction_numerical': 0.006825938566552901, 'mean_word_length': 4.537735849056604, '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}}
An algorithm for the design of optimal finite word-length FIR digital filters

The purpose of this work was to develop and implement an algorithm for the design of optimal finite word-length linear phase FIR digital filters. The algorithm proved to be quite practical for filters of length up to 60 or 80, depending on the word length. It is based on the branch-and-bound technique in which the Remez algorithm and an adaptive grid-growth technique are used. The algorithm also uses a new theoretical result on the lower bound of finite word-length cosine Chebyshev approximation error.