Concepedia

Two memristors suffice to compute all Boolean functions

Eero Lehtonen, Jussi Poikonen, Mika Laiho

Electronics Letters · 2010 · 116 citations · 5 references

Concepts

Circuit ComplexityHardware SecurityElectrical EngineeringLogic SynthesisEngineeringBoolean FunctionCircuit DesignBoolean FunctionsComputer ArchitectureComputer EngineeringComputer ScienceDigital Circuit DesignMicroelectronicsLogic DesignRecursive Conjunctive Form

Abstract

It is proved that all Boolean functions can be computed using two memristors. To achieve this, a recursive conjunctive form for Boolean functions is introduced and its universality shown.

References

5

The missing memristor found

Dmitri B. Strukov, Gregory S. Snider, Duncan R. Stewart et al. · Nature · 2008 · 11.2K citations

Microelectronics, Memory Device, Semiconductor Memory +1

Memristor-The missing circuit element

Leon O. Chua · IEEE Transactions on Circuit Theory · 1971 · 9.7K citations

Electromagnetic Measurements, Electrical Engineering, Electromagnetic Field Interpretation +10

Minimization of Boolean Functions*

E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations

Circuit Complexity, Mathematical Programming, Logic Synthesis +11

The map method for synthesis of combinational logic circuits

M. Karnaugh · Transactions of the American Institute of Electrical Engineers Part I Communication and Electronics · 1953 · 623 citations

Logic Synthesis, Simple Abstract Techniques, Engineering +13

Stateful implication logic with memristors

Eero Lehtonen, Mika Laiho · 2009 · 211 citations

Circuit Complexity, Additional Memristors, Engineering +17