{'fraction_non_alphanumeric': 0.021139705882352942, 'fraction_numerical': 0.0, 'mean_word_length': 5.443786982248521, '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}}
Distributed blind adaptive computation of beamforming weights for relay networks

In the present paper, we propose two novel algorithms which enable the relay cooperation for the distributed computation of the beamforming weights in a blind and adaptive manner, without the need to forward the data to a fusion center. In the first scheme, the beamforming vector is computed through minimization of the total transmit power subject to a receiver quality-of-service constraint (QoS). In the second scheme, the beamforming weights are obtained through maximization of the receiver signal-to-noise-ratio (SNR) subject to a total transmit power constraint. The proposed approaches distribute the computational overhead equally among the relay nodes and achieve close performance to the one of the optimal beamforming solutions. Note, that the aforementioned optimal solutions are derived assuming perfect channel state information at the relays' side. In order to verify the performance of the proposed approaches, indicative simulations were carried out for static and time-varying channels.