{'fraction_non_alphanumeric': 0.011922503725782414, 'fraction_numerical': 0.0, 'mean_word_length': 5.280373831775701, '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}}
Efficient Modified Fano Detection with Reduced Branches for DSTTD System

A sub-optimal but computationally efficient modified Fano detection (MFD) algorithm for DSTTD system is presented. The proposed algorithm utilizes the sequential detection scheme based on tree searching in order to find the optimal symbol sequence. For more reliable signal detection and complexity reduction, the decoder is designed to move backward for the specified value at the end of the tree and to compute the reduced branch metrics. Simulation results show that the performance of MFD is comparable to that of ML detector while reducing the computational effort of ML method significantly.