{'fraction_non_alphanumeric': 0.015915119363395226, 'fraction_numerical': 0.0, 'mean_word_length': 5.291666666666667, '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 subspace method for space time adaptive processing

The problem of space-time adaptive processing (STAP) using a nonlinear array is considered. A key part of STAP is the estimation of the space-time covariance matrix of the received data. The conventional method of doing this causes significant performance degradation at short ranges because of the nonstationarity of the data. We present an alternative algorithm which circumvents this problem by projecting the data on the subspace orthogonal to the clutter and jammer subspaces. The clutter subspace is computed from the known array manifold, while the jammer subspace is estimated from clutter-free measurements. Numerical examples illustrate the performance improvement achieved at short ranges.