216 citations · 360 across the 15 of their papers we have counts for
6 papers · 1 filter
Should We Even Optimize for Execution Energy? Rethinking Mapping for MAGIC Design Style
Simranjeet Singh, Chandan Kumar Jha, Ankit Bende +5
Memristor-based logic-in-memory (LiM) has become popular as a means to overcome the von Neumann bottleneck in traditional data-intensive computing. Recently, the memristor-aided lo…
Finite State Automata Design using 1T1R ReRAM Crossbar
Simranjeet Singh, Omar Ghazal, Chandan Kumar Jha +6
Data movement costs constitute a significant bottleneck in modern machine learning (ML) systems. When combined with the computational complexity of algorithms, such as neural netwo…
fiction: An Open Source Framework for the Design of Field-coupled Nanocomputing Circuits
Marcel Walter, Robert Wille, Frank Sill Torres +2
As a class of emerging post-CMOS technologies, Field-coupled Nanocomputing (FCN) devices promise computation with tremendously low energy dissipation. Even though ground breaking a…
Near Zero-Energy Computation Using Quantum-dot Cellular Automata
Frank Sill Torres, Philipp Niemann, Robert Wille +1
Near zero-energy computing describes the concept of executing logic operations below the (kBT ln 2) energy limit. Landauer discussed that it is impossible to break this limit as lo…
Ancilla-free synthesis of large reversible functions using binary decision diagrams
Mathias Soeken, Laura Tague, Gerhard W. Dueck +1
The synthesis of reversible functions has been an intensively studied research area in the last decade. Since almost all proposed approaches rely on representations of exponential…
A framework for reversible circuit complexity
Mathias Soeken, Nabila Abdessaied, Rolf Drechsler
Reversible single-target gates are a generalization of Toffoli gates which are a helpful formal representation for the description of synthesis algorithms but are too general for a…