{'fraction_non_alphanumeric': 0.016, 'fraction_numerical': 0.005333333333333333, 'mean_word_length': 5.364406779661017, '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}}
Chirp parameter estimation using rank reduction

This paper considers the problem of estimating the bandwidth and the center frequency of a linear chirp signal from discrete-time noisy observations. The non-stationarity property of chirp signals implies that the signal has high rank and reduces the applicability of subspace based algorithms significantly. However, the special structure of the sample covariance matrix invites to use regular frequency estimation algorithms. We show how subspace type algorithms may be modified to provide accurate signal parameter estimates for linear chirp signals. The root-MUSIC algorithm is used as an example. Simulations compare the algorithm with a rank reduction method proposed by DiMonte and Arun (1990).