{'fraction_non_alphanumeric': 0.0223463687150838, 'fraction_numerical': 0.0011173184357541898, 'mean_word_length': 5.686567164179104, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Smart Antenna Adaptive Algorithms Development for 3 G Cellular Communication with Training Signal

The smart antenna have to optimize reception and radiation patterns dynamically in response to the signal environment and the spatial beamformer has to maximize the signal/interference relation (SIR) continuously for each moving user. There is a growing need for the development of efficient algorithms for real-time optimization. Various algorithms can be applied for Digital Signal Processors (DSP), which differ in their complexity, convergence and so on. In this paper we consider and compare two adaptive algorithms: Sample Matrix Inversion (SMI) and Regularized Sample Inversion Matrix (RSMI) algorithms. Two criteria for comparison of algorithms were applied: convergence to optimal solution and convergence of radiation pattern. The efficient linear complexity RSMI algorithm is proposed.