{'fraction_non_alphanumeric': 0.02561837455830389, 'fraction_numerical': 0.0, 'mean_word_length': 5.587209302325581, '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 Linear Zero-Forcing for the MIMO Broadcast Channel

Maximizing the sum capacity in the multiple-input multiple-output (MIMO) broadcast channel requires the use of dirty paper coding (DPC). However, practical implementations of DPC which are nearly optimum exhibit high computational complexity. As an alternative to DPC linear zero-forcing can be used where the multiuser interference is completely canceled by linear beamforming. Determining the optimum user allocation, transmit and receive filters thereby constitutes a combinatorial and nonconvex optimization problem. To circumvent its direct solution and therefore reduce complexity, we propose an algorithm that successively allocates data streams to users and, in contrast to state-of-the-art approaches, includes the receive filters into the optimization. We then show several steps that reduce the complexity of the algorithm at marginal performance losses. Thus, performance of state-of-the-art approaches can be maintained while the computational complexity is reduced considerably, as it is shown by a detailed complexity analysis and simulation results.