{'fraction_non_alphanumeric': 0.015384615384615385, 'fraction_numerical': 0.0, 'mean_word_length': 6.109243697478991, '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}}
Designing Optimized Imprecise Fixed-Point Arithmetic Circuits Specified by polynomials with Various Constraints

Arithmetic circuits in general do not exactly match specifications, leading to different implementations within allowed imprecision. Starting from real-valued representation, such as Taylor series, we propose a new technique based on arithmetic transform (AT) to analyze simultaneous selection of multiple word lengths and even the function approximation schemes, and then derive a verification algorithm to check whether an implementation fits the error bound. To find optimized implementations which both satisfy a given error bound and constraints included interface input, delay and area. An optimization algorithm is derived to explore multiple precision parameters and get the optimized implementations by various constraints.