{'fraction_non_alphanumeric': 0.017456359102244388, 'fraction_numerical': 0.0, 'mean_word_length': 5.224806201550388, '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 Robust Chinese Remainder Theorem With Its Applications in Frequency Estimation From Undersampled Waveforms

The Chinese remainder theorem (CRT) allows to reconstruct a large integer from its remainders modulo several moduli. In this paper, we propose a robust reconstruction algorithm called robust CRT when the remainders have errors. We show that, using the proposed robust CRT, the reconstruction error is upper bounded by the maximal remainder error range named remainder error bound, if the remainder error bound is less than one quarter of the greatest common divisor (gcd) of all the moduli. We then apply the robust CRT to estimate frequencies when the signal waveforms are undersampled multiple times. It shows that with the robust CRT, the sampling frequencies can be significantly reduced.