CSF Chap B Functional components of computer designs Basic logic gates.

Slides:



Advertisements
Similar presentations
Lecture 13: Sequential Circuits
Advertisements

Registers and Counters
Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
 Suppose for a moment that you were asked to perform a task and were given the following list of instructions to perform:
Chapter 1 — Computer Abstractions and Technology — 1 Lecture 7 Carry look ahead adders, Latches, Flip-flops, registers, multiplexors, decoders Digital.
-Alan Nelson -Andy Kruger -Dongpu Jin.  CPU is one of the most important and complicated parts of a computer.  We are going to design, implement and.
CSE111: Great Ideas in Computer Science Dr. Carl Alphonce 219 Bell Hall Office hours: M-F 11:00-11:
Room: E-3-31 Phone: Dr Masri Ayob TK 2123 COMPUTER ORGANISATION & ARCHITECTURE Lecture 5: CPU and Memory.
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
Logic and Computer Design Fundamentals Registers and Counters
Chapter 7 - Part 2 1 CPEN Digital System Design Chapter 7 – Registers and Register Transfers Part 2 – Counters, Register Cells, Buses, & Serial Operations.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.
16/07/2015CSE1303 Part B lecture notes 1 Hardware Implementation Lecture B17 Lecture notes section B17.
Chapter 7 – Registers and Register Transfers Part 1 – Registers, Microoperations and Implementations Logic and Computer Design Fundamentals.
Hardware Design of an Arithmetic Logic Unit (ALU) Felix Noble Mirayma V. Rodriguez Agnes Velez University of Puerto Rico Mayagüez Campus Mayagüez, Puerto.
1 Sequential Circuits Registers and Counters. 2 Master Slave Flip Flops.
Registers and Counters

CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Constructing a Computer Creating a general purpose computing device.
Chapter 6-2 Multiplier Multiplier Next Lecture Divider
Computer Science 210 Computer Organization The von Neumann Architecture.
CS1Q Computer Systems Lecture 11 Simon Gay. Lecture 11CS1Q Computer Systems - Simon Gay2 The D FlipFlop A 1-bit register is called a D flipflop. When.
P. 4.1 Digital Technology and Computer Fundamentals Chapter 4 Digital Components.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Basic Logic Gates.
Stack Stack Pointer A stack is a means of storing data that works on a ‘Last in first out’ (LIFO) basis. It reverses the order that data arrives and is.
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
Important Components, Blocks and Methodologies. To remember 1.EXORS 2.Counters and Generalized Counters 3.State Machines (Moore, Mealy, Rabin-Scott) 4.Controllers.
Chap 7. Register Transfers and Datapaths. 7.1 Datapaths and Operations Two types of modules of digital systems –Datapath perform data-processing operations.
1 Arithmetic Logic Unit ALU. 2 The Bus Concept 3 CPU Building Blocks  Registers (IR, PC, ACC)  Control Unit (CU)  Arithmetic Logic Unit (ALU)
Lec 3bSystems Architecture1 Systems Architecture Lecture 3b: Review of Sequential Logic Circuits Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan.
Computer Architecture Lecture 2 System Buses. Program Concept Hardwired systems are inflexible General purpose hardware can do different tasks, given.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
CHAPTER 4 The Central Processing Unit. Chapter Overview Microprocessors Replacing and Upgrading a CPU.
Chapter 3 Digital Logic Structures. 3-2 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex:
1 Control Unit Operation and Microprogramming Chap 16 & 17 of CO&A Dr. Farag.
IT253: Computer Organization
ALU (Continued) Computer Architecture (Fall 2006).
CPU The Central Processing Unit (CPU), has 3 main parts: Control Unit Arithmetic and Logic Unit Registers. These components are connected to the rest.
20 October 2015Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.
Computer Architecture Lecture 9 MIPS ALU and Data Paths Ralph Grishman Oct NYU.
Cpu control.1 2/14 Datapath Components for Lab The Processor! ( th ed)
Elements of Datapath for the fetch and increment The first element we need: a memory unit to store the instructions of a program and supply instructions.
Latches, Flip Flops, and Memory ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin – Madison.
MIPS Processor.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
5.3 Sequential Circuits - An Introduction to Informatics WMN Lab. Hey-Jin Lee.
Computing Science Computer Structure: Lesson 1: Processor Structure
Combinational Circuits
Basic Processor Structure/design
Computer Science 210 Computer Organization
Digital Decode & Correction Logic
More Devices: Control (Making Choices)
Chap 7. Register Transfers and Datapaths
EKT 221 : Digital 2 COUNTERS.
Computer Architecture
Processor (I).
The fetch-execute cycle
COSC 2021: Computer Organization Instructor: Dr. Amir Asif
Computer Science 210 Computer Organization
Functional Units.
5. Combinational circuits
Sequential circuits and Digital System Reliability
The Processor Lecture 3.1: Introduction & Logic Design Conventions
Fundamental Concepts Processor fetches one instruction at a time and perform the operation specified. Instructions are fetched from successive memory locations.
Recall: ROM example Here are three functions, V2V1V0, implemented with an 8 x 3 ROM. Blue crosses (X) indicate connections between decoder outputs and.
Overview Part 1 - Registers, Microoperations and Implementations
Combinational Circuits
Systems Architecture I
Digital Circuits and Logic
Presentation transcript:

CSF Chap B Functional components of computer designs Basic logic gates

The 2 level AND-OR logic circuit is a standard structure for combinational logic circuits that do not have “states” Example of a programmed logic array PLA

This logic circuit can be viewed as a primitive 1-bit slice of an arithmetic-logic unit (ALU). It can before logic operations: AND and OR; and it can perform an arithmetic operation: Addition

A more “powerful” 1-bit slice of an ALU

Overflow Detection: Example: two 32 bit numbers are added, and the sum does not fit in 32 bits.

C is the clock D is the Data input (1 bit) When C=1, D is stored on Q

A register is essentially a small memory usually holding words (operands, memory addresses, instructions, and control flags). A set of registers is called a register file. The register file can be directly accessed by the arithmetic logic unit (ALU) when executing an instruction. The memory cells in a register file are “fast” so as to have access (reads and writes) that support the functional operating time of the logic circuits in the ALU.

Where are the 8 bits (one byte) of an addressable memory byte stored?

Each one of the 8 bits of each byte is stored in a different one of the 512x64 SRAMs. Why? Doing this means that a single SRAM failure effects only one bit of each byte as opposed to an entire byte. So by storing redundant bits with each byte, a bit error could be detected and even corrected.

Note that for any 7 bit word (for example, ), there is no single bit flip that changes that word into any of the other 7 bit words. A bit error in a memory word can be detected/corrected by appending extra bits Large memories can have flawed bits (for example, a bit stuck- at-0 or stuck- at-1). To detect stuck bits, extra redundant bits can be stored. Assume a data word has 4 bits. Then 3 extra bits can be appended so that any single bit error can be corrected.

Red and Green traffic light states only (no yellow light.

The current state corresponds to a set of D-FF states. For the traffic light controller, there are only 2 states: NSgreen/EWred And EWgreen/NSred A single FF can represent the current state

Problem: Show a state Transition diagram for a traffic light controller where a counter/timer is used to determine a period of time during which the TL stays green in each direction. It is also assumed that a yellow light stays on for a fixed amount of time as determined by a counter/timer after a car is detected. Problem

INC=Increment INC causes a transition from one state to next D flipflop is master/slave. Important! 2x1 Mux Reset forces transition to 0 state Operates as a 1-bit oscillator: Q flips from 0 to 1 to 0 to 1 to ….. Problem: What are the modules and the connections between them to implement modulo 8 counter? What about a module 2 R counter?

1 bit Arithmetic Logic Unit (ALU) module (2 types) Overflow Detection

Note that the carry-outs “ripple” forward to the higher order bits. (Figure 3.2). Instead of having the delay of the carry ripple, it’s possible to look ahead to determine the carry-out bits.

The add operation on the ALU is “slow” because a carry- out of the bit 0 add might have to “ripple” all the way to the bit 31 add before the 32 bit sum can be computed.

All good things must come to an end………. If we continued as above, C31 would be a “big circuit”