{'fraction_non_alphanumeric': 0.015463917525773196, 'fraction_numerical': 0.0, 'mean_word_length': 5.317073170731708, '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 adaptive whitening matched filter/equaliser for the ISI channel

This paper addresses the problem of adaptive linear equalisation for the intersymbol interference channel. The paper derives the minimum variance linear estimator for the input data sequence, namely the Kalman filter. An adaptive law is derived for the Kalman filter when the channel and/or transmit filters are unknown. This adaptive law is derived by recursively minimising a novel cost function closely related to Kullback-Leibler distance. Our simulations suggest global convergence to an open-eye solution for any minimum phase channel, however we do not currently have a proof of this proposition. The performance however is significantly better than the fractionally spaced constant modulus algorithm.