{'fraction_non_alphanumeric': 0.014965986394557823, 'fraction_numerical': 0.0, 'mean_word_length': 5.814814814814815, '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}}
Reconstruction of Sparse Propagation Environment With Complexity Reduced OMP Algorithm

Effective delay resolution of propagation paths recovery can be controlled by oversampling used at the delay estimation stage of orthogonal matching pursuit (OMP) method. Unfortunately, a finer resolution increases the number of inner products to be computed there. In order to reduce their quantity, a modification called successive delay approximation (SDA) is proposed. The SDA selects an approximated path delay calculating only two extra inner products for each subsequent doubling of the oversampling ratio. The proposed solution is numerically efficient without significant transmission quality loss that has been proven in the simulations.