{'fraction_non_alphanumeric': 0.02185792349726776, 'fraction_numerical': 0.004098360655737705, 'mean_word_length': 4.864, '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 Combinatorial Approach to One-Bit Compressive Radar Sensing

We propose a new sensing method for one-bit compressive pulsed radar. The method involves a sparse algorithm based on the concept of union-free family of sets, which is a combinatorial structure. The proposed algorithm is supported by a theorem which guarantees the accuracy of the method under certain conditions. Unlike some well-known sparse support recovery methods, the proposed method here is needless of knowing how sparse the signal vector is. Simulation results confirm the reliability of the proposed sensing algorithm. Specifically the method is shown to detect target indices accurately with a probability above 0.9, even at a signal-to-noise ratio of 0 dB.