Scribd
Upload
2 views

boolean functions and theorems

The document provides an overview of binary logic, logic gates, and Boolean algebra, which are fundamental for designing and analyzing digital systems. It explains basic logical operators (AND, OR, NOT), their representations, and truth tables, along with the principles of Boolean algebra and its identities. Additionally, it includes examples of Boolean algebraic proofs and the application of DeMorgan's laws.

Uploaded by

Dr.S.Premalatha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

boolean functions and theorems

The document provides an overview of binary logic, logic gates, and Boolean algebra, which are fundamental for designing and analyzing digital systems. It explains basic logical operators (AND, OR, NOT), their representations, and truth tables, along with the principles of Boolean algebra and its identities. Additionally, it includes examples of Boolean algebraic proofs and the application of DeMorgan's laws.

Uploaded by

Dr.S.Premalatha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Overview

Gate Circuits and Boolean Equations


• Binary Logic and Gates
• Boolean Algebra

Chapter 2 - Part 1 1
Binary Logic and Gates
 Binary variables take on one of two values.
 Logical operators operate on binary values and
binary variables.
 Basic logical operators are the logic functions
AND, OR and NOT.
 Logic gates implement logic functions.
 Boolean Algebra: a useful mathematical system
for specifying and transforming logic functions.
 We study Boolean algebra as foundation for
designing and analyzing digital systems!

Chapter 2 - Part 1 2
Notation Examples
 Examples:
• Y = A×B is read “Y is equal to A AND B.”
• z = x + y is read “z is equal to x OR y.”
• X = A is read “X is equal to NOT A.”
 Note: The statement:
1 + 1 = 2 (read “one plus one equals two”)
is not the same as
1 + 1 = 1 (read “1 or 1 equals 1”).

Chapter 2 - Part 1 3
Operator Definitions
 Operations are defined on the values
"0" and "1" for each operator:

AND OR NOT
0·0=0 0+0=0 0 =1
0·1=0 0+1=1 1= 0
1·0=0 1+0=1
1·1=1 1+1=1

Chapter 2 - Part 1 4
Truth Tables
 Truth table - a tabular listing of the values of a
function for all possible combinations of values on its
arguments
 Example: Truth tables for the basic logic operations:
AND OR NOT
X Y Z = X·Y X Y Z = X+Y X Z= X
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1
1 1 1
Chapter 2 - Part 1 5
Logic Function Implementation
 Using Switches Switches in parallel => OR
• For inputs:
 logic 1 is switch closed
 logic 0 is switch open
• For outputs:
Switches in series => AND
 logic 1 is light on
 logic 0 is light off.
• NOT uses a switch such
that: Normally-closed switch => NOT
 logic 1 is switch open C
 logic 0 is switch closed

Chapter 2 - Part 1 6
Logic Gate Symbols and Behavior
 Logic gates have special symbols:
X X
Z 5 X ·Y Z5 X1 Y X Z5 X
Y Y
AND gate OR gate

(a) Graphic symbols


 And waveform behavior in time as follows:
X 0 0 1 1

Y 0 1 0 1

(AND) X · Y 0 0 0 1

(OR) X1 Y 0 1 1 1

(NOT) X 1 1 0 0
(b) Timing diagram
Chapter 2 - Part 1 7
Boolean Algebra
 An algebraic structure defined on a set of at least two elements,
B, together with three binary operators (denoted +, · and ) that
satisfies the following basic identities:

1. X+0= X 2. X .1 =X
3. X+1 =1 4. X .0 =0
5. X+X =X 6. X .X = X
7. X+X =1 8. X .X = 0
9. X=X
10. X + Y = Y + X 11. XY = YX Commutative
12. (X + Y) + Z = X + (Y + Z) 13. (XY) Z = X(YZ) Associative
14. X(Y + Z) = XY + XZ 15. X + YZ = (X + Y) (X + Z) Distributive
16. X + Y = X . Y 17. X . Y = X + Y DeMorgan’s

Chapter 2 - Part 1 8
Example 1: Boolean Algebraic Proof
 A + A·B = A (Absorption Theorem)
Proof Steps Justification (identity or
theorem)
A + A·B
= A· 1 +A· B X=X·1
= A · ( 1 + B) X · Y + X · Z = X ·(Y + Z)(Distributive Law)
=A· 1 1+X=1
=A X·1=X

 Our primary reason for doing proofs is to learn:


• Careful and efficient use of the identities and theorems of
Boolean algebra, and
• How to choose the appropriate identity or theorem to apply
to make forward progress, irrespective of the application.
Chapter 2 - Part 1 9
Example 2: Boolean Algebraic Proofs
 AB + AC + BC = AB + AC (Consensus Theorem)
Proof Steps Justification (identity or
theorem)
AB + AC + BC
= AB + AC + 1 · BC ?
= AB +AC + (A + A) · BC ?
=

Chapter 2 - Part 1 10
Proof of DeMorgan’s Laws

x+ y = x ×y x ×y = x+ y

Chapter 2 - Part 1 11

You might also like