Digital Logic 1/Boolean Logic
Basic Ideas and Concepts
edit- What is a truth table and what can it do
- Mapping a function on a truth table and determining all possible outputs
- Applying principles of Boolean Algebra to minimize given function
- Learn how to apply minterms and maxterms expansion to a truth table
Truth Tables
editA truth table is basically a representation of all the possible input combinations and the functional output of each of those combinations. It will tell you on a case-by-case basis, what will the functional output be in every input instance.
We need a way to represent the 3 basic logic operations in algebraic formulas. (AND, OR, NOT)
Therefore we adopt the following standards for those representations:
A AND B =
A OR B =
NOT A (Inverted A) =
For a simple example, a truth table of the AND gate is given below.
a | b | f = a b |
---|---|---|
0 | 0 | 0 |
0 | 1 | 0 |
1 | 0 | 0 |
1 | 1 | 1 |
In general the number of rows in a truth table will be , where n is the number of variables. So in a 3 variable function where all the inputs are products, the following would be the truth table.
a | b | c | f = a b c |
---|---|---|---|
0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 0 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 0 |
1 | 0 | 1 | 0 |
1 | 1 | 0 | 0 |
1 | 1 | 1 | 1 |
Boolean Algebra
editWe introduce rules of Boolean Algebra to help us deal with simplifying more complex functions. The rules that should be learned are as follows.
Single Variable | Multi-Variable |
---|---|
If then | |
If then | |
Activity
editFormulate a truth table for the given function below: