Boolean Algebra II

Boolean Algebra II - Boolean Algebra II Password Copyright...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Boolean Algebra II Password_________________ © Copyright 2009 Daniel Tylavsky
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Last time we described the 7 laws of Boolean Algebra; 5 of which can help in minimizing functions. We also proved 2 add’l laws that were useful; X+1=1, X+X=X Notice the similarity between the two entries under each Axiom. Commutative a + b = b + a ab = ba Associative ( a + b ) + c = a + ( b + c ) ( ab ) c = a ( bc ) Distributive a + ( bc ) = ( a + b )( a + c ) a ( b + c ) = ( ab ) + ( ac ) Identity a + 0 = a a* 1 = a Complement a + a = 1 a * a = 0 Or with 1 And with 0 a + 1 = 1 a *0= 0 Idempotent a + a = a a * a = a Boolean Algebra II
Background image of page 2
Duality Theorem: The Dual of every theorem is a valid theorem. The dual is constructed by interchanging: 1 0 + * Or With 1: X+1=1 Dual of Or With 1:X*0=0 (And With 0) Idempotent: X+X=X Dual of Idempotent:X*X=X One last useful Theorem: DeMorgan’s Law Boolean Algebra II
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
DeMorgan’s Law b a b a + = Dual of DeMorgan’s Law b a b a = + a b a b a b a b Gate Equivalency Boolean Algebra II
Background image of page 4
a b a b a b a b Gate Equivalency Q:Why is this useful? A:It allows us to build functions using only one gate type. Q:Why do we use NAND/NOR gates to build functions rather than AND/OR logic? A:NAND/NOR gates are physically smaller and faster. Q:How does Gate Equivalency help when drawing schematics with one gate type? A:Let’s look at three approaches. Boolean Algebra II
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
One approach is to construct AND/OR logic and replace each gate with it’s equivalent using the figures shown below. X+Y X·Y X Y X Y X•Y X·Y X+Y X Y X Y X+Y X Y X Y X Y X Y Function Gate NAND/Inverter Equivalent X•Y X+Y X•Y X+Y X+Y X•Y X+Y = X•Y X•Y = X•Y X+Y = X•Y X•Y = X•Y Boolean Algebra II
Background image of page 6
The drawback to such an approach is that you may use more than the minimal number of gates.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/21/2010 for the course CSE 120 taught by Professor Matar during the Spring '08 term at ASU.

Page1 / 29

Boolean Algebra II - Boolean Algebra II Password Copyright...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online