{'fraction_non_alphanumeric': 0.017699115044247787, 'fraction_numerical': 0.0, 'mean_word_length': 5.567741935483871, '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}}
Extraction of Analytic Eigenvectors From a Parahermitian Matrix

The space-time covariance matrix derived from broadband multichannel data admits – unless the data emerges from a multiplexing operation – a parahermitian matrix eigenvalue decomposition with analytic eigenvalues and analytic eigenvectors. The extraction of analytic eigenvalues has been solved previously in the discrete Fourier transform (DFT) domain; this paper addresses the approximation of analytic eigenvectors in the DFT domain. This is a two-stage process – in the first instance, we identify eigenspaces in which analytic eigenvectors can reside. This stage resolves ambiguities at frequencies where eigenvalues have algebraic mulitplicities greater than one. In a second stage, the phase ambiguity of eigenvectors is addressed by determining a maximally smooth phase response. Finally, a metric for the approximation error is derived, which allows us to increase the DFT length and iterate the two stages until a desired accuracy is reached.