{'fraction_non_alphanumeric': 0.013605442176870748, 'fraction_numerical': 0.0, 'mean_word_length': 5.072164948453608, '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}}
Efficient block LS design of FIR filters with linear phase

This paper is concerned with the efficient determination of FIR least squares filters with linear phase. The general unknown statistics case is considered, whereby only sample records of the input and the desired response signals are available. Both linear phase cases with phase delay and group delay are examined. Taking advantage of the underlying near-to-Toeplitz structure of the resulting normal equations, a fast algorithm is developed that recursively produces all linear phase filters orders for a single block of data.