{'fraction_non_alphanumeric': 0.017045454545454544, 'fraction_numerical': 0.0, 'mean_word_length': 5.080459770114943, '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}}
ZIV-ZAKAI bound for harmonic retrieval in multiplicative and additive gaussian noise

The paper addresses the problem of the lower performance bound evaluation for harmonic retrieval in multiplicative and additive noise, especially when the SNR is low and/or when the number of available samples is small. As a novelty, we express an accurate approximation of the Ziv-Zakai bound in closed-form. This enables us to analyse the influence of some signal parameters on performance and to characterise the so-called threshold region