{'fraction_non_alphanumeric': 0.01245753114382786, 'fraction_numerical': 0.0, 'mean_word_length': 5.452554744525547, '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}}
Algebraic methods for deterministic blind beamforming

Deterministic blind beamforming algorithms try to separate superpositions of source signals impinging on a phased antenna array by using the deterministic properties of the signals or the channels such as their constant modulus or directions-of-arrival. Progress in this area has been abundant over the past ten years and has resulted in several powerful algorithms. Unlike optimal or adaptive methods, the algebraic methods discussed in this review act on a fixed block of data and give closed-form expressions for beamformers by focusing on algebraic structures. This typically leads to subspace estimation and generalized eigenvalue problems. After introducing a simple and widely used multipath channel model, the paper provides an anthology of properties that are available, as well as generic algorithms that exploit them.