{'fraction_non_alphanumeric': 0.02014218009478673, 'fraction_numerical': 0.002369668246445498, 'mean_word_length': 4.99290780141844, '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}}
Fast and Area-Efficient Sphere Decoding Using Look-Ahead Search

Sphere decoding enables maximum likelihood (ML) detection with fairly low complexity in the MIMO wireless systems, but it takes hundreds cycles at low SNR environment. This paper proposes a fast decoding algorithm to reduce the decoding cycles using look-ahead search. Since the proposed decoding algorithm utilizes hardware resources to add other sub-trees into the search space successively, it helps not to go down into the sub-tree that has a small value at the root node but has large values at the child nodes. Scaling and enumeration techniques are also presented, which are effective in implementing the proposed sphere decoder. As a result, the proposed decoder saves about 30% decoding cycles at the cost of small hardware overhead compared to the conventional decoder.