{'fraction_non_alphanumeric': 0.0162748643761302, 'fraction_numerical': 0.0, 'mean_word_length': 5.398843930635838, '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}}
Low complexity MIMO detection algorithm by combining modified OSIC and ML detection

The Ordered Successive Interference Cancellation (OSIC) algorithm has the advantage of high capabilities. Moreover, as compared to Maximum Likelihood Detection it has poor performance but its error rate is expected. The OSIC algorithm complexity is based on matrix inversion. In this paper, an improved OSIC algorithm is proposed, that uses a parallel detection and an accurate detection value of combining programs while maintaining performance with the slight reduced computational complexity. Considering the error propagation of the traditional OSIC algorithm, modified OSIC and ML detection algorithm are merged, the use of exhaustive search ML method is to improve the overall performance. In order to avoid the computational complexity of ML algorithm, “k” symbols are selected to be detected by the modified OSIC. The remaining symbols are detected by ML detection. The simulations are performed in MATLAB and it shows that the performance of the proposed algorithm is better than the conventional OSIC algorithm.