logic-minimization

Specify and synthesize systems using symbolic algorithms

Logic Minimization in Python

Espresso Logic Minimizer - Modernized Edition

Fast Heuristic Minimization of Exclusive-Sums-of-Products

An implementation of the Quine-McCluskey-Algorithm for Boolean function minimization, written in C.

Purpose of this project is to simplify sum-of-product logic expressions.

Logic Expression Compiler, with Logic Minimization, to NAND/NOR Implementation

Faster/SpiNNaker implementations of routing table minimization algorithms

Interactive Karnaugh map minimization tool generating optimized SOP/POS expressions, Verilog code, circuit diagrams, and waveforms.

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.

Tic-Tac-Toe AI powered by Karnaugh Maps and Boolean Logic

These are the assignments of Second year Analog Digital Electronicd subject

An implementation of the Quine-McCluskey algorithm for Boolean function minimization

Python implementation of the ESPRESSO heuristic Boolean logic minimization algorithm

A command line application that makes a more human-friendly version of an Espresso logic minimization output file and allows for combinational logic simulation.

Boolean Expression Simplifier

Boolean function minimizer in C++ -- exact Quine-McCluskey and heuristic multi-pass Espresso algorithms, reading standard PLA format.

A full Karnaugh map solver and interactive tutor for minimising 2, 3 and 4-variable boolean functions.

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.