{'fraction_non_alphanumeric': 0.028764805414551606, 'fraction_numerical': 0.0, 'mean_word_length': 5.231578947368421, '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}}
Iterative Multiuser Detection and Channel Decoding for DS-CDMA Using Harmony Search

A novel random-guided optimization method is proposed for multiuser detection (MUD) in DS-CDMA systems employing the so-called harmony search (HS) algorithm. We specifically design the HS-aided MUD for the communications problem considered and apply it in an iterative joint MUD and channel decoding framework. Our simulation results demonstrate that a near-single-user performance can be achieved without the employment of the full-search-based optimum MUD even in extremely highly loaded DS-CDMA systems.