CoE 243 SSI Circuits Lab

Purpose:

1. Successfully reduce a Boolean logic equation to its simplest form.

2. Realize the simplified equation using SSI logic devices.

3. Verify that the circuit correctly implements the truth table of the original equation.

4. Convert a circuit made with AND, OR and NOT gates into one with only NAND gates.

Procedure:

Fully reduce the following equation:

X = A'B'C'D' + A'B'C'D + A'B'C D' + A'B C'D' + A'B C'D

+ A B'C'D' + A B'C'D + A B'C D' + A B C'D' + A B C'D

Connect the AND, OR, and NOT gate hardware and prove that the simplified circuit's truth table matches that of the original logic equation.

Now, implement the same truth table using only NAND gates. Verify that your NAND gate circuit does indeed reproduce the original truth table.

Questions:

How many IC's, gates, and wires would have been necessary to implement the original logic equation? How many are required for the reduced equation?

What advantages, besides a lower purchase price for the components, are realized by reducing the complexity of the logic circuit?

How does the "cost" (use relative terms -- not absolute dollars) of the NAND circuit compare to that of the AND-OR-NOT circuit? (Note: "Cost" includes PCB size, number of holes and traces on PCB, assembly time, reliability, parts inventory, power usage, etc.)