Sumer Analog
All research
NUMERICAL METHODS & DEVICE DESIGN

Solving conservation laws with programmable conductances

Developing circuits with programmable conductances for discretized conservation laws, using Laplace’s equation as an elliptic test case.

Tetrahedral node cloud colored by simulated voltage values, next to an interpolated midplane field map.
A 27-buffer, 1,080-memristor LTspice pilot on a 125-node quadratic finite-element cloud. Left: simulated circuit and prescribed boundary values. Right: a P2-interpolated slice at y = 0.5. Coordinates are nondimensional; voltage is in mV. Small negative slice undershoots saturate at the color scale minimum.

A discretization that fits the circuit

Programmable conductances set the weights in a network of connected circuit nodes. We develop numerical discretizations that use positive conductances and account for the circuit’s limited programming precision. Laplace’s equation provides a demanding elliptic test case for evaluating the approach.

Circuit error and discretization error

The circuit pilot uses 27 CMOS buffers and 1,080 generic stateful RRAM cells. Its final output differs from the programmed matrix solution by 0.0374%. Its interior nodal error against the continuum reference is 4.097%. These comparisons measure different things: how well the circuit solves its programmed equation, and how well that equation approximates the continuum problem.

NEXT RESEARCH NOTE

Analytical models for balanced mixers