{'fraction_non_alphanumeric': 0.02666666666666667, 'fraction_numerical': 0.0, 'mean_word_length': 5.743589743589744, '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}}
Computer aided implementation of complex algorithms on DSP's using automatic scaling

A methodology for transforming complex floating-point algorithms into correct fixed-point DSP programs is presented. In particular, an automatic scaling scheme leading to overflow-free programs is described. Depending on the application, scaling generated automatically may either perfectly fit, or be modified in order to substantially improve accuracy. Each case is illustrated by an example (FFT and Recursive Least-Squares algorithms).