• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • CommentGo Back
Download
Karnaugh maps

\u2022Last time we saw applications of Boolean logic to circuit design.
\u2013The basic Boolean operations are AND, OR and NOT.
\u2013These operations can be combined to form complex expressions,

which can also be directly translated into a hardware circuit.
\u2013Boolean algebra helps us simplify expressions and circuits.
\u2022Today we\u2019ll look at a graphical technique for simplifying an expression
into a minimal sum of products (MSP) form:
\u2013There are a minimal number of product terms in the expression.
\u2013Each term has a minimal number of literals.
\u2022Circuit-wise, this leads to am inimal two-level implementation.
Review: Standard forms of expressions
\u2022We can write expressions in many ways, but some ways are more useful
than others

\u2022A sum of products (SOP) expression contains:
\u2013Only OR (sum) operations at the \u201coutermost\u201d level
\u2013Each term that is summed must be a product of literals

\u2022The advantage is that any sum of products expression can be
implemented using a two-level circuit

\u2013literals and their complements at the \u201c0th\u201d level
\u2013AND gates at the first level
\u2013a single OR gate at the second level

\u2022This diagram uses some shorthands\u2026
\u2013NOT gates are implicit
\u2013literals are reused

f(x,y,z) = y\u2019 + x\u2019yz\u2019 + xz
Terminology: Minterms
\u2022Ami nter m is a special product of literals, in which each input variable
appears exactly once.
\u2022A function with n variables has 2n minterms (since each variable can
appear complemented or not)
\u2022A three-variable function, such as f(x,y,z), has 23 = 8 minterms:
\u2022Each minterm is true for exactly one combination of inputs:
x\u2019y\u2019z\u2019
x\u2019y\u2019z
x\u2019yz\u2019
x\u2019yz
xy\u2019z\u2019
xy\u2019z
xyz\u2019
xyz
Minterm Is true when\u2026 Shorthand
x\u2019y\u2019z\u2019
x=0, y=0, z=0
m0
x\u2019y\u2019z
x=0, y=0, z=1
m1
x\u2019yz\u2019
x=0, y=1, z=0
m2
x\u2019yz
x=0, y=1, z=1
m3
xy\u2019z\u2019
x=1, y=0, z=0
m4
xy\u2019z
x=1, y=0, z=1
m5
xyz\u2019
x=1, y=1, z=0
m6
xyz
x=1, y=1, z=1
m7
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
You must be to leave a comment.
Submit
Characters: ...