{'fraction_non_alphanumeric': 0.019319938176197836, 'fraction_numerical': 0.0007727975270479134, 'mean_word_length': 5.888297872340425, '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}}
Multivariate spectral reconstruction of stap covariance matrices: Toeplitz-block solution

In space-time adaptive processing (STAP) applications, temporally stationary clutter results in a Toeplitz-block clutter covariance matrix. In the reduced-order parametric matched filter STAP technique, this covariance matrix is reconstructed from a small number of estimated parameters, resulting in a much more efficient use of training samples. This paper and a companion one [1] addresses the issue of STAP filter performance from covariance matrices reconstructed with a strict adherence to the Toeplitz-block structure versus a ldquorelaxedrdquo reconstruction which employs a maximum entropy completion criteria, but does not enforce a strict Toeplitz-block structure on that completion. Both techniques analyzed use a multivariate spectral reconstruction approach which preserve the Burg spectrum. In this paper, the reconstruction is constrained to result in a Toeplitz-block covariance matrix model, and the solution requires positive definite matrix-valued stable polynomial factorization that can be derived via the multivariate Levinson algorithm. Performance of the reconstructed covariance matrix model as a STAP filter is evaluated using the DARPA KASSPER dataset in the companion paper.