Truth table to boolean expression

Click For Summary

Discussion Overview

The discussion revolves around finding a program that can deduce minimized Boolean expressions from a large truth table with 9 inputs and 9 outputs. The focus is on software solutions that can handle extensive data and include features for pasting from a clipboard and managing don't care states.

Discussion Character

  • Technical explanation, Debate/contested, Experimental/applied

Main Points Raised

  • One participant seeks a program capable of generating minimized Boolean expressions from a large truth table, specifically mentioning issues with Logisim crashing due to the size of the data.
  • Another participant suggests using Karnaugh maps and searching for "Karnaugh reduction software," noting that this is a well-known problem in logical circuit design.
  • A later reply acknowledges familiarity with K-maps and the Quine-McCluskey algorithm but expresses a preference for a program that can automate the process due to time constraints.
  • Another participant points to a Python implementation of the Quine-McCluskey algorithm as a potential solution, given the original poster's use of Python for generating the truth table.

Areas of Agreement / Disagreement

Participants do not reach a consensus on a specific software solution, and multiple suggestions are offered without agreement on the best approach.

Contextual Notes

The discussion does not resolve the limitations of the suggested methods or the specific requirements for handling large truth tables and don't care states.

Bipolarity
Messages
773
Reaction score
2
I have a 9 input to 9 output truth table I constructed using Python. I am trying to find a program that can deduce the (hopefully minimized) Boolean expression for my outputs. I tried Logisim already, but when I try to paste the enormous data (512 rows), my Logisim crashes. Can anyone recommend me a program that generates minimized Boolean expressions from huge truth tables with its own paste feature (so I can paste the truth table from a clipboard)? It should have don't care states also.

Thanks!

BiP
 
Engineering news on Phys.org
The general method (which I've only done by hand for 3 or so inputs) involves using Karnaugh maps so you can start by searching "Karnaugh reduction software" or something similar. Note that this is a classic problem in logical circuit design (creating logic gates with minimal number of components on a IC chip) and so you will find a great deal of info out there.

... a quick look on wikipedia got this:
Espresso heuristic logic minimizer
 
Thanks.
I am aware of K-maps and the Quine-McCluskey minimization algorithm. It's just that I don't have the time to draw out a 9-bit K-map. I have the truth table at hand, just need a program (can be proprietary) that can do the Boolean work for me.

BiP
 
The wikipedia page on the subject points to a Python implementation of the Quine McCluskey algorithm, it might be ideal given you started in python generating your table.

https://pypi.python.org/pypi/qm/0.2
 

Similar threads

Undergrad Implication, Boolean Expression and Venn Diagrams
  • · Replies 12 ·
Replies
12
Views
8K
Designing an XOR Gate from NOR Gates: Truth Tables and Boolean Algebra
  • · Replies 4 ·
Replies
4
Views
6K
Engineering NAND Logic 4 input circuit with nonstandard output
  • · Replies 2 ·
Replies
2
Views
2K
Graduate Minimizing systems of boolean functions as per specific gate costs
  • · Replies 6 ·
Replies
6
Views
2K
MHB Logic Circuits and Truth Tables
  • · Replies 9 ·
Replies
9
Views
3K
Undergrad Boolean algebra: Simplifying logical expression
  • · Replies 15 ·
Replies
15
Views
4K
Engineering Boolean and truth table for circuit
  • · Replies 4 ·
Replies
4
Views
2K
MHB Truth Tables/Minimizing/SOP/POS Part 2
  • · Replies 1 ·
Replies
1
Views
4K
MHB Can KMAP Fully Minimize This SOP Expression?
  • · Replies 4 ·
Replies
4
Views
2K
How to Create a Truth Table for a 10 Cent Coffee Machine?
  • · Replies 5 ·
Replies
5
Views
3K