{'fraction_non_alphanumeric': 0.019098548510313215, 'fraction_numerical': 0.0, 'mean_word_length': 5.238095238095238, '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}}
Optimum and sub-optimum coherent radar detection in compound Gaussian clutter: a data-dependent threshold interpretation

We propose a possible approach to the problem of optimum and sub-optimum detection of radar targets against a background of coherent, correlated, K-distributed clutter. It is well-known that the optimum strategy to detect a perfectly known signal embedded in correlated Gaussian clutter is given by comparing the whitening-matched filter output to a given threshold, which is predetermined according to the desired probability of false alarm. When the clutter is non-Gaussian the performance of the matched filter degrades, and the optimum detector in such a disturbance may be non-linear. For the non-Gaussian clutter model considered, the optimum detector is a function of two statistics: a linear statistic (the matched filter output) and a quadratic statistic. We show that the optimum detection strategy can be seen as the classical matched filter output compared to an adaptive threshold that depends on the data through the quadratic statistic. This interpretation has given us an insight into the structure of the optimum detector and has suggested an approach to obtain, analyze and compare suboptimum detectors that are easily implementable with a performance close to optimal.