{'fraction_non_alphanumeric': 0.021897810218978103, 'fraction_numerical': 0.0, 'mean_word_length': 5.236363636363636, '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}}
Sparsity Problem Involving Rational Basis Functions

In this paper we consider the problem of sparse signal modeling by means of rational functions. Our dictionary is composed by a finite collection of elementary rational functions. In order to represent the signal with minimal error, we select an optimal number of basis from this set. The mutual coherence is a fundamental attribute of the dictionary. We analyze this quantity and describe its relation to the free parameters, i.e., the inverse poles, of rational functions. Then, we demonstrate the efficiency of sparse rational representations by compressing real electrocardiograms (ECG) including comparisons with other methods.