{'fraction_non_alphanumeric': 0.020348837209302327, 'fraction_numerical': 0.0, 'mean_word_length': 5.537974683544304, '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}}
Biparametric clutter-map CFAR processor independent of original clutter distribution

The traditional CFAR processors are based on the sliding-window concept, which have substantial performance degradation under nonhomogeneity. Owing to temporal processing and the exploitation of the local homogeneity of the map cell, the clutter-map procedure acquires enhanced robustness with little CFAR losses. In this paper, a Gaussian biparametric clutter-map constant false alarm rate (GBCM-CFAR) processor is proposed which merges the clutter-map technique and noncoherent integration together. It can approximately achieve CFAR independent of the original clutter distribution. The performance in the presence of fast point targets is assessed, in the examples of Weibull and lognormal clutter, in order to elicit the effect of the system parameters. Its performance is close to that of the optimum Neyman-Pearson detector with little CFAR losses in homogeneous environments. It is also suitable to deal with the nonhomogeneous situation.