{'fraction_non_alphanumeric': 0.022636484687083888, 'fraction_numerical': 0.0, 'mean_word_length': 5.427350427350428, '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 class of stored-transfer representations for redundant number systems

Redundant representations play an important role in highspeed computer arithmetic. One key reason is that such representations support carry free addition; i.e., addition in a small, constant time, independent of operand widths. We explore the implications of stored-transfer or transfer-save representation of digit sets for redundant number systems on the speed and cost of arithmetic algorithms and show that our methods lead to some of the fastest, most efficient implementations of carry free arithmetic reported thus far. The speed/efficiency arises from storing or saving, instead of combining through addition, the transfer values generated during carry free arithmetic.