1 How gates work NOT ( ) NAND ( ) o - - PDF document

1
SMART_READER_LITE
LIVE PREVIEW

1 How gates work NOT ( ) NAND ( ) o - - PDF document

The digital logic level Bits and Gates ... The digital logic level Level 2 Conventional Machine Level Level 1 Micro Programming Level Computer Science Ground Floor Digitial Logic Level CS240 Computer Organization Department of Computer


slide-1
SLIDE 1

1

CS240 Computer Organization

Department of Computer Science Wellesley College

Bits and Gates

The digital logic level

Digital logic 12-2

The digital logic level

Conventional Machine Level Micro Programming Level Digitial Logic Level Electronic Circuits Technology of Implementation Computer Science

...

Electrical Engineering Solid State Physics Subbasement Basement Ground Floor Level 1 Level 2

Digital logic 12-3

Digital circuits

  • A digital circuit is a circuit in which only two logical values

are present.

*Exact voltage levels and their interpretation varies with technology. Low (logic 0; false; unasserted) High (logic 1; true; asserted) Undefined 5 v 2 v 1 v

Digital logic 12-4

Gates

  • Tiny electronic devices called gates compute various

functions on these two-valued signals.

slide-2
SLIDE 2

2

Digital logic 12-5

How gates work

  • Transistors can be made to behave like very fast binary

switches.

Base Collector +Vcc (Supply Voltage) Emitter (Circuit Ground)

Digital logic 12-6

NOT ( )

Vin +Vcc Vout

NAND ( )

V1

+Vcc Vout

V2

Digital logic 12-7

Integrated Circuits

  • Gates are manufactured in units called integrated circuits.

Digital logic 12-8

Wafer, chip, gate

slide-3
SLIDE 3

3

Digital logic 12-9

Wafer, chip, gate

(a) Expose photoresist (b) Wash away unhardened photoresist (c) Etch away uncovered copper (d) Wash away photoresist Mask Light

Digital logic 12-10

The finished product

Digital logic 12-11

Five basic gates

NOT NAND NOR AND OR

*Gates with more then two inputs are possible. Who am I ?

Digital logic 20-12

Design new gates from old

XOR

  • The exclusive or is often

used as a one-bit comparator.

slide-4
SLIDE 4

4

Digital logic 12-13

Boolean Algebra

A B A B 1 A B A + B A A A A

*We think of inputs to wires as variables and gates as simple functions.

Digital logic 12-14

Boolean expressions & circuit equivalence

A B = A B A + B A A A A + B 0 + A = A A A = A

Digital logic 12-15

Name that rule

A B = = A + B B A B + A A B C (AB)C AB A B C A(BC) BC

Digital logic 12-16

Name that rule

A A A 0 A = A A A + A =

slide-5
SLIDE 5

5

Digital logic 12-17

Double bubble, toil and trouble

A A + B B A B = A B A B = A B A + B = A + B

Digital logic 12-18

Take care

A 1 A + 1 = A A + AB B = AB

Digital logic 12-19

A universal gate*

*Are there others?

Digital logic 12-20

Circuit simplification

  • Can we find a simpler circuit that performs the same

function.*

  • Start with an equivalent Boolean expression

F(A, B, C) =

*All things being equal, smaller circuits are cheaper, faster, cooler, and easier to design.

slide-6
SLIDE 6

6

Digital logic 12-21

Voting machines

  • A majority circuit outputs

1 whenever a majority of its inputs equal 1.

  • We design a simple

majority circuit for three inputs

  • A four input AND gate

recognizes exactly one input code.

  • What would a code detector

that recognizes 1001 look like?

  • What would a code detector

the recognizes either 1001 or 1111 look like?

Digital logic 12-22

Code detectors

Digital logic 12-23

Could be worse*

*Could it be better?