{'fraction_non_alphanumeric': 0.03225806451612903, 'fraction_numerical': 0.0037220843672456576, 'mean_word_length': 5.255813953488372, '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}}
Fast implementation of sparse reconstruction for CS-based DoA estimation

Sparse vector reconstruction requires a long computation time, because it is based on some iterative computation algorithms, in which an initial dense vector is gradually modified to a sparse vector. To overcome this problem, we proposed a fast implementation technique that is based on the reordering/reuse of results calculated from the zero-elements at each iteration. In addition, we adapted our technique to a GPU (graphics processing unit)-suitable implementation of ℓp-norm minimization, i.e., a CS (compressive/compressed sensing)-based DoA (direction of arrival) estimation algorithm. We found that the proposed implementation with a GPU is up to 47 times faster than the conventional implementation with an 8-threaded CPU.