1. Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design

2. Digital Systems© Umm Al-Qura – slide 2 Binary Logic and Gates : Digital circuits contain hardware elements called “logic gates” that perform logic operations on binary numbers. Boolean algebra is the mathematical system that provides the basis for these logic operations. Boolean variable is a logic variable that has two-valued binary digits “1” or “0”. The analysis and design of logic circuits are guided by Boolean algebra. Introduction:

3. Digital Systems© Umm Al-Qura – slide 3 Binary Logic and Gates : C- Logic gates: They are the hardware elements that implement the logic operation over the binary variables.

4. Digital Systems© Umm Al-Qura – slide 4 Binary Logic and Gates : NOTORAND 0 · 0 = 0 0 · 1 = 0 1 · 0 = 0 1 · 1 = 1 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 1 10  01 

5. Digital Systems© Umm Al-Qura – slide 5 Binary Logic and Gates : 2)- OR operation: The OR operation for two variables X and Y generates a result of 0 if both variable X and Y are 0, otherwise it generates 1. The plus “ + ” or “ ˅ ” symbol are used to represent the OR operation. The OR operation between two binary variables is: 1)- AND operation: The AND operation for two variables X and Y generates a result of 1 if both variable X and Y are 1, otherwise it generates 0. The dot “. “Or “^” symbol are used to represent the AND operation. The AND operation between two binary variables is: OutputInput Z= X.YYX 000 010 001 111 AND gate OR gate

6. Digital Systems© Umm Al-Qura – slide 6 Binary Logic and Gates : 3)- NOT operation: The NOT operation is provided for one variable X. It generates 1 if X is 0 and generates 0 if X is 1 The NOT operation of a binary digit provides the results: OutputInput Z= X‾X 10 01 NOT gate

7. Digital Systems© Umm Al-Qura – slide 7 Truth Tables – Cont’d:  Used to evaluate any logic function  Consider F(X, Y, Z) = X Y + Y Z XYZX YYY ZF = X Y + Y Z 0000100 0010111 0100000 0110000 1000100 1010111 1101001 1111001

8. Digital Systems© Umm Al-Qura – slide 8 Logic Function Implementation:

9. Digital Systems© Umm Al-Qura – slide 9 Logic Function Implementation: And waveform behavior in time as follows :

10. Digital Systems© Umm Al-Qura – slide 10 Binary Logic and Gates : Derived Logic Gates and Operations: The other derived logic operations are: a) NAND operation. b) NOR operation. c) Exclusive-OR (XOR) operation. d) Exclusive-NOR (XNOR) operation. 1)- NAND operation: The NAND output is generated by inverting the output of AND operation. NAND gate

11. Digital Systems© Umm Al-Qura – slide 11 Binary Logic and Gates : 2)- NOR operation: The NOR output is generated by inverting the output of OR operation. OutputInput YX 100 010 001 011 NOR gate 3)- XOR operation: The XOR operation for two variables X and Y generates a result of 1 if the inputs are different and generates 0 if the inputs are the same. The + symbol is used to represent the XOR operation. The XOR operation between two binary variables is: XOR gate

12. Digital Systems© Umm Al-Qura – slide 12 Binary Logic and Gates : 4)- XNOR operation: The XNOR operation for two variables X and Y generates a result of 0 if the inputs are different and generates 1 if the input are the same. The ʘ symbol are used to represent the XOR operation. The XOR operation between two binary variables is: XNOR gate Note (1) In XOR: Be output = 1 if the number of (1) at the input (odd number). Note (2) In XNOR: Be output = 1 if the number (0) in the input (even number).

13. Digital Systems© Umm Al-Qura – slide 13 Logic Diagrams and Expressions:

14. Digital Systems© Umm Al-Qura – slide 14 Boolean Algebra: Boolean algebra is a symbolic notation deals with logic statements that takes a value of “true” or “false”. Boolean algebra provides basis for logic operations using binary variables that are represented by alphabetic characters. The binary variable can have either “true” or “false”. The Boolean function can contain the variable and its complement (A and A ).

15. Digital Systems© Umm Al-Qura – slide 15 Boolean Algebra: Boolean Algebra laws:

16. Digital Systems© Umm Al-Qura – slide 16 Boolean Algebra:

17. Digital Systems© Umm Al-Qura – slide 17 Boolean Algebra: Prove 1: OutputInput B‾A‾A+BBA 1111000 0010110 0100101 0000111 Prove 2: OutputInput B‾A‾ABBA 1111000 1011010 1101001 0000111

18. Digital Systems© Umm Al-Qura – slide 18 Boolean Algebra:

19. Digital Systems© Umm Al-Qura – slide 19 Boolean Algebra: Example: Shorten the next logical functions to its simplest form.

20. Digital Systems© Umm Al-Qura – slide 20 Boolean Algebra: Find the complement each of the following functions: 1)F = xyz + xyz F = xyz+ x yz = xyz. x yz =(x = +y ‾ +z = ). (x = +y = +z ‾ ) =(x+y ‾ +z). (x+y+z ‾ ) 2) F = x. (y ‾ z ‾ +yz) F = x. (y ‾ z ‾ +yz) = x‾ + (y ‾ z ‾ +yz) = x‾ + y ‾ z ‾. Yz = x‾ +( y + z ). (Y‾+z‾) Example:

21. Digital Systems© Umm Al-Qura – slide 21 Binary Logic and Gates : The Boolean function can be represented in two forms: Truth Table: It represent function in a tabular form. Logic gates: It represent function in a logical form. Representation of Functions:

22. Digital Systems© Umm Al-Qura – slide 22 Binary Logic and Gates :

23. Digital Systems© Umm Al-Qura – slide 23 Binary Logic and Gates :

24. Digital Systems© Umm Al-Qura – slide 24 Binary Logic and Gates :

25. Digital Systems© Umm Al-Qura – slide 25 Binary Logic and Gates :

26. Digital Systems© Umm Al-Qura – slide 26 Binary Logic and Gates :

27. Digital Systems© Umm Al-Qura – slide 27 Binary Logic and Gates : 5- NAND, NOT Gates. F= (X ʘ Y) ʘ (X ʘ Y)

28. Digital Systems© Umm Al-Qura – slide 28 Binary Logic and Gates : Example: Extract the logical functions (F) of the following logic gates :