digital logic structures. copyright © the mcgraw-hill companies, inc. permission required for...

23
Digital Logic Structures

Upload: victoria-white

Post on 12-Jan-2016

214 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

Digital LogicStructures

Page 2: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-2

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

RoadmapProblems

Algorithms

Language

Machine (ISA) Architecture

Microarchitecture

Logic

Circuits

Devices

Page 3: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-3

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Transistor: Building Block of ComputersMicroprocessors contain millions of transistors

• Intel Pentium II: 7 million• Compaq Alpha 21264: 15 million• Intel Pentium III: 28 million

Logically, each transistor acts as a switch

Combined to implement logic functions • AND, OR, NOT

Combined to build higher-level structures• Adder, multiplexor, decoder, register, …

Combined to build processor• LC-2

Page 4: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-4

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Simple Switch Circuit

Switch open:• No current through circuit• Light is off

• Vout is +2.9V

Switch closed:• Short circuit across switch• Current flows• Light is on

• Vout is 0V

Switch-based circuits can easily represent two states:on/off, open/closed, voltage/no voltage.

Page 5: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-5

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

N-type MOS TransistorMOS = Metal Oxide Semiconductor

• two types: N-type and P-type

N-type• when Gate has positive voltage,

short circuit between #1 and #2(switch closed)

• when Gate has zero voltage,open circuit between #1 and #2(switch open)

Gate = 1

Gate = 0

Terminal #2 must beconnected to GND (0V).

Page 6: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-6

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

P-type MOS TransistorP-type is complementary to N-type

• when Gate has positive voltage,open circuit between #1 and #2(switch open)

• when Gate has zero voltage,short circuit between #1 and #2(switch closed)

Gate = 1

Gate = 0

Terminal #1 must beconnected to +2.9V.

Page 7: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-7

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Logic GatesUse switch behavior of MOS transistorsto implement logical functions: AND, OR, NOT.

Digital symbols:• recall that we assign a range of analog voltages to each

digital (logic) symbol

• assignment of voltage ranges depends on electrical properties of transistors being used

typical values for "1": +5V, +3.3V, +2.9Vfrom now on we'll use +2.9V

Page 8: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-8

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

CMOS CircuitComplementary MOS

Uses both N-type and P-type MOS transistors• P-type

Attached to + voltagePulls output voltage UP when input is zero

• N-typeAttached to GNDPulls output voltage DOWN when input is one

For all inputs, make sure that output is either connected to GND or to +,but not both!

Page 9: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-9

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Inverter (NOT Gate)

In Out

0 V 2.9 V

2.9 V 0 V

In Out

0 1

1 0

Truth table

Page 10: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-10

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

NOR Gate

A B C

0 0 1

0 1 0

1 0 0

1 1 0

Note: Serial structure on top, parallel on bottom.

Page 11: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-11

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

OR Gate

Add inverter to NOR.

A B C

0 0 0

0 1 1

1 0 1

1 1 1

Page 12: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-12

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

NAND Gate (AND-NOT)

A B C

0 0 1

0 1 1

1 0 1

1 1 0

Note: Parallel structure on top, serial on bottom.

Page 13: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-13

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

AND Gate

Add inverter to NAND.

A B C

0 0 0

0 1 0

1 0 0

1 1 1

Page 14: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-14

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Basic Logic Gates

Page 15: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-15

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

More than 2 Inputs?AND/OR can take any number of inputs.

• AND = 1 if all inputs are 1.• OR = 1 if any input is 1.• Similar for NAND/NOR.

Can implement with multiple two-input gates,or with single CMOS circuit.

Page 16: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-16

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

PracticeImplement a 3-input NOR gate with CMOS.

Page 17: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-17

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Decodern inputs, 2n outputs

• exactly one output is 1 for each possible input pattern

2-bitdecoder

Page 18: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-18

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Multiplexer (MUX)n-bit selector and 2n inputs, one output

• output equals one of the inputs, depending on selector

4-to-1 MUX

Page 19: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-19

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Full AdderAdd two bits and carry-in,produce one-bit sum and carry-out. A B Cin S Cout

0 0 0 0 0

0 0 1 1 0

0 1 0 1 0

0 1 1 0 1

1 0 0 1 0

1 0 1 0 1

1 1 0 0 1

1 1 1 1 1

Page 20: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-20

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Four-bit Adder

Page 21: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-21

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.On-Chip Memory: Static RAM

6-Transistor SRAM Cell

bit bit

word(row select)

bit bit

word

10

0 1

Page 22: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-22

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.RAM :Transistor Memory Cell (DRAM)

Single transistor• Density is better than SRAM• Slower

Call D-RAM (Dynamic RAM)• Refresh- do a periodic read to

every cell

row select

bit

Page 23: Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms

3-23

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.Classical DRAM Organization (square)

row

decoder

rowaddress

Column Selector & I/O Circuits Column

Address

data

RAM Cell Array

word (row) select

bit (data) lines

Row and Column Address together: • Select 1 bit a time

Each intersection representsa 1-T DRAM Cell