|
Boolean Algebra Simplifier |
The free Boolean logic (Boolean algebra) software can be used to rapidly design truth tables and to minimize Boolean equations. Equations and truth tables can have from 1 to 30 variables.
Boolean Equations
Boolean equations can be specified in a variety of formats:
F = A or (B and C); f := (A || (!B && !C));
F(A,B,C,D) = A'BC'D' + AB'C'D' + AB'CD' + AB'CD + ABC'D' + ABCD.
Charge_Indicator_Amber = Charge_LSU && LSU_LED_PWR || Prepare_LSU;
Truth Tables
Each truth table has a row of variables followed by one or more 1/0/x rows:
A B : F G H ' (3) outputs F G H: and, or, xor functions
0 0 0 0 0
1 0 0 1 1
0 1 0 1 1
1 1 1 1 0 ;
User Guide
See Boolean Help for detailed documentation.
Boolean Operators
Any of the following words or symbols can be used as Boolean equation operators:
not / ! and * & && or + | || # nand nor xor $ ^ xnor
Output Options
Comment Lines – Input comments
Input Eqn / TT - Input equation or truth table
Truth Table full - Complete truth table
Minimize - Minimized equation
Invert & Minimize - Minimized complemented equation
Align Minterms - Or-terms aligned vertically
PLA Truth Table - Espresso truth table in PLA format
Sort Terms - Sort variable names and minterms
Logic Design - Truth table formatted for Logic Design Auto
Operator Format - VHDL VB, PALASM, ABEL, C C++ Verilog
