{'fraction_non_alphanumeric': 0.02674591381872214, 'fraction_numerical': 0.01337295690936107, 'mean_word_length': 5.2407407407407405, '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}}
Circuit Area-latency Optimization Technique for High-precision Elementary Functions

Hardware implementation of IEEE-754 double-precision elementary functions, such as square root, reciprocal, etc, requires search for a tradeoff between the logic gate/wire area and the look-up table area. In this paper, we propose a new technique to reduce both the look-up table size and access latency of IEEE-754 double-precision elementary functions. Simulations show that the optimization reduces the total memory requirements for five elementary functions by 1/50 while almost the same computation delay. The technique is simple yet suitable for the SoC design of arithmetic modules