Scribd
Upload
47 views44 pages

04 - Logic Gates and Boolean Algebra

- There are three basic logic gates: AND, OR, and NOT. Boolean algebra uses operators AND (.), OR (+), and NOT (') to represent the logic gates. - Boolean functions can be expressed in canonical forms as sums of minterms or products of maxterms. Minterms represent all possible combinations of the input variables that produce a 1 in the boolean function. Maxterms are the complements of minterms. - Boolean algebra postulates and theorems like absorption, associativity, complement, and DeMorgan's can be used to simplify boolean expressions and prove identities. Boolean functions can be represented by truth tables or logic gate diagrams.

Uploaded by

Girish
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
47 views44 pages

04 - Logic Gates and Boolean Algebra

- There are three basic logic gates: AND, OR, and NOT. Boolean algebra uses operators AND (.), OR (+), and NOT (') to represent the logic gates. - Boolean functions can be expressed in canonical forms as sums of minterms or products of maxterms. Minterms represent all possible combinations of the input variables that produce a 1 in the boolean function. Maxterms are the complements of minterms. - Boolean algebra postulates and theorems like absorption, associativity, complement, and DeMorgan's can be used to simplify boolean expressions and prove identities. Boolean functions can be represented by truth tables or logic gate diagrams.

Uploaded by

Girish
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/ 44

LOGIC GATES

BOOLEAN ALGEBRA
THREE BASIC TYPES OF LOGIC GATE
• AND GATE
• OR GATE
• NOT GATE
THE AND GATE
THE AND GATE
THE OR GATE
THE OR GATE
THE NOT GATE

THE LOGICAL INVERTER


THE NOT GATE
THINKING IN BINARY
+ -
HIG
LOW
H
YES NO
TRU FALS
E E
1 0
• THE AND GATE
• THE OR GATE
• THE NOT GATE (OR INVERTER)
• A LOGIC BUFFER GATE
• A LOGIC BUFFER GATE
• THE NAND GATE
• THE NOR GATE
• THE EXCLUSIVE OR GATE
• THE EXCLUSIVE NOR GATE
BINARY TO GRAY CODE
DECIMAL VALUE Binary Gray Code DECIMAL VALUE Binary Gray Code
B3B2B1B0 G 3G 2 G 1 G 0 B3B2B1B0 G3G2G1G0
G3= B3

0 0000 0000 8 1000 1100 G2= B3 ⊕  B2


G1= B2 ⊕  B1
1 0001 0001 9 1001 1101 G0= B1 ⊕  B0

2 0010 0011 10 1010 1111


3 0011 0010 11 1011 1110
4 0100 0110 12 1100 1010
5 0101 0111 13 1101 1011
6 0110 0101 14 1110 1001
7 0111 0100 15 1111 1000
BOOLEAN ALGEBRA
• In 1854, George Boole developed an algebraic system now called Boolean algebra.
• Postulates formulated by e. V. Huntington in 1904.
• Boolean algebra is an algebraic structure defined by a set of elements, together with two binary
operators, + (OR) and . (AND) , provided that the following (Huntington) postulates are satisfied:
POSTULATES AND THEOREMS OF BOOLEAN
ALGEBRA
DUALITY

• DUALITY PRINCIPLE
• States that every algebraic expression deducible from the
postulates of Boolean algebra remains valid if the operators and
identity elements are interchanged
• Example
• X+0=X dual X . 1 = X
PROOFS

• THEOREM 1(A): X + X = X.
STATEMENT JUSTIFICATION
X + X = (X + X) . 1 POSTULATE 2(B)
= (X + X)(X + X’) 5(A)
= X + XX’ 4(B)
=X+0 5(B)
=X 2(A)
• THEOREM 1(B): X + X = X.
STATEMENT JUSTIFICATION
X . X = X.X + 0 POSTULATE 2(A)
= X .X + X .X’ 5(B)
= X . (X + X’) 4(A)
= X .1 5(A)
=X 2(B)
• THEOREM 2(A): X + 1 = 1.
STATEMENT JUSTIFICATION
X + 1 = 1 . (X + 1) POSTULATE 2(B)
= (X + X’) . (X + 1) 5(A)
= X + X’ . 1 4(B)
= X + X’ 2(B)
=1 5(A)
ABSORPTION THEOREM
1. X + X•Y = X
2. X•(X+Y) = X (DUAL)
• PROOF:
X + X•Y = X•1 + X•Y
= X•(1+Y)
= X•1
=X
• ASSOCIATIVE , DEMORGAN'S THEOREM CAN BE
PROVED USING TRUTH TABLE
• (X+Y)’ =X’ . Y’
BOOLEAN FUNCT IONS
• F1 = X + Y’Z
SIMPLIFICATION OF BOOLEAN EXPRESSION
HOME ASSIGNMENT
COMPLEMENT OF A FUNCTION

• USE DEMORGAN’S THEOREM (A+B)’=A’.B’ OR (A.B)’ = A’+B’


EXAMPLE TO COMPLEMENT
HOME ASSIGNMENT
• FIND THE COMPLEMENT OF F = WX + YZ; THEN SHOW THAT F . F’ = 0 AND F + F’ = 1.
• WRITE THE TRUTH TABLE OF THE FUNCTIONS. ALSO DRAW THE CIRCUIT
DIAGRAM USING LOGIC GATES
(a) F = XY + XY’+ Y’Z
(b) F = BC + A’C’

• FOR THE BOOLEAN FUNCTION F = XY’Z + X’Y’Z + W’XY + WX’Y + WXY


(A) obtain the truth table of F.
(B) draw the logic diagram, using the original Boolean expression.
(C) use Boolean algebra to simplify the function to a minimum number of literals.
(D) obtain the truth table of the function from the simplified expression and show that it is the same
as the one in part (a).
(E) draw the logic diagram from the simplified expression, and compare the total number of gates
with the diagram of part (b).
CANONICAL AND S TANDARD FORMS
• A binary variable may appear either in
• Its normal form (x) or
• In its complement form (x’)
• MINTERM
• Consider two binary variables X and Y combined with an AND
operation
• Each Variable may appear in either form, there are four possible
combinations
• X’.Y’ X’.Y X.Y’ XY  EACH OF THESE 4 AND TERMS 
minterm / Standard Product
• n variables  2n minterms
• 3 variables  23 minterms
• Each variable
• Primed (x’) if bit is 0
• Unprimed (x) if bit is 1
• m , where the subscript j 
j

the decimal equivalent of the


binary number of the minterm designated.
• Max term
• N variables forming an or term provide 2n possible combinations with each
variable being unprimed (X) if the corresponding bit is a 0 and primed (X’) if a 1,
called maxterms, or standard sums
• Each maxterm is the complement of its corresponding
minterm and vice versa.
• Ex:2 minterm (x,y,z) : x’yz’
maxterm : x+y’+z
• A boolean function can be expressed algebraically from a
given truth table by forming A minterm for each
combination of the variables that produces a 1 in the
function And then taking the OR of all those terms.
• complement of the above definition :?
BOOLEAN FUNCTION: SUM OF MINTERMS/ PRODUCT
OF MAXTERMS
SUM OF MINTERMS
f1= x’y’z+xy’z’+xyz
f1=m1+m4+m7

PRODUCT OF MAXTERS
f1=(x+y+z) . (x+y’+z). (x+y’+z’)
(x’+y+z’) (x’+y’+z)
= M0 . M2. M3. M5. M6
• BOOLEAN FUNCTIONS EXPRESSED AS A SUM OF MINTERMS OR PRODUCT OF
MAXTERMS ARE SAID TO BE IN CANONICAL FORM
• An alternative procedure for deriving the minterms of a boolean function is to obtain The truth
table of the function directly from the algebraic expression and then read the Minterms from the
truth table.
PRODUCT OF MAXTERMS

You might also like