{'fraction_non_alphanumeric': 0.021164021164021163, 'fraction_numerical': 0.0, 'mean_word_length': 5.454545454545454, '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}}
Multiplierless Piecewise Linear Approximation of Elementary Functions

In this work a multiplierless architecture for piecewise linear approximation of elementary functions is discussed. By limiting the slope coefficient to a given number of signed-power-of-two (SPT) terms the general multiplier can be replaced by configurable shifts and a multi-input adder. The considered architecture was proposed in an earlier work for use in direct digital frequency synthesizers (DDFS). We extend it to arbitrary functions and propose some techniques to reduce the complexity.