{'fraction_non_alphanumeric': 0.024342745861733205, 'fraction_numerical': 0.0, 'mean_word_length': 5.632258064516129, '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}}
A reduced complexity channel estimation algorithm with equalization

The error rate performance of a previously developed reduced complexity channel estimator, known as the generalized least mean squares (GLMS) algorithm, is investigated in conjunction with a minimum-mean-square-error (MMSE) decision feedback equalizer (DFE). The channel estimator is based on the theory of polynomial prediction and Taylor series expansion of the underlying channel model in time domain. It is a simplification of a previously developed generalized recursive least squares (GRLS) estimator, achieved by replacing the online recursive computation of the ‘intermediate’ matrix by an offline pre-computed matrix. Similar to the GRLS estimator, it is able to operate in Rayleigh or Rician fading environment without reconfiguration of the state transition matrix to accommodate the non-random mean components. Simulation results show that it is able to offer a trade-off between reduced complexity channel estimation and good system performance.