{'fraction_non_alphanumeric': 0.012578616352201259, 'fraction_numerical': 0.0, 'mean_word_length': 5.776595744680851, '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}}
Efficient implementation of polynomial interpolation filters or full digital receivers

Interpolation filters are widely used in symbol timing recovery systems to interpolate new sample values at arbitrary points between the existing discrete-time samples. This paper presents an efficient way to implement polynomial interpolation filters based on the analysis of constraints which are used for optimization. The proposed technique does not require two sub-filters in the well-known Farrow structure, which leads to a very efficient interpolator. Implementation examples are included illustrating the efficiency of the proposed method.