ECE 171 Digital Circuits: Prof. Mark G. Faust Maseeh College of Engineering and Computer Science
Uploaded by
Minh HoangECE 171 Digital Circuits: Prof. Mark G. Faust Maseeh College of Engineering and Computer Science
Uploaded by
Minh HoangECE171 DigitalCircuits
Prof.MarkG.Faust MaseehCollegeofEngineering andComputerScience
Lecture4
Topics
BooleanAlgebra g HuntingtonsPostulates TruthTables GraphicSymbols BooleanAlgebraTheorems
BooleanAlgebra(History)
384322BC:Aristotle,foundationsoflogic 1854:George g Boole, ,AnInvestigation g ofthe LawsofThought(mathematicalmethods fortwovaluedlogic) 1904:H.E.Huntington,SetsofIndependent PostulatesfortheAlgebraofLogic 1938:ClaudeShannon,ASymbolicAnalysis ofRelaySwitchingCircuits
3
BooleanAlgebra
Postulates(Axioms)
Acceptedastrue;Foundationforfurtherproofs
Values
B={0,1}
Variables
A,B,CX,Y,ZReady,Green,OverWeightLimit
Operators
+
AdditionalOperators
()=
4
HuntingtonsPostulates(I)
BooleanAlgebra
Literals
VariableorComplementofVariable
X,X,Green,Green
Expressions
Constants(0,1),Literals,Operators
(X+YZ),A+B
Precedence
Complement(),AND(),OR(+) ()Canbeusedtomodifyorder
6
Operators
Complement(NOT)
A A/A!AA~A AA
OR
A+BA|BA B
AND
A*BA&BA BA B
TruthTables
(NOT)
GraphicSymbols
(NOT)
AdditionalOperators
NOR
A+BA|BA B
NAND
A*BA&BA BA B
10
TruthTables
X 0 0 1 1 Y 0 1 0 1 X+Y 1 0 0 0 X 0 0 1 1 Y 0 1 0 1 XY 1 1 1 0
NOR operator
NAND operator
11
GraphicSymbols
12
AdditionalOperators
XOR(ExclusiveOR, OR Modulo2)
A B
XNOR(ExclusiveNOR NOR,Equivalence)
A B
13
TruthTables
X 0 0 1 1 Y 0 1 0 1 XY 0 1 1 0 X 0 0 1 1 Y 0 1 0 1 XY 1 0 0 1
XOR operator
XNOR operator
14
GraphicSymbols
15
BooleanFunctions
ProductTerms
Comprisedofliterals(includingcomplements),AND XYZABC
SumTerms
Comprisedofliterals(includingcomplements) complements),OR X+Y+ZA+B+C
SumofProducts(SOP) ( )
XY+XZ note:parenthesesnotneeded
ProductofSums(POS)
(X+Y) (X+Z)
F(X,Y,Z)=Booleanfunctionof3variables:X,Y,Z
16
TruthTables
Question:Howmanyrowsarethereinatruthtable forn variables? 2n B5 B4 B3 B2 B1 B0 F
Asmanyrowsasuniquecombinations 0 0000000 1 0000011 ofinputs
2 0000101
Enumeratebycountinginbinary
26 =64
3 . . . 63
0000110 . . . 1111111
17
BooleanAlgebra Manipulation
Simplify
LiteralCountReduction ReduceNumberofTerms
Transform:PutinPreferredForm
AND/OR NAND/NOR
18
ReducingNumberofTerms
F = (X + Y) (X + Z) = X + YZ
HuntingtonsPostulateP4a
19
BooleanTheorems
20
BooleanTheorems
21
BooleanTheorems
22
LiteralCountReduction
F = XY + X + YZ = Y + X + YZ =Y+X
SimplificationTheorem SimplificationTheorem AbsorptionTheorem
XY + X = Y + X
AbsorptionTheorem
Y + YZ = Y
23
Transformation
F=XYZ =X+Y+Z
deMorgansTheorem
FromimplementationwithNANDgatetoNORandInverters
24
Proofs
UsingBooleanAlgebra Prove:X+X=X X+X=(X+X) 1 =(X+X) (X+X) =X+XX =X+0 = X
HuntingtonP2b:X 1=X HuntingtonP5a:X+X=1 HuntingtonP4a:X+YZ=(X+Y) (X+Z) HuntingtonP5b:X X=0 H i Huntington P2a: P2 X+0=X
Q.E.D.
UsingPrincipleofPerfectInduction
TruthTables!
25
PrincipleofPerfectInduction
Prove:XY+XZ+YZ=XY+XZ
X 0 0 0 0 1 1 1 1 Y 0 0 1 1 0 0 1 1 Z XY 0 0 1 0 0 0 1 0 0 0 1 0 0 1 1 1 XZ + 0 + 1 + 0 + 1 + 0 + 0 + 0 + 0 YZ + 0 + 0 + 0 + 1 + 0 + 0 + 0 + 1 = = = = = = = = 0 1 0 1 0 0 1 1 XY XZ 0 + 0 =0 0 + 1 =1 0 + 0 =0 0 + 1 =1 0 + 0 =0 0 + 0 =0 1 + 0 =1 1 + 0 =1
26
