floyd digital fundamentals, 9/e copyright ©2006 by pearson education, inc. upper saddle river, new...

Post on 30-Mar-2015

226 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

TRANSCRIPT

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 1

Digital FundamentalsDigital Fundamentals

CHAPTER 4 CHAPTER 4

Boolean Algebra and Logic SimplificationBoolean Algebra and Logic Simplification

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 2

Boolean Operations and Expressions Boolean Operations and Expressions

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 3

Boolean Operations and ExpressionsBoolean Operations and Expressions

• AdditionAddition0 + 0 = 00 + 0 = 0

0 + 1 = 10 + 1 = 1

1 + 0 = 11 + 0 = 1

1 + 1 = 11 + 1 = 1

• MultiplicationMultiplication0 * 0 = 00 * 0 = 0

0 * 1 = 00 * 1 = 0

1 * 0 = 01 * 0 = 0

1 * 1 = 11 * 1 = 1

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 4

Laws and Rules of Boolean Algebra Laws and Rules of Boolean Algebra

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 5

Laws Boolean Algebra Laws Boolean Algebra

• Commutative LawsCommutative Laws

• Associative LawsAssociative Laws

• Distributive LawDistributive Law

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 6

Laws of Boolean AlgebraLaws of Boolean Algebra

• Commutative Law of Addition:Commutative Law of Addition:A + B = B + AA + B = B + A

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 7

Laws of Boolean AlgebraLaws of Boolean Algebra

• Commutative Law of Multiplication:Commutative Law of Multiplication:A * B = B * AA * B = B * A

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 8

Laws of Boolean AlgebraLaws of Boolean Algebra

• Associative Law of Addition:Associative Law of Addition:A + (B + C) = (A + B) + CA + (B + C) = (A + B) + C

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 9

Laws of Boolean AlgebraLaws of Boolean Algebra

• Associative Law of Multiplication:Associative Law of Multiplication:A * (B * C) = (A * B) * CA * (B * C) = (A * B) * C

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 10

Laws of Boolean AlgebraLaws of Boolean Algebra

• Distributive Law:Distributive Law:

A(B + C) = AB + ACA(B + C) = AB + AC

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 11

Rules of Boolean AlgebraRules of Boolean Algebra

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 12

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 1Rule 1

OR Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 13

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 2Rule 2

OR Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 14

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 3Rule 3

AND Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 15

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 4Rule 4

AND Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 16

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 5Rule 5

OR Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 17

Rules of Boolean Algebra Rules of Boolean Algebra

• Rule 6Rule 6

OR Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 18

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 7Rule 7

AND Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 19

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 8Rule 8

AND Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 20

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 9Rule 9

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 21

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 10: A + AB = ARule 10: A + AB = A

AND Truth Table OR Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 22

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 11:Rule 11: BABAA

AND Truth Table OR Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 23

Rules of Boolean AlgebraRules of Boolean Algebra

• Rule 12: (A + B)(A + C) = A + BCRule 12: (A + B)(A + C) = A + BC

AND Truth Table OR Truth Table

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 24

DeMorgan’s Theorem DeMorgan’s Theorem

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 25

DeMorgan’s TheoremsDeMorgan’s Theorems

• Theorem 1Theorem 1

• Theorem 2Theorem 2

YXXY

YXYX Remember: Remember:

““Break the bar, Break the bar, change the sign”change the sign”

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 26

Standard Forms of Boolean ExpressionsStandard Forms of Boolean Expressions

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 27

Standard Forms of Boolean ExpressionsStandard Forms of Boolean Expressions

• The sum-of-product (SOP) formThe sum-of-product (SOP) formExample: X = AB + CD + EFExample: X = AB + CD + EF

• The product of sum (POS) formThe product of sum (POS) formExample: X = (A + B)(C + D)(E + F)Example: X = (A + B)(C + D)(E + F)

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 28

The Karnaugh Map The Karnaugh Map

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 29

The Karnaugh MapThe Karnaugh Map

3-Variable Karnaugh Map3-Variable Example

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 30

The Karnaugh MapThe Karnaugh Map

4-Variable Karnaugh Map

4-Variable Example

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 31

The Karnaugh MapThe Karnaugh Map

5-Variable Karnaugh Mapping

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 32

VHDLVHDL

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 33

VHDLVHDL

• VHDL OperatorsVHDL Operators

andand

oror

notnot

nandnand

nornor

xorxor

xnorxnor

• VHDL ElementsVHDL Elements

entityentity

architecturearchitecture

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 34

VHDLVHDL

• Entity StructureEntity Structure

Example:Example:

entityentity AND_Gate1 AND_Gate1 isis

port(port(A,BA,B:in bit::in bit:XX:out bit);:out bit);

end entity end entity AND_Gate1AND_Gate1

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 35

VHDLVHDL

• ArchitectureArchitecture

Example:Example:

architecturearchitecture LogicFunction of AND_Gate1 LogicFunction of AND_Gate1 isis

beginbegin

XX<=<=A A andand B B;;

end architecture end architecture LogicFunctionLogicFunction

FloydFloydDigital Fundamentals, 9/eDigital Fundamentals, 9/e

Copyright ©2006 by Pearson Education, Inc.Copyright ©2006 by Pearson Education, Inc.Upper Saddle River, New Jersey 07458Upper Saddle River, New Jersey 07458

All rights reserved.All rights reserved.

Slide 36

Hardware Description Languages (HDL)Hardware Description Languages (HDL)

• Boolean Expressions in VHDLBoolean Expressions in VHDLANDAND X X <=<= A A andand B B;;

OROR X X <=<= A A oror B B;;

NOTNOT X X <=<= A A notnot B B;;

NANDNAND X X <=<= A A nandnand B B;;

NORNOR X X <=<= A A nornor B B;;

XORXOR X X <=<= A A xorxor B B;;

XNORXNOR X X <=<= A A xnorxnor B B;;

top related