{'fraction_non_alphanumeric': 0.030276046304541407, 'fraction_numerical': 0.0, 'mean_word_length': 5.175824175824176, '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 quasi-maximum-likelihood multiuser detector using semi-definite relaxation

In the standard scenario of multiuser detection, the maximum-likelihood (ML) detector is optimum in the sense of minimum error probability. Unfortunately, ML detection requires the solution of a difficult optimization problem for which it is unlikely that the optimal solution can be efficiently found. We consider an accurate and efficient quasi-ML detector which uses semi-definite relaxation (SDR) to approximate the ML detector. This SDR-ML detector was recently shown to be capable of achieving a bit error rate (BER) close to that of the true ML detector. Here, we show that several existing suboptimal detectors, such as the decorrelator, can be viewed as degenerate versions of the SDR-ML detector. Hence, it is expected that the SDR-ML detector should perform better than those detectors. This expectation is confirmed by simulations, where the BER performance of the SDR-ML detector is significantly better than that of other suboptimal detectors including the decorrelator and the linear-minimum-mean-square-error detector.