{'fraction_non_alphanumeric': 0.02009132420091324, 'fraction_numerical': 0.0009132420091324201, 'mean_word_length': 5.485207100591716, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Accurate and Computationally Efficient Tensor-Based Subspace Approach for Multidimensional Harmonic Retrieval

In this paper, parameter estimation for R-dimensional (R -D) sinusoids with R >; 2 in additive white Gaussian noise is addressed. With the use of tensor algebra and principal-singular-vector utilization for modal analysis, the sinusoidal parameters at one dimension are first accurately estimated according to an iterative procedure which utilizes the linear prediction property and weighted least squares. The damping factors and frequencies in the remaining dimensions are then solved such that pairing of the R-D parameters is automatically achieved. Algorithm modification for a single R -D tone is made and it is proved that the frequency estimates are asymptotically unbiased while their variances approach Cramér-Rao lower bound at sufficiently high signal-to-noise ratio conditions. Computer simulations are also included to compare the proposed approach with conventional R -D harmonic retrieval schemes in terms of mean square error performance and computational complexity.