Scribd
Upload
16 views18 pages

6 Logic Gates and Boolean Algebra - 3

The document discusses logic gates and Boolean algebra. It covers logic gate types, Boolean theorems, DeMorgan's theorem, universal gates, and standard forms including sum of products (SOP) and product of sums (POS). SOP and POS expressions can be converted between each other using Boolean rules and identities. Minterms and maxterms refer to product terms in SOP and sum terms in POS respectively. Logic functions can be implemented using minterms/maxterms with AND-OR or NAND-NAND configurations. Optimization is possible using Boolean algebra or Karnaugh maps.

Uploaded by

ji ha
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
16 views18 pages

6 Logic Gates and Boolean Algebra - 3

The document discusses logic gates and Boolean algebra. It covers logic gate types, Boolean theorems, DeMorgan's theorem, universal gates, and standard forms including sum of products (SOP) and product of sums (POS). SOP and POS expressions can be converted between each other using Boolean rules and identities. Minterms and maxterms refer to product terms in SOP and sum terms in POS respectively. Logic functions can be implemented using minterms/maxterms with AND-OR or NAND-NAND configurations. Optimization is possible using Boolean algebra or Karnaugh maps.

Uploaded by

ji ha
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/ 18

Logic Gates and Boolean Algebra

• Logic Gates
– Inverter, OR, AND, Buffer, NOR, NAND, XOR, XNOR
• Boolean Theorem
– Commutative, Associative, Distributive Laws
– Basic Rules
• DeMorgan’s Theorem
• Universal Gates
– NAND and NOR
• Canonical/Standard Forms of Logic
– Sum of Product (SOP)
– Product of Sum (POS)
– Minterm and Maxterm
A.A.H Ab-Rahman August 2008
SOP and POS
• All boolean expressions can be converted to
two standard forms:
– SOP: Sum of Product
– POS: Product of Sum
• Standardization of boolean expression makes
evaluation, simplification, and implementation
of boolean expressions more systematic and
easier

A.A.H Ab-Rahman August 2008


Sum of Product (SOP)
• Boolean expressions are expressed as the sum
of product, example:
minterm

ABC CDE BC D literal

• Each variable or their complements is called


literals
• Each product term is called minterm

A.A.H Ab-Rahman August 2008


SOP (cont.)
• In SOP, a single overbar cannot extend over
more than one variable, example:

AB ABC Not SOP because BC

• Standard SOP forms must contain all of the


variables in the domain of the expression for
each product term, example:
A BC ABC ABC

A.A.H Ab-Rahman August 2008


SOP (cont.)
• In the following SOP form,

ABC AB ABCD

– How many minterms are there? => 3


– How many literals in the second product term? => 2
– Is it in a standard SOP form? => No
– How do we convert the boolean expression to
standard SOP form?

A.A.H Ab-Rahman August 2008


SOP (cont.)
• To convert SOP to its standard form, we use
the boolean rules
–A+A=1
– A(B + C) = AB + AC
• We have
ABC AB ABCD
• The first product term is missing the variable
D, and the second product term is missing C
and D
A.A.H Ab-Rahman August 2008
SOP (cont.)

ABC AB ABCD
Apply D + D = 1 and C + C = 1
ABC ( D D) AB(C C )( D D) AB C D
Apply the distributive law

ABCD ABC D ( ABC ABC )( D D) AB C D

ABCD ABC D ABCD ABCD ABC D


ABC D ABCD Standard SOP form

A.A.H Ab-Rahman August 2008


Product of Sum (POS)
• Boolean expressions are expressed as the
product of sum, example:

( A B )( A B C ) literal

maxterm

A.A.H Ab-Rahman August 2008


POS (cont.)
• In POS, a single overbar cannot extend over
more than one variable, example:

( A B )( A B C ) Not SOP because B+C

• Standard POS forms must contain all of the


variables in the domain of the expression for
each sum term, example:
( A B C )( A B C )( A B C )

A.A.H Ab-Rahman August 2008


POS (cont.)
• In the following POS form,

( A B C )( B C D)( A B C D)

– Is it in a standard POS form? => No


– How do we convert the boolean expression to
standard POS form?

A.A.H Ab-Rahman August 2008


POS (cont.)
• To convert POS to its standard form, we use
the boolean rules
–A.A=0
– A + BC = (A + B)(A + C)
• We have
( A B C )( B C D)( A B C D)
• The first sum term is missing the variable D,
and the second sum term is missing A

A.A.H Ab-Rahman August 2008


POS (cont.)
( A B C )( B C D)( A B C D)

Apply D.D = 0 and A.A = 0 to first and second terms

(A B C D.D)( A. A B C D)( A B C D)
Expand first and second terms
( A B C D)( A B C D)( A B C D)( A B C D)
( A B C D)
Standard POS form

A.A.H Ab-Rahman August 2008


Minterm and Maxterm
• Minterm: Product terms in SOP
• Maxterm: Sum terms in POS
• Standard forms of SOP and POS can be derived from
truth tables
A B C Z For SOP form,
0 0 0 0 A B C Z ABC ABC ABC ABC
0 0 1 1 A BC m(1,5,6,7)
0 1 0 0 A B C
0 1 1 0 A B C For POS form,
1 0 0 0 A B C Z ( A B C )( A B C )
1 0 1 1 A BC ( A B C )( A B C )
1 1 0 1 AB C M (0,2,3,4)
1 1 1 1 ABC
A.A.H Ab-Rahman August 2008
Minterm and Maxterm
• How to design minterms – AND-OR logic
Z ABC ABC ABC ABC
A Also known as
B
C 2 level logic

A
B
C
Z
A
B
C

A
B
C

A.A.H Ab-Rahman August 2008


Minterm and Maxterm
• How to design minterms – NAND-NAND Logic
Z ABC ABC ABC ABC
A P
B
C

A
Q
B
C
Z
A R
B
C

A S
Z P Q R S
B
C Using DeMorgan’s Theorem

A.A.H Ab-Rahman August 2008


Z P Q R S
Minterm and Maxterm
• How to design maxterms – OR-AND Logic
Z ( A B C )( A B C )( A B C )( A B C )
A
B
C

A
B
C
Z
A
B
C

A
B
C

A.A.H Ab-Rahman August 2008


Minterm and Maxterm
• How to design maxterms – NOR-NOR Logic
Z ( A B C )( A B C )( A B C )( A B C )
A P
B
C

A
Q
B
C
Z
A R
B
C

A S
Z P Q R S
B
C Using DeMorgan’s Theorem

A.A.H Ab-Rahman August 2008


Z P Q R S
Minterm and Maxterm
• Can the minterm and maxterm logic be
optimized?
– Yes, using Boolean algebra – explore yourself
– Yes, using Karnaugh maps – next lecture

A.A.H Ab-Rahman August 2008

You might also like