Approximate Logic Synthesis and Bi-Decomposition of Sum Of Products forms
-
Updated
Nov 9, 2020 - C
Approximate Logic Synthesis and Bi-Decomposition of Sum Of Products forms
Code repository for the IWLS 2021 Programming Contest
This is work-in-progress (WIP) refactored implementation of "Retreival-guided Reinforcement Learning for Boolean Circuit Minimization" work published in ICLR 2024.
An approximate logic synthesis tool under the maximum error constraint
An application using Cadence IC Package
A collection of the Logic Synthesis about peoples/papers/projects/tutorials...
Highly efficient delay-driven approximate logic synthesis
To generate an electrical circuit from the given input and output boolean values.
An implementation of binary decision tree with fringe-features extraction.
Efficient resubstitution-based approximate logic synthesis
A circuit folding interface in ABC system
This article describes how embedded languages and recursion can be used to create a tool that synthesizes a relatively efficient logical circuit for any chosen permutation of the set of all bit vectors of some fixed length.
An implementation of LUT-Net learning procedure
Yosys passes to syntheize to NaN gates (à la http://tom7.org/nand/)
Electronic design automation for Minecraft
An approach to algorithm optimization through circuit minimization techniques.
Fast Heuristic Minimization of Exclusive-Sums-of-Products
C++ header-only And-Inverter graph (AIG) library
Add a description, image, and links to the logic-synthesis topic page so that developers can more easily learn about it.
To associate your repository with the logic-synthesis topic, visit your repo's landing page and select "manage topics."