{'fraction_non_alphanumeric': 0.023783783783783784, 'fraction_numerical': 0.0075675675675675675, 'mean_word_length': 6.015151515151516, '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}}
Improving the threshold performance of higher-order direction finding methods via pseudorandomly generated estimator banks

A recently reported estimator bank approach (see IEEE SP Lett., vol.4, p.54, 1997) is extended below to the fourth-order direction finding algorithms. The essence of our approach is to exploit "parallel" underlying eigenstructure based estimators for removing the outliers and improving the direction finding performance in the threshold domain. The pseudorandomly generated weighted fourth-order MUSIC estimators are exploited as underlying techniques for estimator bank. Motivated by the superior performance and reduced computational complexity of beamspace and root modifications of the second-order eigenstructure techniques, beamspace root implementations of fourth-order MUSIC and fourth-order estimator bank are developed. Simulations show dramatical improvements of the threshold performance.