{'fraction_non_alphanumeric': 0.032670454545454544, 'fraction_numerical': 0.005681818181818182, 'mean_word_length': 5.294642857142857, '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 sparse approach for DOA estimation with a multiple spatial invariance sensor array

In this paper, we introduce a sparse direction-of-arrival (DOA) estimation algorithm for sensor arrays presenting multiple scales of spatial invariance. We exploit the Khatri-Rao structure of the over-complete steering vector dictionary, corresponding to this array geometry, in order to devise a computationally efficient sparse estimation approach. This approach is based on an iterative refinement and pruning strategy of the dictionary. We show, in numerical simulations, that our approach outperforms the state-of-the-art approach based on a Candecomp/Parafac (CP) decomposition, proposed by Miron et al. in 2015.