Bambu: an open-source research framework for the high-level synthesis of complex applications
This paper presents the open-source high-level synthesis (HLS) research framework
Bambu. Bambu provides a research environment to experiment with new ideas across HLS …
Bambu. Bambu provides a research environment to experiment with new ideas across HLS …
staq—A full-stack quantum processing toolkit
M Amy, V Gheorghiu - Quantum Science and Technology, 2020 - iopscience.iop.org
We describe staq, a full-stack quantum processing toolkit written in standard C++. staq is a
quantum compiler toolkit, comprising of tools that range from quantum optimizers and …
quantum compiler toolkit, comprising of tools that range from quantum optimizers and …
Hexagons are the bestagons: design automation for silicon dangling bond logic
Field-coupled Nanocomputing (FCN) defines a class of post-CMOS nanotechnologies that
promises compact layouts, low power operation, and high clock rates. Recent breakthroughs …
promises compact layouts, low power operation, and high clock rates. Recent breakthroughs …
LSOracle: A logic synthesis framework driven by artificial intelligence
The increasing complexity of modern Integrated Circuits (ICs) leads to systems composed of
various different Intellectual Property (IPs) blocks, known as System-on-Chip (SoC). Such …
various different Intellectual Property (IPs) blocks, known as System-on-Chip (SoC). Such …
On-the-fly and DAG-aware: Rewriting Boolean networks with exact synthesis
H Riener, W Haaswijk, A Mishchenko… - … , Automation & Test …, 2019 - ieeexplore.ieee.org
The paper presents a generalization of DAG-aware AIG rewriting for k-feasible Boolean
networks, whose nodes are k-input lookup tables (k-LUTs). We introduce a high-effort DAG …
networks, whose nodes are k-input lookup tables (k-LUTs). We introduce a high-effort DAG …
RevSCA: Using reverse engineering to bring light into backward rewriting for big and dirty multipliers
In recent years, formal methods based on Symbolic Computer Algebra (SCA) have shown
very good results in verification of integer multipliers. The success is based on removing …
very good results in verification of integer multipliers. The success is based on removing …
Circuit minimization with QBF-Based exact synthesis
FX Reichl, F Slivovsky, S Szeider - … of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
This paper presents a rewriting method for Boolean circuits that minimizes small subcircuits
with exact synthesis. Individual synthesis tasks are encoded as Quantified Boolean …
with exact synthesis. Individual synthesis tasks are encoded as Quantified Boolean …
RevSCA-2.0: SCA-based formal verification of nontrivial multipliers using reverse engineering and local vanishing removal
The formal verification of integer multipliers is one of the important but challenging problems
in the verification community. Recently, the methods based on symbolic computer algebra …
in the verification community. Recently, the methods based on symbolic computer algebra …
Beyond local optimality of buffer and splitter insertion for AQFP circuits
SY Lee, H Riener, G De Micheli - Proceedings of the 59th ACM/IEEE …, 2022 - dl.acm.org
Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting
technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the …
technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the …
Reducing the multiplicative complexity in logic networks for cryptography and security applications
Reducing the number of AND gates plays a central role in many cryptography and security
applications. We propose a logic synthesis algorithm and tool to minimize the number of …
applications. We propose a logic synthesis algorithm and tool to minimize the number of …