{'fraction_non_alphanumeric': 0.017994858611825194, 'fraction_numerical': 0.0, 'mean_word_length': 5.601694915254237, '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}}
Fast algorithm of adaptive chirplet-based real signal decomposition

Great attention has been focused on the chirplet-based signal decomposition in the area of signal processing, and several approaches were recently developed for complex analytic signals. In order to apply these approaches to real signals, analytic processing needs to be performed. The conventional analytic methods include the Hilbert transform in time-domain and the window function method in frequency-domain. They both have certain drawbacks. After reviewing two typical analytical methods, a novel fast algorithm of adaptive chirplet-based real signal decomposition without analytic processing is presented in this paper. Numerical simulations illustrate the effectiveness of such a novel fast algorithm.