{'fraction_non_alphanumeric': 0.008547008547008548, 'fraction_numerical': 0.002136752136752137, 'mean_word_length': 5.605633802816901, '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 Efficient Tree Search Decoder with Column Reordering for Underdetermined MIMO Systems

An efficient tree search decoder for underdetermined MIMO systems is presented. The decoder employs a novel column reordering strategy for the channel matrix in the reduction process, which can significantly reduce the computational cost. Simulation results show that this new algorithm is much more efficient than current approaches for a square constellation higher than 4QAM.