{'fraction_non_alphanumeric': 0.025823686553873553, 'fraction_numerical': 0.0017809439002671415, 'mean_word_length': 5.497109826589595, '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}}
Algebraic Algorithms to Separate Overlapping Secondary Surveillance Radar Replies

The secondary surveillance radar (SSR) is a transponder system used in air-traffic control (ATC). Due to growing traffic densities, it is increasingly likely that a ground station receives a mixture of responses of various aircraft, partly overlapping in frequency and time. Currently such "collisions" are disregarded, at a loss of system performance and reliability. In this paper, we propose to equip the ground station with an antenna array, and investigate techniques to blindly separate such a mixture based on source waveform properties. At baseband, a received SSR signal consists of a binary sequence with alphabet {0,1}, modulated by a complex exponential due to the residual carrier frequency. We present three algebraic algorithms to compute the separating beamformers by taking into account the particular modulation format of the received signal. The Cramer-Rao bound (CRB) is derived, extensive simulations are presented, and an experimental platform has been built to collect measurement data and demonstrate the algorithms.