Quine-McCluskey

This is a program which helps to simplify boolean equations, using the Quine-McCluskey method. It has several input options, and produces a file with the process followed. Supports a maximum 29 input variables, depending on present memory on the computer.

Project Activity

See All Activity >

Follow Quine-McCluskey

Quine-McCluskey Web Site

You Might Also Like

Red Hat Ansible Automation Platform on Microsoft Azure

Red Hat Ansible Automation Platform on Azure allows you to quickly deploy, automate, and manage resources securely and at scale.

Deploy Red Hat Ansible Automation Platform on Microsoft Azure for a strategic automation solution that allows you to orchestrate, govern and operationalize your Azure environment.

Learn More

Rate This Project

User Reviews

Be the first to post a review of Quine-McCluskey!

Additional Project Details

Registered

2006-02-14

Report inappropriate content

Recommended Projects

Quine-McCluskey logic simplifier
Quine-McCluskey boolean logic simplifier implemented in C++. It allows simplifying up to 32 variable input functions, including don't-care values. The program was written for digital design classes at the Poznan University of Technology (Poland).
Quine McCluskey Simplifier
The Quine McCluskey Simplifier(qmcs) is a tool used to simplify a boolean function. With the input of binary/decimal data the program calculates the prime implicants, which are then used to calculate the essential prime implicants.
TRUTH TABLE SOLVER
Truth Table Solver is a program that solves the truth table and output all the possible minimized boolean expressions.It uses Quine-McCluskey algorithm (Tabulation method) for boolean minimization.It has an easy to use GUI and a command line mode.