{'fraction_non_alphanumeric': 0.018808777429467086, 'fraction_numerical': 0.0, 'mean_word_length': 5.326732673267327, '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}}
A dynamic programming approach to variable rate speech transmission

For many sounds, the successive frames of a speech signal do not differ significantly, and they can be represented by the same set of parameters (PARCOR coefficients). This paper examines the possibility of transmitting only some of the new parameters and replacing the rest by the parameters already transmitted. Several frames are considered, and all the possible decision sequences (paths) are examined by using a dynamic programming approach. The path which minimizes a preselected cost function is chosen for transmission, resulting in a reduced average data rate.