{'fraction_non_alphanumeric': 0.015057573073516387, 'fraction_numerical': 0.0008857395925597874, 'mean_word_length': 5.932515337423313, '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}}
Transmit Beamforming for Optimizing Network Capacity

Optimal transmit beamforming is obtained by minimizing the total network transmit power subject to a nodelevel channel capacity constraint. The algorithm that achieves this is referred to as locally enabled global optimization (LEGO)1 and is especially efficient for networks with reciprocal internode transmit and receive channel responses, typically realizable in time division duplex (TDD) networks. The algorithm achieves its network wide performance boost using only local information available at each transceiver. The LEGO algorithm combines the features of multichannel diversity combining, reminiscent of information theoretic water filling arguments, with the ability to exploit MIMO channel and internode transmit diversity, even in the presence of network-wide co-channel interference. A convergence proof is provided for a variant of LEGO and a series of numerical experiments are shown, which reveal an order of magnitude capacity improvement over conventional single antenna systems, and a several order of magnitude improvement in required transmission power.