{'fraction_non_alphanumeric': 0.0121580547112462, 'fraction_numerical': 0.0, 'mean_word_length': 5.793814432989691, '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}}
Vector precoding with bounded complexity

We investigate nonlinear pre-equalization techniques for the downlink of multiuser systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile receivers. In the focus of this paper is the strongly varying complexity of the tree-structured vector precoding problem. Since the maximum latency of signal processing algorithms is of major interest for practical implementations, suboptimum schemes with an upper bounded complexity are discussed. Simulation results reveal a close to optimum performance at the expense of moderate computational efforts for the considered scenario.