Memristor based N-bits redundant binary adder

• Memristor based circuit architecture to eliminate carry propagation is proposed.
• Addition/subtraction operation independent of the operands word-length is achieved.
• N-bit redundant adder that holds three states for CSD code is presented.
• The ideas are verified using HP memristor model and PSPICE simulations.

This paper introduces a memristor based N-bits redundant binary adder architecture for canonic signed digit code CSDC as a step towards memristor based multilevel ALU. New possible solutions for multi-level logic designs can be established by utilizing the memristor dynamics as a basis in the circuit realization. The proposed memristor-based redundant binary adder circuit tries to achieve the theoretical advantages of the redundant binary system, and to eliminate the carry (borrow) propagation using signed digit representation. The advantage of carry elimination in the addition process is that it makes the speed independent of the operands length which speeds up all arithmetic operations. One memristor is sufficient for both the addition process and for storing the final result as a memory cell. The adder operation has been validated via different cases for 1-bit and 3-bits addition using HP memristor model and PSPICE simulation results.

Figure optionsDownload as PowerPoint slide