{'fraction_non_alphanumeric': 0.017595307917888565, 'fraction_numerical': 0.0, 'mean_word_length': 5.098214285714286, '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}}
On MIMO K-Best Sphere Detector architecture complexity reductions

This paper describes a way to modify the K-Best Sphere Detector, using the knowledge that the real and the imaginary part of complex number are always orthogonal. To ensure that this property is used, a modification to the Real Value Decomposition is proposed that will ensure that the orthogonality is seen also after the decomposition. The proposed method allows for equally efficient implementations of real-valued K-Best Sphere Detector implementations as the complex-valued implementation. The cost of the lowered complexity is an increased Bit Error Rate. With proper coding this drawback could be alleviated.