{'fraction_non_alphanumeric': 0.018292682926829267, 'fraction_numerical': 0.0010162601626016261, 'mean_word_length': 5.52317880794702, '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}}
Joint Source Estimation and Localization

The estimation of directions of arrival is formulated as the decomposition of a 3-way array into a sum of rank-one terms, which is possible when the receive array enjoys some geometrical structure. The main advantage is that this decomposition is essentially unique under mild assumptions, if computed exactly. The drawback is that a low-rank approximation does not always exist. Therefore, a coherence constraint is introduced that ensures the existence of the latter best approximate, which allows to localize and estimate closely located or highly correlated sources. Then Cramér-Rao bounds are derived for localization parameters and source signals, assuming the others are nuisance parameters; some inaccuracies found in the literature are pointed out. Performances are eventually compared with unconstrained reference algorithms such as ESPRIT, in the presence of additive complex Gaussian noise, with possibly noncircular distribution.