Fall 2006 1 EE 333 Lillevik 333f06-l1 University of Portland School of Engineering Computer...

22
Fall 2006 Lillevik 333f06- l1 1 University of Portland School of Engineering EE 333 Computer Organization Lecture 1 Introductions Course objectives PC Example Prerequisites

Transcript of Fall 2006 1 EE 333 Lillevik 333f06-l1 University of Portland School of Engineering Computer...

Fall 2006

Lillevik 333f06-l1 1University of Portland School of Engineering

EE 333

Computer OrganizationLecture 1

IntroductionsCourse objectives

PC ExamplePrerequisites

Fall 2006

Lillevik 333f06-l1 2University of Portland School of Engineering

EE 333

Introductions

• Instructorhttp://faculty.up.edu/lillevik

Quiz

• Students– Name, home town– Major, technical interests– Hobbies

Fall 2006

Lillevik 333f06-l1 3University of Portland School of Engineering

EE 333

Course Objectives

1. Explain the fundamental hardware blocks of a computer system

2. Assemble and dis-assemble machine instructions

3. Design a 16-bit RISC computer at the logic level

4. Micro-program machine instructions5. Interconnect agents across a bus

Fall 2006

Lillevik 333f06-l1 4University of Portland School of Engineering

EE 333

PC example

SocketLGA775

PCI SlotsNBr

SBr DDR2

Fall 2006

Lillevik 333f06-l1 5University of Portland School of Engineering

EE 333

What are the key PC components?

• Cpu

• Memory

• Power supply

• Graphics

• Storage/hard drive

• Mobo

• Cooling system

Fall 2006

Lillevik 333f06-l1 6University of Portland School of Engineering

EE 333

• Case

• Kbd, mouse

• CD drive

• Audio, speakers

• NIC

• Monitor

Fall 2006

Lillevik 333f06-l1 7University of Portland School of Engineering

EE 333

Pentium D 805, 4.1 GHz dual core

Top View Bottom View

Fall 2006

Lillevik 333f06-l1 8University of Portland School of Engineering

EE 333

What’s inside the micro?

• Logic gates, flip flops

• ALU, FPU

• PLA

• MUX, DMUX(decoder), encoder

• Parity generator

• Controller

Fall 2006

Lillevik 333f06-l1 9University of Portland School of Engineering

EE 333

Prerequisites

• Combinational logic– Truth tables, K-maps– SOP, POS

• Sequential logic– Flip-flops– State diagram, next state decoder

• MSI devices: MUX, decoder, adder

Fall 2006

Lillevik 333f06-l1 10University of Portland School of Engineering

EE 333

MSI devices

• MUX: selects one input from many

• Decoder: asserts one output based on input number

• Adder: two’s complement

Fall 2006

Lillevik 333f06-l1 11University of Portland School of Engineering

EE 333

What is the truth table?

A B F

0 0 0

0 1 1

1 0 1

1 1 0

F = A·B + A·B

Fall 2006

Lillevik 333f06-l1 12University of Portland School of Engineering

EE 333

Schematic: SOPF = A·B + A·B

Fall 2006

Lillevik 333f06-l1 13University of Portland School of Engineering

EE 333

What is the truth table?

Fall 2006

Lillevik 333f06-l1 14University of Portland School of Engineering

EE 333

What is the logic function?

In1 In0 Out1 Out0

0 0 0 1

0 1 1 1

1 0 1 0

1 1 0 1

Fall 2006

Lillevik 333f06-l1 15University of Portland School of Engineering

EE 333

What is the logic function?

Fall 2006

Lillevik 333f06-l1 16University of Portland School of Engineering

EE 333

What is the logic function?In Out

000 1

001 1

010 0

011 1

100 0

101 0

110 1

111 1

Fall 2006

Lillevik 333f06-l1 17University of Portland School of Engineering

EE 333

Expectations of the Instructor

1.

2.

3.

Fall 2006

Lillevik 333f06-l1 18University of Portland School of Engineering

EE 333

Rumors on the Street

1.

2.

3.

Fall 2006

Lillevik 333f06-l1 19University of Portland School of Engineering

EE 333

Fall 2006

Lillevik 333f06-l1 20University of Portland School of Engineering

EE 333

What is the truth table?

A B F

0 0 0

0 1 1

1 0 1

1 1 0

F = A·B + A·B

Fall 2006

Lillevik 333f06-l1 21University of Portland School of Engineering

EE 333

What is the logic function?

In1 In0 Out1 Out0

0 0 0 1

0 1 1 1

1 0 1 0

1 1 0 1

Fall 2006

Lillevik 333f06-l1 22University of Portland School of Engineering

EE 333

What is the logic function?In Out

000 1

001 1

010 0

011 1

100 0

101 0

110 1

111 1