1. TOPIC : Truth tables and Primitive Cubes
UNIT 1: Modeling Digital Circuits
Module 1 : Functional Modeling
TOPIC : Truth tables and Primitive Cubes

2. number of possible outcomes = 2n
Truth table
Representation of the function in terms of rows and columns.
The rows represent inputs and the corresponding outputs.
Columns are input and output variables.
It is the simplest way to represent a circuit.
In Boolean arithmetic, the possible values are 0 and 1. So for an n-input gate,
number of possible outcomes = 2n
The inputs are given in an increment of 1 from 0 to 2n-1 in Boolean form.

3. How the truth table is constructed??
Assume there are n inputs (x1,x2,…,xn)
There are 2n different possible input vectors.
Start the first row with (0,0,…,0) as inputs.
Write the corresponding outputs in the same row.
Increment the input vector value by 1 in the subsequent rows and enter the outputs.
Follow this till the last 2n th vector (1,1,…,1) is reached

4. Example of a truth tableC
Out 1
Out = AB’C + A’BC’

5. Primitive Cubes Primitive cubes are compressed form of truth tables.
Observe the truth table of AND gate given below:
Have a look at the first two inputs:
A=0, then out=0 irrespective of the second input B.
For these two input vectors, we call the B input as don’t care. A B
Out(AND) 1

6. Primitive cube examples
Out(AND) 1 A B
Out(AND) X 1
Primitive cube of AND gate
Truth table of AND gate
X is don’t care A B
Out(NOR) 1 A B
Out(NOR) 1 X
Primitive cube of NOR gate
Truth table of NOR gate