Download presentation

1
**ECE 238L Computer Logic Design Spring 2010**

Lab -1 Introduction to Discrete Digital Logic 01/25/10

2
Lecture Notes – Lab 1 Basic logic gates And Gate Or Gate 01/25/10

3
**Elementary Theorem - Identity**

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

4
**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 01/25/10

5
**Lecture Notes – Lab 1 Other Theorem Combining: 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) 01/25/10

6
**Lecture Notes – Lab 1 Example 1**

Design a circuit for the following function: F3= (Y + Z') X + X'YZ=XY + XZ’ + X’YZ F3=X'YZ+XY'Z'+XYZ'+XYZ=M3+M4+M6+M7 F3 equals 1 when XY or XZ’ or X’YZ equals 1 Is it the simplist? 01/25/10 Note: every row of a truth table with a one in the output column is called a minterm

7
**Lecture Notes – Lab 1 K-maps**

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). 01/25/10

8
**Design an AND/OR circuit**

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

9
**Lecture Notes – Lab 1 Lab 1 task:**

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 01/25/10

10
**Step 1: Truth Table corresponding to**

F = A'B'D + BC'D + A'BC + ACD A B C D F 1 01/25/10

11
**Step 2: Simplify the Equation**

1- Maps the TT to K-map CD AB 00 01 11 10 1 2- Simplify the boolean function A’D CD AB 00 01 11 10 1 A’BC BD 01/25/10 CD

12
**Step 3: Draw the logic diagram**

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

Similar presentations

OK

1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates, with each.

1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates, with each.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on regional trade agreements example Ppt on biodegradable and non biodegradable materials Ppt on observation method of data collection Viewer ppt online shopping Ppt on effective business communication Ppt on holographic technology for health Full ppt on electron beam machining cost Ppt on natural resources and their conservation Ppt on reliance life insurance Ppt on index of industrial production definition