{'fraction_non_alphanumeric': 0.02517162471395881, 'fraction_numerical': 0.0, 'mean_word_length': 5.074074074074074, '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}}
CFAR analysis of the multicoset-thresholding detector: Application to the low complexity sub-Nyquist Radar Electronic Surveillance

Multicoset sampling scheme is a technique to achieve high-speed sampling rate, using a bank of lower-rate sampling channels. In this technique, each channel samples with a small delay with respect to the other channels. As a result, we often can reconstruct the high bandwidth input signal, by wisely combining the information from different channels. However, in many applications, the reconstruction is not the goal. Here, we consider an application, i.e. Radar Electronic Surveillance, in which the aim is the detection and identification of the incoming Radar pulses. As the sampling rate is very high, e.g. up to tens of Giga samples per second, we also need a fast detection scheme. We have recently proposed an efficient multicoset sampling technique, called LoCoMC, which is based on the thresholding for the detection and combining the information from different channels, to extract pulses. We here present an analytical investigation of the thresholding based detection and demonstrate how to choose the thresholding parameter. We then show that the algorithm can be competitive with a state of the art algorithm in performance, while it is computationally very cheap.