{'fraction_non_alphanumeric': 0.01738122827346466, 'fraction_numerical': 0.0, 'mean_word_length': 5.447761194029851, '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}}
DOA estimation using fast EM algorithm

We study the direction of arrival estimation using expectation-maximization (EM) algorithm. The EM algorithm is a general and popular numerical method for finding maximum likelihood estimates which usually has a simple implementation and stable convergence. However, the computational cost caused by the slow convergence of the EM algorithm is still immense for the direction finding problem. Motivated by componentwise convergence of the EM algorithm, we suggest the use of smaller search spaces after a few iterations. In this way, the overall computational cost can be reduced drastically. An adaptive procedure which determines the search spaces involved in the maximization (M) step is proposed. With numerical experiments we demonstrate the improvement of the computational efficiency by using the proposed algorithm.