Getting Started

Probably the simplest way to get started is with an example. 
The following truth table defines a simple combinational logic circuit with 3 inputs {A,B,C} and a single output Y. For simplicity, simpogical always assumes variable names names begin with A and increment in alphabetically.

 Row A         Y
 0 001
 3011 1
 4100 0
 5101 0
 61 1
 711 X

We can write this as follows:


or using Boolean Algebra

Step 1 - Create a truth table with 3 variables.

Run the application, select 3.

Now touch the Create button and a truth table will appear.

Step 2 - Edit the truth table

The logic function we want is Y=m0+m1+m3+m6+d7
Therefore, touch the rows 0,1,3, and 7.

The term m7 is incorrect. It should be a don't care condition. Touch row 7 again

New we have the correct truth table. The next step is to attempt to derive the simplest logic for this table.


Now we have the correct table, the next step is to attempt to derive the simplest logic for this table.
Touch the simplify button and one of the following two screens will appear (depending on which mode you used last).

Touch the 0-1 button to see the results in this mode
Touch the ABC button to see the results in Boolean mode

You might be wondering what these results mean? First of all, it is important to understand there are two possible and equally valid solutions.
  • "Essential Implicants" are the terms that are common to every solution (hence it is essential you include them every time). 
  • Additional terms must be chosen from one of the permutations.

So, the two possible solutions are as follows:

Note that the first two terms in each solution are the same (these are the essential implicants).

Exporting your results

To keep a record of your design and results, you can email them.

Click the compose button on the toolbar 

An email dialog will appear. Complete the To: field and touch send.

The default email address can be set in the application user preferences.