{'fraction_non_alphanumeric': 0.02333065164923572, 'fraction_numerical': 0.0, 'mean_word_length': 4.952153110047847, '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}}
Lossy compression of decimated Gaussian random walks

We consider the problem of estimating a Gaussian random walk from a lossy compression of its decimated version. Hence, the encoder operates on the decimated random walk, and the decoder estimates the original random walk from its encoded version under a mean squared error (MSE) criterion. It is well-known that the minimal distortion in this problem is attained by an estimate-and-compress (EC) source coding strategy, in which the encoder first estimates the original random walk and then compresses this estimate subject to the bit constraint. In this work, we derive a closed-form expression for this minimal distortion as a function of the bitrate and the decimation factor. Next, we consider a compress-and-estimate (CE) source coding scheme, in which the encoder first compresses the decimated sequence subject to an MSE criterion (with respect to the decimated sequence), and the original random walk is estimated only at the decoder. We evaluate the distortion under CE in a closed form and show that there exists a non-zero gap between the distortion under the two schemes. This difference in performance illustrates the importance of having the decimation factor at the encoder.