{'fraction_non_alphanumeric': 0.025974025974025976, 'fraction_numerical': 0.01406926406926407, 'mean_word_length': 5.0855263157894735, '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}}
Performance study of a generalized subspace-based method for scattered sources

Signal array processing appears today as a good means to improve the wireless network, as it could permit a better estimation of the propagation channel parameters. Now, this paper focuses on high resolution bearing estimation, when scatterers local to the emitter engender diffuse paths deteriorating the performances of conventional algorithms. S. Valaee and B. Champagne (see IEEE Trans. on Signal Processing, vol.43, no.9, p.2144-53, 1995) introduced a subspace-based algorithm for the characterization of so-called scattered sources. This article extends this previous work and studies the performance of the algorithm in the case of two extreme propagation conditions. The theoretical variances and the Cramer Rao bounds are derived and compared to the Monte Carlo simulations in the case of a Gaussian shape of the angular power density.