Implementing Quin McCluskey algorithm for minimizing logic equations, observation and experimenting with variety of sets of equations to generate conclusion on variance with the algorithm.
-
Updated
Apr 13, 2018 - Python
Implementing Quin McCluskey algorithm for minimizing logic equations, observation and experimenting with variety of sets of equations to generate conclusion on variance with the algorithm.
Purpose of this project is to simplify sum-of-product logic expressions.
Fast Heuristic Minimization of Exclusive-Sums-of-Products
These are the assignments of Second year Analog Digital Electronicd subject
This repository contains the python code related to the Master's Thesis. In particular, this code is in charge of setting up the NN and training them, calculating the importance and developing the design procedures for reducing the final logic implementation complexity.
Logic Expression Compiler, with Logic Minimization, to NAND/NOR Implementation
Logic synthesis and verification framework
This software is designed to help Computer/Electric Hardware Engineers design an efficient digital logic circuit with best optimisation for lowest cost and power consumption to implement any function.
A command line application that makes a more human-friendly version of an Espresso logic minimization output file and allows for combinational logic simulation.
Faster/SpiNNaker implementations of routing table minimization algorithms
Specify and synthesize systems using symbolic algorithms
Logic Minimization in Python
Add a description, image, and links to the logic-minimization topic page so that developers can more easily learn about it.
To associate your repository with the logic-minimization topic, visit your repo's landing page and select "manage topics."