{'fraction_non_alphanumeric': 0.016181229773462782, 'fraction_numerical': 0.0, 'mean_word_length': 5.823529411764706, '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}}
Infinite length channel shortening filtering based on polynomial approach

Maximum-likelihood estimation and multicarrier modulation techniques are effective methods to mitigate intersymbol interference (ISI) in wireless and wireline communications, but their complexity and performance are limited by the channel length. Channel shortening equalization is an efficient way to shorten the length of the ISI channel while keeping most of the channel energy inside the shortened window. In this paper, we propose an infinite impulse response (IIR) filter for channel shortening and provide polynomial based algorithms to compute the shortening filter. We also considered a very general framework allowing auto-regressive moving average (ARMA) input and noise processes together with an ARMA channel model. An illustrative numerical example shows the superior performance of our proposed scheme as compared to existing techniques.