{'fraction_non_alphanumeric': 0.028968713789107765, 'fraction_numerical': 0.0, 'mean_word_length': 5.260869565217392, '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}}
Channel Estimation in Block Fading Channels Using the Factor Graph EM Algorithm

Factor graphs, and message-passing over these graphs using the Sum-Product Algorithm (SPA), are an important method for unifying the tasks of channel estimation and decoding. In this paper, we use a variant of the Expectation-Maximization (EM) Algorithm that is formulated as a modification to the sum-product algorithm (SPA) over factor graphs. We firstly advance the theory of this factor graph EM Algorithm, showing that it has attractive complexity and graph-theoretic properties in the case of a factor graph with cycles. Subsequently, we apply this algorithm to the problem of state estimation in block interference channels. Simulation results are given, confirming that EM-based estimation-decoding improves significantly on conventional methods, in spite of low complexity.