{'fraction_non_alphanumeric': 0.0110803324099723, 'fraction_numerical': 0.0013850415512465374, 'mean_word_length': 5.757009345794392, '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}}
Application of barrier algorithm in signal reconstruction via compressive sampling

In this work signal reconstruction via compressive sampling is investigated. Compressive sampling theory extends the classical Shannon-Nyquist sampling theory for signals with arbitrary support. Conditions for exact signal reconstruction are covered. Signal reconstruction via compressive sampling is shown to be an ℓ1-norm minimization problem which can be solved as a norm approximation problem. Norm approximation problem is cast as a linear program and barrier method is implemented in its solution. Numerical experiments are conducted to compare the empirical bounds obtained via the barrier algorithm against the analytical results.