{'fraction_non_alphanumeric': 0.02085747392815759, 'fraction_numerical': 0.0034762456546929316, 'mean_word_length': 5.352941176470588, '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}}
New algorithm for spectral factorization and its practical application

In this report a new algorithm is presented for the spectral factorization of a two-sided symmetric polynomial. The method is based on the discrete Fourier transform theory (DFT) and its relationship to the Z-transform. Involving DFT computational techniques, namely the famous fast Fourier transform routine (FFT), brings high computational efficiency and reliability. The power of the proposed procedure is employed in a particular practical application. Namely the problem of computing an H2-optimal inverse dynamic filter to an audio equipment is considered as it was proposed by M. Sternad and colleagues in [12] to improve behavior of moderate quality loudspeakers. Involved spectral factorization is resolved by our new method and its performance is compared with existing algorithms.