Lab # 3

NAND / NOR Implementation of a Function

 

  1. Simplify the following Boolean function using a Karnaugh map and determine the minimum sum of products and the minimum product of sums.
  2. F = å m(3,4,13,15) + d(1,2,5,6,8,10,12,14)

  3. Verify your answer using EWB.
  4. Draw the circuits using all NAND gates and all NOR gates.
  5. Implement the minimum sum of products on a breadboard.
  6. Verify the operation of your circuit and have your lab signed off.