{'fraction_non_alphanumeric': 0.013215859030837005, 'fraction_numerical': 0.003524229074889868, 'mean_word_length': 5.346368715083799, '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}}
Joint Detection and Estimation for Cooperative Communications in Cluster-Based Networks

A joint data detection and channel estimation scheme is proposed for cooperative communications in cluster-based networks. In the proposed approach, each relay detects the source information using its joint detection and estimation rules and then compresses this information and forwards it to the destination node. The source information received from all the relays in the network is combined at the destination node in accordance with a fusion decision rule in order to determine the corresponding symbol vector. The joint detection and estimation rule at the relays and the fusion rule at the destination node are both processed using an expectation maximization algorithm. In order to reliably avoid poor local maxima, we utilized one pilot symbol per signal block to obtain a better initial starting point for the expectation maximization algorithm. The simulation results show that the feedback mechanism accelerates the convergence of the local channel estimates toward the Cramer–Rao lower bound. Copyright © 2011 John Wiley & Sons, Ltd.