1. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-1 Introduction to Computer Engineering ELEC S100F (Fall 2013) Slides based on set prepared by Gregory T. Byrd, North carolina State University

2. Chapter 1 Welcome Aboard

3. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 - 3 Two Big Ideas Universal Computational Devices Given enough time and memory, all computers are capable of computing exactly the same things  irrespective of speed, size or cost Problem Transformation The ultimate objective is to transform a problem expressed in natural language into electrons running around a circuit!  That’s what Computer Science and Computer Engineering are all about!

4. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-4 Big Idea #1: Universal Computing Device All computers, given enough time and memory, are capable of computing exactly the same things. == PDA Workstation Supercomputer

5. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-5 Turing Machine Mathematical model of a device that can perform any computation – Alan Turing (1937) ability to read/write symbols on an infinite “tape” state transitions, based on current state and symbol Every computation can be performed by some Turing machine. (Turing’s thesis) T add a,ba+b Turing machine that adds T mul a,bab Turing machine that multiplies For more info about Turing machines, see http://www.wikipedia.org/wiki/Turing_machine/ For more about Alan Turing, see http://www.turing.org.uk/turing/

6. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-6 Universal Turing Machine A machine that can implement all Turing machines -- this is also a Turing machine! inputs: data, plus a description of computation (other TMs) U a,b,c c(a+b) Universal Turing Machine T add, T mul U is programmable – so is a computer! instructions are part of the input data a computer can emulate a Universal Turing Machine A computer is a universal computing device.

7. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-7 From Theory to Practice In theory, computer can compute anything that’s possible to compute given enough memory and time In practice, solving problems involves computing under constraints. time  weather forecast, next frame of animation,... cost  cell phone, automotive engine controller,... power  cell phone, handheld video game,...

8. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-8 Big Idea #2: Transformations Between Layers Problems Language Instruction Set Architecture Microarchitecture Circuits Devices Algorithms

9. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 - 9 Problem Transformation - breakdown Natural Language Algorithm Program Machine Architecture Devices Micro-architecture Logic Circuits Desired Behavior: application Raw Material: electronic devices

10. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-10 How do we solve a problem using a computer? A systematic sequence of transformations between layers of abstraction. Problem Algorithm Program Software Design: choose algorithms and data structures Programming: use language to express design Instr Set Architecture Instr Set Architecture Compiling/Interpreting: convert language to machine instructions

11. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-11 Deeper and Deeper… Instr Set Architecture Instr Set Architecture Microarch Circuits Processor Design: choose structures to implement ISA Logic/Circuit Design: gates and low-level circuits to implement components Devices Process Engineering & Fabrication: develop and manufacture lowest-level components

12. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-12 Descriptions of Each Level Problem Statement stated using "natural language" may be ambiguous, imprecise Algorithm step-by-step procedure, guaranteed to finish definiteness, effective computability, finiteness Program express the algorithm using a computer language high-level language, low-level language Instruction Set Architecture (ISA) specifies the set of instructions the computer can perform data types, addressing mode

13. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-13 Descriptions of Each Level (cont.) Micro-architecture detailed organization of a processor implementation different implementations of a single ISA Logic Circuits combine basic operations to realize microarchitecture many different ways to implement a single function (e.g., addition) Devices properties of materials, manufacturability

14. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1-14 Many Choices at Each Level Solve a system of equations Gaussian elimination Jacobi iteration Red-black SORMultigrid FORTRANCC++Java Intel x86PowerPCAtmel AVR CentrinoPentium 4Xeon Ripple-carry adderCarry-lookahead adder CMOSBipolarGaAs Tradeoffs: cost performance power (etc.)

15. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 - 15 Course Outline - What is Next? How to represent numbers/information The building blocks of computers: logic gates The basic algorithm: the von Neumann model An example: the LC3 structure and language Programming the machine: assembly language How does processor communicate with outside world?