{'fraction_non_alphanumeric': 0.01991465149359886, 'fraction_numerical': 0.0, 'mean_word_length': 5.518518518518518, '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}}
Projected-Gradient-Descent in Rakeness-Based Compressed Sensing with Disturbance Rejection

Compressed Sensing (CS) has recently emerged as an effective tool to simultaneously acquire and compress analog waveforms in low-resource sensing devices. Its mechanisms have been also extended by both adapting the sensing stage to the actual class of input signals, and granting it the ability to reject disturbances. Regrettably, the resulting design flow entails the solution of two optimization problems with a potentially huge number of variables. This work overcomes this impasse by proposing a Project-Gradient-Descend method algorithm that drastically reduces the required CPU time to obtain a solution.