{'fraction_non_alphanumeric': 0.01924500370096225, 'fraction_numerical': 0.008142116950407105, 'mean_word_length': 5.288372093023256, '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}}
High-order Taylor series approximation for efficient computation of elementary functions

A new piecewise polynomial method is proposed to compute elementary functions by using high-order Taylor approximation. The high-order power terms of the series are proposed to be approximated by using simple and fast table lookup. Furthermore, the similarity and regularity among the Taylor coefficients can make possible the sharing of the lookup tables. The authors have developed an error analysis method to estimate the maximum error of the proposed approximation approach, and formulated the procedure for determining the hardware parameters in the approximation unit. Finally, the authors have designed a single-precision approximation unit for computing six common elementary functions. The coefficient sharing approach can result in at least 30.5% reduction in the coefficient lookup tables. Compared with a previous work by Pineiro et al., the authors can save 27.91% of the lookup tables with some extra cost in computation hardware. Compared with the work by Alimohammad et al., 34.85% of the lookup tables can be saved with the same computation hardware cost. The authors conclude that the proposed approaches can effectively reduce the lookup tables required in the piecewise polynomial approximation for efficient elementary function computation.