{'fraction_non_alphanumeric': 0.017994858611825194, 'fraction_numerical': 0.006426735218508998, 'mean_word_length': 4.857142857142857, '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 Random Search for Optimal One-Bit Precoding in Massive MIMO Downlink

We propose a simple low-complexity iterative random search (IRS) algorithm based on dithering for optimal one-bit precoding, to find transmitted signals for a base station equipped with one-bit transmitters to serve multiple users in massive MIMO downlink. The complexity increases linearly with the number of transmitter antennas and we may even achieve the global optimal performance in the worst case single user scenario. The analysis shows that the error vector magnitude (EVM) of the signals arrived at the users is inversely proportional to the square of the ratio between the number of transmitter antennas and the number of the users. We can achieve about -40 dB EVM when the ratio is 200.