+ All Categories
Home > Documents > Simple Logic

Simple Logic

Date post: 08-Jan-2016
Category:
Upload: ramla
View: 12 times
Download: 0 times
Share this document with a friend
Description:
Simple Logic. Next Presentation: Full Adder and Five Bit Adder. - PowerPoint PPT Presentation
14
Simple Logic
Transcript
Page 1: Simple Logic

Simple Logic

Page 2: Simple Logic

AND Truth Table

0 0

0 1

0 1

0

1

AND

0 AND 0 is 0 (a false statement AND a false statement is a false combination) 0 AND 1 is 0 (a false statement AND a true statement is a false combination) 1 AND 0 is 0 (a true statement AND a false statement is a false combination) 1 AND 1 is 1 (a true statement AND a true statement is a true combination)

Page 3: Simple Logic

OR Truth Table

0 1

1 1

0 1

0

1

OR

0 OR 0 is 0 (a false statement OR a false statement is a false combination) 0 OR 1 is 1 (a false statement OR a true statement is a true combination) 1 OR 0 is 1 (a true statement OR a false statement is a true combination) 1 OR 1 is 1 (a true statement OR a true statement is a true combination)

Inclusive OR

Page 4: Simple Logic

XOR Truth Table

0 1

1 0

0 1

0

1

XOR

0 XOR 0 is 0 (a false statement XOR a false statement is a false combination.XOR and OR are the same for these inputs.)

0 XOR 1 is 1 (a false statement XOR a true statement is a true combination.XOR and OR are the same for these inputs.)

1 XOR 0 is 1 (a true statement XOR a false statement is a true combination.XOR and OR are the same for these inputs.)

1 XOR 1 is 0 (a true statement XOR a true statement is a false combination, because XOR excludes both statements being true)

Exclusive OR

Page 5: Simple Logic

NOT Truth Table

1

0

0

1

NOT

NOT 0 is 1 (the negative of a false statement is a true statement) NOT 1 is 0 (the negative of a true statement is a false statement)

Page 6: Simple Logic

NAND Truth Table

1 1

1 0

0 1

0

1

NAND

0 NAND 0 is 1 (false AND false is false, which is negated to true) 0 NAND 1 is 1 (false AND true is false, which is negated to true) 1 NAND 0 is 1 (true AND false is false, which is negated to true)

1 NAND 1 is 0 (true AND true is true, which is negated to false)

Page 7: Simple Logic

NOR Truth Table

1 0

0 0

0 1

0

1

NOR

0 NOR 0 is 1 (false OR false is false, which is negated to true) 0 NOR 1 is 0 (false OR true is true, which is negated to false) 1 NOR 0 is 0 (true OR false is true, which is negated to false) 1 NOR 1 is 0 (true OR true is true, which is negated to false)

Page 8: Simple Logic

Logic Gate Implementation

AND Gate

OR Gate

NOT Gate

open AND open is open 0 AND 0 = 0

open AND closed is open 0 AND 1 = 0

closed AND open is open 1 AND 0 = 0

closed AND closed is closed 1 AND 1 = 1

open OR open is open 0 OR 0 = 0

open OR closed is closed 0 OR 1 = 1

closed OR open is closed 1 OR 0 = 1

closed OR closed is closed 1 OR 1 = 1

NOT closed is open NOT 1 = 0

NOT open is closed NOT 0 = 1

Page 9: Simple Logic

Logic Gate Implementation

AND Gate

Hand Down AND Hand Down is Hand Down 0 AND 0 = 0

ISAND

Hand Down AND Hand Up is Hand Down 0 AND 1 = 0

ISAND

Hand Up AND Hand Down is Hand Down 1 AND 0 = 0

ISAND

Hand Up AND Hand Up is Hand Up 1 AND 1 = 1

ISAND

To make a computer, all you need is Memorial Stadium for an afternoon, a few thousand chairs, a few thousand undergraduates, one pizza for each three undergraduates, and lots and lots of soda.

Page 10: Simple Logic

Different Types of Switches

Electronic Tube

Transistor

Fluid Pressure Value

Called a “valve” in England

Mechanical Switch

Electro-mechanical Relay

Page 11: Simple Logic

Logic Gate Implementation

AND Gate

OR Gate

NOT Gate

using Transisters

Electrical Resistor (necessary)

OutputA input

+

B input

Electrical Resistor (necessary)

OutputA input

+

B input

Electrical Resistors (necessary)

OutputInput

+ +

CMOS type transistors eliminate the need for resistors, allowing millions

of transistors on a single chipOlder style individual transistors

Page 12: Simple Logic

Logic Gate Implementation

XOR Gate

NAND Gate

0

00

0 1

0

000

0

0OR

AND

AND

NOT

0 XOR 0 = 0

OR

AND NOT

AND

1

01

0 1

1

110

1

0OR

AND

AND

NOT

0 XOR 1 = 1

1

10

0 1

1

101

0

1OR

AND

AND

NOT

1 XOR 0 = 1

1

11

1 0

1

011

1

1OR

AND

AND

NOT

1 XOR 1 = 0

AND NOT

010

0 AND NOT

0 NAND 0 = 1

011

0 AND NOT

0 NAND 1 = 1

010

1 AND NOT

1 NAND 0 = 1

101

1 AND NOT

1 NAND 1 = 0

NOR Gate OR NOT

010

0 OR NOT

0 NOR 0 = 1

101

0 OR NOT

0 NOR 1 = 0

100

1 OR NOT

1 NOR 0 = 0

101

1 OR NOT

1 NOR 1 = 0

Page 13: Simple Logic

NAND can implement all other logic gates

AND Gate

OR Gate

NOT Gate

XOR Gate

NOR Gate

Page 14: Simple Logic

Next Presentation: Full Adder and Five Bit Adder


Recommended