{'fraction_non_alphanumeric': 0.01946647440519106, 'fraction_numerical': 0.0, 'mean_word_length': 5.3090909090909095, '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}}
A new adaptive array algorithm for interference suppression in wireless communications

In the application of antenna arrays to wireless communications, a known signal preamble is used for estimating the array response at the beginning of each data frame. The estimated array response is then used in linear combining the array input for interference suppression and demodulation of the desired user's information data. Since the training preamble is usually very short, the conventional training methods, which estimate the array response based solely on the training preamble, may incur large estimation errors. We propose a subspace-based technique for array response estimation, which exploit the whole frame of the received signal. It is shown that as the length of the data frame tends to infinity, in the absence of noise, this method can recover the array response of the desired user exactly, given a small number of training symbols of that user. We also derive expressions for the subspace-based array combining weights based on zero-forcing and MMSE criteria. Simulation results show that the proposed method offers substantial performance gain over the conventional direct matrix inversion (DMI) method for adaptive arrays. The proposed technique can be readily extended to dispersive channels to combat both co-channel interference (CCI) and intersymbol interference (ISI).