ECE 206 - Fall 2000 - G. Byrd1 Register A register stores a multi-bit value. We use a collection of D-latches, all controlled by a common WE. When WE=1,

Slides:



Advertisements
Similar presentations
Machine cycle.
Advertisements

Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
Computer Science 210 Computer Organization Clocks and Memory Elements.
Digital Logic Circuits (Part 2) Computer Architecture Computer Architecture.
Chapter 3 Digital Logic Structures. 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000):
DATAPATHS 3) Shifters. 4) Comparators 5) Counters.
MOHD. YAMANI IDRIS/ NOORZAILY MOHAMED NOOR 1 Sequential Circuit: Register Introduction N-bit register contains n flip-flop and several logic gates and.
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Sequential Circuits.
Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic Combinational logic elements and design (DeMorgan’s Law)
1 Sec (2.1) Computer Architectures. 2 For temporary storage of information, the CPU contains cells, or registers, that are conceptually similar to main.
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Sequential Logic Flip Flops Registers Memory Timing State Machines.
Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.
Overview Recall Combinational Logic Sequential Logic Storage Devices
State Machines Timing Computer Bus Computer Performance Instruction Set Architectures RISC / CISC Machines.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.
Fall 2007 L16: Memory Elements LECTURE 16: Clocks Sequential circuit design The basic memory element: a latch Flip Flops.
The Processor Andreas Klappenecker CPSC321 Computer Architecture.
Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.
Dr. Rabie A. Ramadan Al-Azhar University Lecture 6
Using building blocks to make bigger circuits
Computer Science 210 Computer Organization The von Neumann Architecture.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Basic Logic Gates.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Combinational vs.
1 Sequential Digital Circuits Alexander Titov 11 October 2014.
EXECUTION OF COMPLETE INSTRUCTION
CSET 4650 Field Programmable Logic Devices
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
Lec 3bSystems Architecture1 Systems Architecture Lecture 3b: Review of Sequential Logic Circuits Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Complete Example.
Chapter 3 Digital Logic Structures. 3-2 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex:
Chapter 3 Digital Logic Structures
PART 3 Digital Logic 1.Logic Gates 2.Logic Circuits 3.Memory 4.Sequential Circuits 5.LC-3 Data Path.
Computer Hardware A computer is made of internal components Central Processor Unit Internal External and external components.
Computer Structure & Architecture 7b - CPU & Buses.
Introduction to Computer Engineering CS/ECE 252, Spring 2012 Prof. Karu Sankaralingam Computer Sciences Department University of Wisconsin – Madison.
Introduction to Computer Engineering CS/ECE 252, Fall 2007 Prof. David A. Wood Computer Sciences Department University of Wisconsin – Madison.
CBP 2006Comp 4070 Concepts and Philosophy of Computing 1 Wrestling with Complex Stuff. With the Correct Approach, even the smallest guy will succeed!
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
CO5023 Latches, Flip-Flops and Decoders. Sequential Circuit What does this do? The OUTPUT of a sequential circuit is determined by the current output.
Introduction to Computing Systems and Programming Digital Logic Structures.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Multiplexers.
3.13 How many output lines will a five-input decoder have?
Latches, Flip Flops, and Memory ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin – Madison.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Computer Science 210 Computer Organization
Computer Architecture & Operations I
Class Exercise 1B.
Computer Architecture & Operations I
More Devices: Control (Making Choices)
Computer Science 210 Computer Organization
Computer Science 210 Computer Organization
Simple Processor Control Unit
Latches and Flip-flops
Computer Science 210 Computer Organization
Computer Science 210 Computer Organization
Levels in Processor Design
Levels in Processor Design
April 3 Fun with MUXes Implementing arbitrary logical functions
Registers.
A register design with parallel load input
Levels in Processor Design
Control Unit (single cycle implementation)
Overview Last lecture Digital hardware systems Today
Levels in Processor Design
Sequential Logic.
Switching Theory and Logic Design Chapter 5:
Systems Architecture I
Levels in Processor Design
Presentation transcript:

ECE Fall G. Byrd1 Register A register stores a multi-bit value. We use a collection of D-latches, all controlled by a common WE. When WE=1, n-bit value D is written to register.

ECE Fall G. Byrd2 Memory Now that we know how to store bits, we can build a memory – a logical k × m array of stored bits. k = 2 n locations m bits Address Space: number of locations (usually a power of 2) Addressability: number of bits per location (e.g., byte-addressable)

ECE Fall G. Byrd3 2 2 x 3 Memory address decoder word select word WE address write enable input bits output bits Address 11--> Address 10--> Address 01--> Address 00 | | v

ECE Fall G. Byrd4 Clock Simply oscillates between high and low signal. You need a clock for your D-flip flop.

ECE Fall G. Byrd5 Remember the Combined Requirements (3 pts) Reset signal works as intended (3 pts) Design is organized on multiple pages (9 pts) Ability to store ALU result into memory

ECE Fall G. Byrd6 Clues - Use the pictures in the book P.70/P.69 - What is required for you to be Able to write to a register? 1. Which Address 2. Write Enable ON 3. Write Switch ON 4. Clock pressed - You will need muxes in order to read from memory and be able to display out, this part is tricky.

ECE Fall G. Byrd7 LC-3 Data Path Combinational Logic State Machine Storage