{'fraction_non_alphanumeric': 0.048576214405360134, 'fraction_numerical': 0.018425460636515914, 'mean_word_length': 4.862745098039215, '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}}
Design of powers-of-two coefficient FIR filters with minimum arithmetic complexity

A mixed-integer-linear-programming (MILP)-based algorithm is proposed for designing canonic-signed-digit (CSD) FIR filters with minimal complexity. The proposed algorithm reduces the number of variables in MILP through certain modifications of the scheme proposed by Chia-Yu Yao (Proc. IEEE Int. Symp. Circ. Sys., vol. 2, pp. 301-304, 2001). Design examples demonstrate that the proposed algorithm can design a CSD FIR filter with minimum complexity and requires less computation than the existing MILP algorithm.