{'fraction_non_alphanumeric': 0.019925280199252802, 'fraction_numerical': 0.0, 'mean_word_length': 5.330708661417323, '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}}
Sparse recovery based moving range-spread target detection for distributed airborne MIMO radar

This paper considers the problem of detecting a moving range-spread target in distributed airborne multi-input multi-output (MIMO) radar. Due to the fact that the moving platform based systems exacerbate the clutter non-homogeneity, a sparse recovery based detector is proposed without assuming that the training data is available. The proposed detector explores the sparsity of the clutter in the spatial-temporal domain by adopting the orthogonal matching pursuit algorithm. Moreover, we derive the expression of the probability density function of the proposed detection test. In the end of the paper, we assess the detection performance of the proposed algorithm in comparison with the existing methods.