{'fraction_non_alphanumeric': 0.025806451612903226, 'fraction_numerical': 0.0064516129032258064, 'mean_word_length': 5.015503875968992, '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}}
Filter design for CWT computation using the Shensa algorithm

Direct computation of the continuous wavelet transform (CWT) using FFT requires O (Nlog/sub 2/N) operations per scale, where N is the data length. The Shensa (1992) algorithm is a fast algorithm to compute the CWT that uses only O(N) operations per scale. The application of the algorithm requires the design of a bandpass and a lowpass filter for a given mother wavelet function. Previous design method involves multi-dimensional numerical search and is computationally intensive. This paper proposes an iterative method to design the optimum filters. It computes in each iteration least-squares solutions only and does not need numerical search. The proposed filter design method is corroborated by simulations.