Scribd
Upload
35 views25 pages

05 - Boolean Algebra - 2

Uploaded by

philopateer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views25 pages

05 - Boolean Algebra - 2

Uploaded by

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

Boolean Algebra

and Logic Gates


(Cont.)
Outline
1. Basic Definitions
2. Axiomatic Definition of Boolean Algebra
3. Basic Theorems and Properties of Boolean
Algebra
4. Boolean Functions
5. Canonical and Standard Forms
6. Other Logical Operations
7. Digital Logic Gates
8. Integrated Circuits
Canonical and Standard Forms
◼ Minterms (Standard Product)
 Binary variables combined with AND
operation
 All possible products of any n binary
variables are called minterms or standard
product:
 Example: For 2 binary variables x and y.
Minterms are: x’y’,x’y, xy’, xy
Canonical and Standard Forms
(cont.)
◼ Maxterms (Standard Sum)
 Binary variables combined with OR operation
 All possible sums of any n binary variables

are called maxterms or standard sum:


 Example: For 2 binary variables x and y.
Maxterms: x+y, x’+y’, x’+y, x+y'
Minterms and Maxterms

Each maxterm is the complement of its


corresponding minterm: mj’ = Mj
Example
Canonical forms
◼Sum of minterms (Sum of Products SoP)
F1= x’y’z + xy’z’ + xyz
= m1 + m4 +m7
= ∑(1, 4, 7)
F2= x’yz + xy’z + xyz’ + xyz
= m3 + m5 + m6 + m7
= ∑(3, 5, 6, 7)
Canonical forms (cont.)
◼ Product of maxterms (Product of Sums
PoS)
F1= (x+y+z) (x+y’+z) (x+y’+z’) (x’+y+z’) (x’+y’+z)
= M0M2M3M5M6
= π(0, 2, 3, 5, 6)
F2= (x+y+z) (x+y+z’) (x+y’+z) (x’+y+z)
= M0M1M2M4
= π(0, 1, 2, 4)
Standard form gate implementation

F1 = y’ + xy + x’yz’ F2 = x(y’ + z)(x’+y+z’)

Sum of Products Product of Sums


Functions of 2 binary variables
Multiple input logic gate

3-input NOR gate

3-input NAND gate


3-input exclusive-OR gates (odd
Parity checker)
Positive and Negative Logic
Positive Logic Negative Logic
Logic level Signal level Logic level Signal level
0 L 0 H
1 H 1 L
Example of Negative Logic

Truth table with H and L

Positive logic
AND gate

Negative logic
OR gate
Integrated Circuits (ICs)
◼ Level of integration
1. SSI: Small-scale Integration, Gates < 10
2. MSI: Medium-scale Integration, 10<Gates < 1000
3. LSI: Large-scale Integration, Gates > 1000
4. VLSI: Very Large-scale Integration, Gates >
100000
Digital
gates ICs

You might also like