1 / 10

Lecture 10: Emerging Technologies (Part 2)

This lecture discusses the memristor, a fourth fundamental passive circuit element that combines memory and resistance. It explains how a memristor works, its properties, and its potential applications in memory systems, neural networks, and digital circuits. The lecture also demonstrates how memristors can be used to implement logic gates, including the MAGIC gate design style.

lminer
Télécharger la présentation

Lecture 10: Emerging Technologies (Part 2)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Lecture 10: Emerging Technologies (Part 2) PROF. INDRANIL SENGUPTA DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

  2. Voltage (v) Current (i) Flux (Φ) Charge (q) Memristor: An Emerging Technology • In 1971, Leon Chua predicted the existence of a fourth fundamental passive circuit element called Memristor. • Memristor = Memory + Resistor • Resistance value changes in response to applied voltage. • Can memorize its last resistance value even when the voltage is withdrawn. Resistor v = Ri Capacitor v = dΦ/dt Inductor i = dq/dt Φ = Li q = Cv Φ = Mq Memristor

  3. How Memristor Works? • In 2008, a team at HP Labs successfully fabricated a memristor. • They used a material with two regions between two platinum electrodes. • A region of TiO2-x (e.g. Ti4O7) with free oxygen vacancies. (Low Resistance) • A region of pure TiO2. this region is highly resistive. (High Resistance) • The boundary between the two regions moves in response to the voltage applied across the device. 3 nm x 3 nm Pt TiO2-x TiO2 Pt 10-12 nm

  4. Resistance Switching in Memristors • The voltage-current characteristics exhibit a pinched hysteresis loop. • Two distinct resistive regions exist on the curve (RON and ROFF). • Possible to switch from RON to ROFF, or from ROFF and RON by applying a suitable voltage. • This property makes it useful for storage as well as logic design applications. RON ROFF

  5. Some Properties of Memristors • Very small in size. • Very low power consumption, and non-volatile property. • Can be laid out on a crossbar structure in a very compact way. • Applications: • Implementing non-volatile memory systems (Resistive RAM). • Modeling neural networks / neuromorphic computing. • Implementing digital circuits. • Allows a new computing paradigm called in-memory computing (both memory and processing carried out in the same hardware unit).

  6. Implementing Logic Gates using Memristors • Memristor Aided Logic (MAGIC) design style • We can implement all basic gates like AND, OR, NOT, NAND and NOR. • Stateful design style :: inputs are not applied as voltages, but as resistive states in memristors(High resistance – 0, Low resistance – 1). • As a matter of convention, the memristor representing the gate output must be initialized before the computation. • AND, OR : initialized to 0. • NOT, NAND, NOR : initialized to 1. • A voltage Vo of appropriate magnitude is applied for gate evaluation; Vo must be large enough to enable the output memristor to switch state when required.

  7. MAGIC Gate Examples

  8. IMPLY function implementation using memristors • Material Implication function: A  B = A’ + B • Can be implemented using two memristors and one resistor. • The inputs are applied by initializing the resistive states of the two memristors. • The output gets stores as resistive state in the second memristor. • The IMPLY function along with constant 0 is functionally complete. • We can realize any basic gate, and hence any arbitrary function.

  9. IMPLY Realization

  10. END OF LECTURE 10

More Related