{'fraction_non_alphanumeric': 0.02707275803722504, 'fraction_numerical': 0.00338409475465313, 'mean_word_length': 5.040816326530612, '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}}
New algorithms for carry propagation

This paper presents the analysis and implementation of different algorithms for carry propagation in binary adders. Besides traditional AND-OR-Invert based adders, NAND-type and NOR-type adders with single-gate delay per bit are studied as well. A unified classification based on work by Ling and Doran is presented. The new techniques are applied to ripple-carry adders, carry-skip adders and conditional-sum adders. Transistor level implementations in static and dynamic CMOS logic, as well as simulation results using a 90nm technology are presented.