Unit IV

Digital Systems

Basic Logic Circuit Concepts

Basic Definitions

 Binary Operators
● AND
z=x•y=xy z=1 if x=1 AND y=1
● OR
z=x+y z=1 if x=1 OR y=1
● NOT
z = x = x’ z=1 if x=0

 Boolean Algebra
● Binary Variables: only ‘0’ and ‘1’ values
● Algebraic Manipulation
Boolean Algebra Postulates

 Commutative Law
x•y=y•x x+y=y+x
 Identity Element
x•1=x x+0=x
 Complement
x • x’ = 0 x + x’ = 1
Boolean Algebra Theorems

 Duality
● The dual of a Boolean algebraic expression is obtained
by interchanging the AND and the OR operators and
replacing the 1’s by 0’s and the 0’s by 1’s.
● x•(y+z)=(x•y)+(x•z) Applied to a valid
equation produces
● x+(y•z)=(x+y)•(x+z) a valid equation

 Theorem 1
● x•x=x x+x=x

 Theorem 2
● x•0=0 x+1=1
Boolean Algebra Theorems

 Theorem 3: Involution
● ( x’ )’ = x (x)=x
 Theorem 4: Associative & Distributive
● (x•y)•z=x•(y•z) (x+y)+z=x+(y+z)
● x•(y+z)=(x•y)+(x•z)
x+(y•z)=(x+y)•(x+z)
 Theorem 5: DeMorgan
● ( x • y )’ = x’ + y’ ( x + y )’ = x’ • y’
● (x•y) =x +y (x+y) = x•y
 Theorem 6: Absorption
● x•(x+y)=x x+(x•y)=x
Operator Precedence

 Parentheses
x [ y  z ( w  x )]
( . . . ) • ( . . .)

 NOT (w  x)
x’ + y (w  x)
 AND z (w  x)
x+x•y
y  z (w  x)
 OR
x [ y  z (w  x )]
DeMorgan’s Theorem

a [b  c ( d  e )]

a  [b  c ( d  e )]

a  b (c ( d  e ))

a  b ( c  ( d  e ))

a  b ( c  ( d e ))
a  b (c  d e )
Boolean Functions

 Boolean Expression x y z F
Example: F = x + y’ z 0 0 0 0
 Truth Table 0 0 1 1
0 1 0 0
All possible combinations
of input variables 0 1 1 0
1 0 0 1
 Logic Circuit
1 0 1 1
1 1 0 1
1 1 1 1
 Algebraic Manipulation

 Literal:
A single variable within a term that may be complemented
or not.

 Use Boolean Algebra to simplify Boolean functions

to produce simpler circuits
Example: Simplify to a minimum number of literals
F = x + x’ y ( 3 Literals)
= x + ( x’ y )
Distributive law (+ over •)
= ( x + x’ ) ( x + y )
=(1)(x+y)=x+y ( 2 Literals)
 Complement of a Function

 DeMorgan’s Theorm
F  A BC
F  A BC
F  A B C
 Duality & Literal Complement

F  A BC
F  A B C
F  A B C
 Canonical Forms

 Minterm
A B C Minterm
● Product (AND function)
0 0 0 0 m0 ABC
● Contains all variables
1 0 0 1 m1 ABC
● Evaluates to ‘1’ for a
specific combination 2 0 1 0 m2 ABC
3 0 1 1 m3 ABC
Example
4 1 0 0 m4 ABC
A=0 A B C
5 1 0 1 m5 ABC
B=0 (0) • (0) • (0)
6 1 1 0 m6 ABC
C=0
1 • 1 • 1=1 7 1 1 1 m7 ABC
 Canonical Forms

 Maxterm
A B C Maxterm
● Sum (OR function)
0 0 0 0 M0 A  B  C
● Contains all variables
1 0 0 1 M1 A  B  C
● Evaluates to ‘0’ for a
specific combination 2 0 1 0 M2 A  B  C
3 0 1 1 M3 A  B  C
Example
4 1 0 0 M4 A  B  C
A=1 A B C
5 1 0 1 M5 A  B  C
B=1 (1) + (1) + (1)
6 1 1 0 M6 A  B  C
C=1
0 + 0 + 0=0 7 1 1 1 M7 A  B  C
 Canonical Forms

 Truth Table to Boolean Function

A B C F F  A BC  A BC  A BC  ABC
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
 Canonical Forms

 Sum of Minterms A B C F F
F  A BC  A BC  A BC  ABC 0 0 0 0 0 1
1 0 0 1 1 0
F  m1  m 4  m5  m 7
2 0 1 0 0 1
F   (1 , 4 , 5 , 7 )
3 0 1 1 0 1
 Product of Maxterms 4 1 0 0 1 0
F  A BC  ABC  ABC  AB C 5 1 0 1 1 0
F  A BC  ABC  ABC  AB C 6 1 1 0 0 1
7 1 1 1 1 0
F  A B C  AB C  ABC  AB C
F  ( A  B  C )( A  B  C )( A  B  C )( A  B  C )
F  M 0 M 2 M 3 M 6
F   (0,2,3,6)
 Standard Forms

 Sum of Products (SOP)

A B (C  C )
 A B (1)
F  A BC  A BC  A BC  ABC
 AB
AC ( B  B )
 AC
BC ( A  A)
 BC
F  BC ( A  A)  A B (C  C )  AC ( B  B )

F  BC  A B  AC
 Standard Forms

 Product of Sums (POS)

AB (C  C )

F  A BC  ABC  ABC  AB C

BC ( A  A)

AC ( B  B )
F  AC ( B  B )  AB (C  C )  B C ( A  A)

F  AC  AB  BC
F  ( A  C )( A  B )( B  C )
 Two-Level Implementations

 Sum of Products (SOP) B’

C

F  BC  A B  AC A
B’ F
A
C
 Product of Sums (POS)

F  ( A  C )( A  B )( B  C )
 Logic Operators

 AND x y AND
0 0 0
0 1 0
1 0 0
1 1 1

 NAND (Not AND) x y NAND

0 0 1
0 1 1
1 0 1
1 1 0
 Logic Operators

 OR x y OR
0 0 0
0 1 1
1 0 1
1 1 1

 NOR (Not OR) x y NOR

0 0 1
0 1 0
1 0 0
1 1 0
 Logic Operators

 XOR (Exclusive-OR) x y XOR

0 0 0
0 1 1
1 0 1
1 1 0

 XNOR (Exclusive-NOR) x y XNOR

(Equivalence) 0 0 1
0 1 0
1 0 0
1 1 1
 Logic Operators

 NOT (Inverter) x NOT

0 1

1 0

 Buffer x Buffer

0 0

1 1
Multiple Input Gates



 DeMorgan’s Theorem on Gates

 AND Gate
● F=x•y F = (x • y) F=x+y

 OR Gate
● F=x+y F = (x + y) F=x•y

 Change the “Shape” and “bubble” all lines