{'fraction_non_alphanumeric': 0.019148936170212766, 'fraction_numerical': 0.0, 'mean_word_length': 5.358108108108108, '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 EFFICIENT POLYNOMIAL-BASED FILTERS USING DISCRETE-TIME OPIMIZATION

This paper presents several novel structures for conversion between arbitrary sampling rates. The method allows arbitrary number of zeros at multiples of both input and output sampling rates, thus it has both good anti-imaging and good anti-aliasing properties. The novel structures are derived from continuous-time equivalents of CIC and modified comb filters. The implementation can be based on either the modified Farrow or transposed modified Farrow structure. By choosing one of these two alternatives appropriately, it is possible to shift most of the operations to lower sampling rate. Furthermore, it is possible to improve frequency domain performance by choosing continuous-time equivalent of the modified comb filter. In this way, we obtain very efficient filters for arbitrary sampling rate conversion, which are optimized directly in digital domain.