Download presentation

Presentation is loading. Please wait.

Published byReagan Baston Modified over 2 years ago

1
Logic Functions Logical functions can be expressed in several ways: ▫ Truth table ▫ Logical expressions ▫ Graphical form prepared by:eng.Rula Amjed

2
3-input majority function ABCF 0000 0010 0100 0111 1000 1011 1101 1111 Logical expression form F = A B + B C + A C prepared by:eng.Rula Amjed

3
Logical Equivalence All three circuits implement F = A B function prepared by:eng.Rula Amjed

4
One of the primary requirements when dealing with digital circuits is to find ways to make them as simple as possible. This requires that complex logical expressions be reduced to simpler expressions that produce the same results under all possible conditions. The simpler expression can then be implemented with a smaller, simpler circuit, which in turn saves the price of the unnecessary gates, reduces the number of gates needed, and reduces the power and the amount of space required by those gates. One tool to reduce logical expressions is the mathematics of logical expressions, introduced by George Boole in 1854 and known today as Boolean Algebra. The rules of Boolean Algebra are simple and straight-forward, and can be applied to any logical expression. The resulting reduced expression can then be readily tested with a Truth Table Boolean Algebra prepared by:eng.Rula Amjed

5
Boolean Algebra

6
Boolean Algebra (cont.) prepared by:eng.Rula Amjed

7
To prove a distributive law prepared by:eng.Rula Amjed

8
Example :draw the flowing function: F1 = X + Y‘Z Solution : prepared by:eng.Rula Amjed

10
Simplify the following Boolean functions 1)x(x' + y) 2)x + x'y - 3)(x + y).(x + y‘) Solution : prepared by:eng.Rula Amjed

11
Complement of a Function (A + B + C + D )' = A'B'C'D' (ABCD)' = A' + B' +C' + D' Example1: find the complement of the following function F1 = x'yz' + x'y'z Solution: F1 = (x'yz' + x'y'z)' = (x'yz')'. (x'y'z)' = (x+y'+z). (x+y+z') prepared by:eng.Rula Amjed

12
Example2: find the complement of the following functions F1 = (x+y'+z').(x'+y+z).(x'+y'+z') Solution: F1 =((x+y'+z').(x'+y+z).(x'+y'+z'))' =(x+y'+z')' + (x'+y+z)' + (x'+y'+z')' = (x'yz) + (xy'z') + (xyz) prepared by:eng.Rula Amjed

Similar presentations

OK

Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.

Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on exterior angle theorem Ppt on town planning of indus valley civilization Ppt on lean six sigma Ppt on wireless network security Ppt on entrepreneurship development programmes Ppt on animal kingdom class 9 Ppt on google chrome web browser Ppt on principles of object-oriented programming in c++ Respect for kids ppt on batteries Download ppt on reduce reuse recycle