Documentation, theory and tutorials for Karnaugh map simplifier
-
Updated
Dec 24, 2017 - HTML
Documentation, theory and tutorials for Karnaugh map simplifier
A visual and easy to use Karnaugh Map Solver application (.Net 4.7, C#, Windows Forms)
Object-oriented C++ code that can solve the Karnaugh map of N variables
Karnaugh-map for 2 , 3 and 4 variables in both sum of product and product of sum expressions, which takes min-terms or max-terms as input and return simplified expression with desired variables.
Minimize Boolean functions using Quine-McCluskey and Petrick's algorithm.
Assignment 4, Digital Logic Design Lab, Spring 2021, IIT Bombay
software implementation of the tabular method (Quine-McCluskey) to minimize boolean expressions
Boolean algebra simplifier based on n-dimensional k-maps
Boolean minimization using Karnaugh maps. Works for any number of bits >3.
A C++ implementation of the Quine-McCluskey algorithm.
Here lies a collections of miscellaneous circuits I have created using Logisim
Solve Karnaught Map
Calculates Multiple Karnaugh Maps at once using Selenium and custom built parser. The program then converts the Boolean Expressions into Dataflow Verilog (VHDL)
This dataset imbalance visualization toolkit will be the beginning of a fire-new branch in NILM studies. (the website is pending)
Here lies a collection of miscellaneous circuits I have created using LogicWorks
Karnaugh simplify and other electronic related stuffs with GUI for ease of use
Conjunto de ferramentas úteis para a Ciência da Computação. Desde a conversão da base numérica até a geração de tabelas verdade e mapas de Karnaugh.
Mise en application des tableaux de Karnaugh
web application for simplifying Boolean expressions
Add a description, image, and links to the karnaugh-map topic page so that developers can more easily learn about it.
To associate your repository with the karnaugh-map topic, visit your repo's landing page and select "manage topics."