216 citations · 360 across the 15 of their papers we have counts for
17 papers
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…
Simulation-based Verification of SystemC-based VPs at the ESL
Mehran Goli, Rolf Drechsler
SystemC-based Virtual Prototypes (VPs) at the Electronic System Level (ESL) are increasingly adopted by the semiconductor industry. The main reason is that VPs are much earlier ava…
ALF -- A Fitness-Based Artificial Life Form for Evolving Large-Scale Neural Networks
Rune Krauss, Marcel Merten, Mirco Bockholt +1
Machine Learning (ML) is becoming increasingly important in daily life. In this context, Artificial Neural Networks (ANNs) are a popular approach within ML methods to realize an ar…
Polynomial Circuit Verification using BDDs
Rolf Drechsler
Verification is one of the central tasks during circuit design. While most of the approaches have exponential worst-case behaviour, in the following techniques are discussed for pr…
Pick the Right Edge Device: Towards Power and Performance Estimation of CUDA-based CNNs on GPGPUs
Christopher A. Metz, Mehran Goli, Rolf Drechsler
The emergence of Machine Learning (ML) as a powerful technique has been helping nearly all fields of business to increase operational efficiency or to develop new value proposition…
PolyAdd: Polynomial Formal Verification of Adder Circuits
Rolf Drechsler
Only by formal verification approaches functional correctness can be ensured. While for many circuits fast verification is possible, in other cases the approaches fail. In general…
One Additional Qubit is Enough: Encoded Embeddings for Boolean Components in Quantum Circuits
Alwin Zulehner, Philipp Niemann, Rolf Drechsler +1
Research on quantum computing has recently gained significant momentum since first physical devices became available. Many quantum algorithms make use of so-called oracles that imp…
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…
On the Difficulty of Inserting Trojans in Reversible Computing Architectures
Xiaotong Cui, Samah Saeed, Alwin Zulehner +4
Fabrication-less design houses outsource their designs to 3rd party foundries to lower fabrication cost. However, this creates opportunities for a rogue in the foundry to introduce…
Towards Reverse Engineering Reversible Logic
Samah Mohamed Saeed, Xiaotong Cui, Robert Wille +4
Reversible logic has two main properties. First, the number of inputs is equal to the number of outputs. Second, it implements a one-to-one mapping; i.e., one can reconstruct the i…
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…
On quantum circuits employing roots of the Pauli matrices
Mathias Soeken, D. Michael Miller, Rolf Drechsler
The Pauli matrices are a set of three 2x2 complex Hermitian, unitary matrices. In this article, we investigate the relationships between certain roots of the Pauli matrices and how…
Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
Mehdi Saeedi, Robert Wille, Rolf Drechsler
While a couple of impressive quantum technologies have been proposed, they have several intrinsic limitations which must be considered by circuit designers to produce realizable ci…
Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost
Robert Wille, Mehdi Saeedi, Rolf Drechsler
Many synthesis approaches for reversible and quantum logic have been proposed so far. However, most of them generate circuits with respect to simple metrics, i.e. gate count or qua…