Download presentation

Presentation is loading. Please wait.

Published byMartin Reaver Modified about 1 year ago

1
ECE 238L Computer Logic Design Spring 2010 Lab -1 Introduction to Discrete Digital Logic 01/25/101

2
2 Basic logic gates And Gate Or Gate Lecture Notes – Lab 1

3
01/25/103 Inverter Elementary Theorem - Identity X*1 = X; X*0 = 0X + 1 = 1; X + 0 = X NAND Lecture Notes – Lab 1 Basic logic gates

4
01/25/104 Lecture Notes – Lab 1 Other Theorem Commutative: x*y=y*x, x+y=y+x Associative: x*(y*z)=(x*y)*z x+(y+z)=(x+y)+z Distributive: x*(y+z)=x*y+x*z x+y*z=(x+y)*(x+z) Absorption: x+x*y=x x*(x+y)=x

5
01/25/105 Lecture Notes – Lab 1 Other Theorem Combining: x*y+x*y'=x, (x+y)(x+y')=x DeMorgan's theorem:(x*y)'=x'+y' (x+y)'=x'+y' x+x'y=x+y x(x'+y)=xy Consensus: xy+yz+x'z=xy+x'z (x+y)(y+z)(x'+z)=(x+y)(x'+z)

6
01/25/106 F3= (Y + Z') X + X'YZ=XY + XZ’ + X’YZ Design a circuit for the following function: F3=X'YZ+XY'Z'+XYZ'+XYZ=M 3 +M 4 +M 6 +M 7 F3 equals 1 when XY or XZ’ or X’YZ equals 1 Is it the simplist? Example 1 Lecture Notes – Lab 1 Note: every row of a truth table with a one in the output column is called a minterm

7
01/25/107 K-maps Lecture Notes – Lab 1 The idea behind a Karnaugh Map (Karnaugh, 1953) is to draw an expression’s truth table as a matrix in such a way that each row and each column of the matrix puts the minterms that differ in the value of a single variable adjacent to each other. Basic Rules Every minterm must be inside at least one rectangle, but there must not be any zeros inside any rectangles. Every rectangle has to be as large as possible. Rectangles may wrap around to include cells in both the leftmost and rightmost columns. Likewise for the top and bottom rows. The number of minterms enclosed in a rectangle must be a power of two (1, 2, 4, 8, or 16 minterms for 4-variable maps).

8
01/25/108 F3= YZ + XZ' Logic diagram Layout diagram - position on the breadboard Design an AND/OR circuit Lecture Notes – Lab 1

9
01/25/109 Lecture Notes – Lab 1 Simplify the function F = A'B'D + BC'D + A'BC + ACD, and design a circuit for the simplified function using any 7400 logic you wish. Step 1: Draw the Truth Table Step 2: Simplify the Equation Step 3: Draw the logic diagram performing the Equation in Step 2 Step 4: Draw the corresponding layout diagram Step 5: Implement the circuit Lab 1 task:

10
01/25/1010 Step 1: Truth Table corresponding to F = A'B'D + BC'D + A'BC + ACD ABCDF

11
01/25/1011 Step 2: Simplify the Equation 1- Maps the TT to K-map 2- Simplify the boolean function AB CD AB CD BD A’D CD A’BC

12
01/25/1012 Step 3: Draw the logic diagram F = A’BC + BD + CD + A’D Step 4: Draw the layout diagram Step 5: Implement the circuit

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google