{'fraction_non_alphanumeric': 0.02050326188257223, 'fraction_numerical': 0.001863932898415657, 'mean_word_length': 4.805405405405406, '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}}
Efficient implementation of adder circuits in memristive crossbar array

Memristor is a two terminal passive circuit element that can be used in non-volatile storage applications. In addition, memristor can also be used to implement logic functions. This paper presents the design of adder circuits in memristor crossbar. We have used the MAGIC design style to implement the gates required for the adder circuits. The implementation is based on in-memory computing where the input data is assumed to be stored in the crossbar, and the processing is done in the storage unit itself. We have estimated the gate delay and switching energy using SPICE simulation under Cadence Virtuoso environment. We have evaluated the latency of the half adder, full adder, 4-bit ripple carry, 4-bit carry lookahead adder and generalized the latency and area estimates for an n-bit ripple-carry adder. The proposed method is compared with an alternate memristor based synthesis method (viz. IMPLY) and is found to be more efficient in terms of latency and energy with similar area overheads.