{'fraction_non_alphanumeric': 0.014705882352941176, 'fraction_numerical': 0.00267379679144385, 'mean_word_length': 5.241666666666666, '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 Expeditious Algorithm for Rotating Transformation in k-times Fundamental Frequency

Each harmonic component can be calculated respectively with the method of generalized dqk coordinate transform, and the necessary detected signal length is the shortest one among those of all harmonic calculating methods. This method has been used in applications [1, 2], but a huge amount of computing work is needed if the harmonics are calculated by the definition presented in the literature directly. This paper proves that the FFT algorithm can be applied to generalized dqk coordinate transform, so that the cost of time and resources can be reduced significantly. A computing instance is provided which proves that the algorithm is correct and effective.