{'fraction_non_alphanumeric': 0.018327605956471937, 'fraction_numerical': 0.002290950744558992, 'mean_word_length': 5.474074074074074, '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}}
A novel algorithm for accurate logarithmic number system subtraction

In this paper, a novel algorithm for the computation of Logarithmic Number System (LNS) subtraction is presented. The main feature of the proposed algorithm is that it circumvents the evaluation of the highly nonlinear function traditionally used in logarithmic subtraction. In some cases, this approach permits a reduction of up to 60% in the number of approximation intervals, thus making the realization of cost-effective LNS arithmetic units of very high accuracy feasible. The approach is extended to address certain algorithms that need to be implemented by an LNS processor. Moreover, alternative architectures that implement the computational approach and exhibit different time-area requirements are discussed. For the sake of completeness, upper bounds to the computational errors are offered.