CPS 104 Computer Organization and Programming Lecture 11: Gates, Buses, Latches. Robert Wagner

Similar documents
ALU A functional unit

Memory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1

Design of Sequential Circuits

CprE 281: Digital Logic

Sequential Circuit Analysis

Sequential Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science

ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates

Adders, subtractors comparators, multipliers and other ALU elements

Latches. October 13, 2003 Latches 1

ELCT201: DIGITAL LOGIC DESIGN

CS61C : Machine Structures

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 7 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

CS61C : Machine Structures

Boolean Logic Continued Prof. James L. Frankel Harvard University

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Adders, subtractors comparators, multipliers and other ALU elements

ECE/CS 250 Computer Architecture

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

Laboratory Exercise #8 Introduction to Sequential Logic

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Appendix B. Review of Digital Logic. Baback Izadi Division of Engineering Programs

Preparation of Examination Questions and Exercises: Solutions

Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #13

LOGIC CIRCUITS. Basic Experiment and Design of Electronics

Chapter 4. Sequential Logic Circuits

Computers also need devices capable of Storing data and information Performing mathematical operations on such data

SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER

Combinational Logic Design Combinational Functions and Circuits

Enrico Nardelli Logic Circuits and Computer Architecture

L4: Sequential Building Blocks (Flip-flops, Latches and Registers)

Topic 8: Sequential Circuits

Sequential Logic Circuits

EC 413 Computer Organization

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques

Binary addition example worked out

State and Finite State Machines

Lecture 4: Implementing Logic in CMOS

Konstruktion av Vippor och Latchar

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)

Boolean Algebra and Digital Logic 2009, University of Colombo School of Computing

Introduction to Digital Logic

CSE140: Components and Design Techniques for Digital Systems. Midterm Information. Instructor: Mohsen Imani. Sources: TSR, Katz, Boriello & Vahid

Chapter 3 Digital Logic Structures

Introduction to Digital Logic Missouri S&T University CPE 2210 Subtractors

L4: Sequential Building Blocks (Flip-flops, Latches and Registers)

Unit 7 Sequential Circuits (Flip Flop, Registers)

Digital Electronics Circuits 2017

CS/COE1541: Introduction to Computer Architecture. Logic Design Review. Sangyeun Cho. Computer Science Department University of Pittsburgh

Digital Logic Appendix A

Lecture 17: Designing Sequential Systems Using Flip Flops

Sequential Circuits. CS/EE 3700 : Fundamentals of Digital System Design

Introduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010

ELEN Electronique numérique

LOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

CSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing

Lecture 13: Sequential Circuits, FSM

Building a Computer Adder

Lecture 3 Review on Digital Logic (Part 2)

P2 (10 points): Given the circuit below, answer the following questions:

SRC Language Conventions. Class 6: Intro to SRC Simulator Register Transfers and Logic Circuits. SRC Simulator Demo. cond_br.asm.

LECTURE 2: Delay models, std_ulogic and. EECS 316 CAD Computer Aided Design. with-select-when. Chris Papachristou Case Western Reserve University

Homework #4. CSE 140 Summer Session Instructor: Mohsen Imani. Only a subset of questions will be graded

Arithme(c logic units and memory

EE 209 Logic Cumulative Exam Name:

Synchronous Sequential Logic

Adders allow computers to add numbers 2-bit ripple-carry adder

Boolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?

A B D 1 Y D 2 D 3. Truth table for 4 to 1 MUX: A B Y 0 0 D D D D 3

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4

Lecture 10: Synchronous Sequential Circuits Design


Lecture 14: State Tables, Diagrams, Latches, and Flip Flop

Sequential Circuits Sequential circuits combinational circuits state gate delay

Review for Final Exam

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

Lecture A: Logic Design and Gates

Boolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra

Lecture 13: Sequential Circuits, FSM

! Memory. " RAM Memory. ! Cell size accounts for most of memory array size. ! 6T SRAM Cell. " Used in most commercial chips

Review Problem 1. should be on. door state, false if light should be on when a door is open. v Describe when the dome/interior light of the car

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Logic Design II (17.342) Spring Lecture Outline

Digital electronics form a class of circuitry where the ability of the electronics to process data is the primary focus.

Chapter 7. Sequential Circuits Registers, Counters, RAM

University of Guelph School of Engineering ENG 2410 Digital Design Fall There are 7 questions, answer all questions.

Topics. CMOS Design Multi-input delay analysis. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut

CPE/EE 422/522. Chapter 1 - Review of Logic Design Fundamentals. Dr. Rhonda Kay Gaede UAH. 1.1 Combinational Logic

Topic 8: Sequential Circuits. Bistable Devices. S-R Latches. Consider the following element. Readings : Patterson & Hennesy, Appendix B.4 - B.

State Machines ELCTEC-131

Combinational vs. Sequential. Summary of Combinational Logic. Combinational device/circuit: any circuit built using the basic gates Expressed as

Philadelphia University Student Name: Student Number:

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

COSC3330 Computer Architecture Lecture 2. Combinational Logic

ALU, Latches and Flip-Flops

Fundamentals of Boolean Algebra

Processor Design & ALU Design

Menu. Excitation Tables (Bonus Slide) EEL3701 EEL3701. Registers, RALU, Asynch, Synch

Dept. of ECE, CIT, Gubbi Page 1

Transcription:

CPS 4 Computer Organization and Programming Lecture : Gates, Buses, Latches. Robert Wagner CPS4 GBL. RW Fall 2

Overview of Today s Lecture: The MIPS ALU Shifter The Tristate driver Bus Interconnections Register Cell The Register File Read Appendix B CPS4 GBL.2 RW Fall 2

Overflow Detection and Carries In Addition and Subtraction operations, Overflow occurs when two number of same sign are added, and result has different sign. Must be a function of what happens in high-order full-adder A 3 B 3 Cin 3 S 3 Cout 3 OVF Cin= Cout F Y T N F Y F Y F Y F Y T N F Y CPS4 GBL.3 RW Fall 2

Add/Subtract With Overflow detection Overflow S n- S n- 2 S S Full Adder Full Adder Full Adder Full Adder Add/Sub b n- a n- b n- 2 a n- 2 b a b a CPS4 GBL.4 RW Fall 2

MIPS ALU Slice Cin a b 3 2 A F a + b a - b - NOT b - 2 a OR b - 3 a AND b Add/sub 2 Cout Add/sub F CPS4 GBL.5 RW Fall 2

The MIPS ALU Overflow = Zero n- n-2 ALU Slice ALU Slice ALU Slice ALU Slice ALU control b n- a n- b n-2 a n-2 b a b a CPS4 GBL.6 RW Fall 2

CPS4 GBL.7 RW Fall 2 Shifter a a a2 a3 a4 a5 a6 a7 2 3 4 5 6 7 Shift- Shift-2 Shift-4

Memory Elements All the circuit we looked at so far are combinational circuits: the output is a Boolean function of the inputs. We need circuits that can remember values. (registers) The output of the circuit is a function of the input AND a function of a stored values (state). Circuits with memory are called sequential circuits. CPS4 GBL.8 RW Fall 2

Reset-Set Latch S R R S A() E() F F F F S F F T T S F T F T U F T T T S T F F F S T F T F U T T F F? T T T F U R S F F F T T T F F T T - Pick a wire in each cycle, call it a variable. (Here, ). A() = Activation of = current value of. Treat as input. E() = Excitation of = next future value of. Treat as output. When A()=E(), circuit is stable = doesn t change state When A()!=E(), circuit state goes from A() to E() CPS4 GBL.9 RW Fall 2

Reset-Set Latch (cont.) S S R R With S== and R==, BOTH states of wire are stable. CPS4 GBL. RW Fall 2

CPS4 GBL. RW Fall 2 Reset-Set Latch (cont.) S R S R S R S R R e s e t S e t

Data-Latch Data Enable D E - Negative Edge D-Latch CPS4 GBL.2 RW Fall 2

Data-Latch (cont.) Data Enable D E - Positive Edge D-Latch CPS4 GBL.3 RW Fall 2

Data Master-Slave Data-Flip-Flop Master Slave Clock While Clock false (low) D is copied to the master stage and the slave is stable. On Clock the Master stage is transferred into the slave stage (output), and the master stage is stable until Clock falls again. CPS4 GBL.4 RW Fall 2

Data DFF Timing M Clock Clock D M Time CPS4 GBL.5 RW Fall 2

Tri-State Driver The Tri-State driver is like a (one directional) switch: When Enable is on (E=) it transfers the input to the output. When Enable is off (E=) it disconnects the output from the input. D E D E - Z E Z :- High Impedance D CPS4 GBL.6 RW Fall 2

Bus Connections The Bus: Many to many connections. Mutual exclusion: At most one Enable is on! D n- D n-2 D D E n- E n-2 E E CPS4 GBL.7 RW Fall 2

Register Cells on a bus RE D E D latch WE RE D E D latch WE RE D E D latch WE RE D E D latch WE One can source and sink from any cell on the bus by activating the right controls (WE and RE). CPS4 GBL.8 RW Fall 2

3-Port Register Cell Data-In Bus-C Bus-B DinEnable OutA OutB Bus-A CPS4 GBL.9 RW Fall 2

3-Port Register EC EA EB Bus-C Bus-B Bit-2 Bus-A Bus-C Bus-B Bit- Bus-A Bus-C Bus-B Bit- CPS4 GBL.2 RW Fall 2 Bus-A

Address Decode circuit Bus-C Bus-B Bus-A Register address: For different address, change dots A A EA B B EB C C CPS4 GBL.2 EC RW Fall 2

Register File Reg-3 Reg-2 Reg- Reg- A3 B3 C3 A2 B2 C2 A B C Addresses selected by bubbles on AND gates A B C A-En Add-A Add-A B-En Add-B Add-B C-En Add-C Add-C CPS4 GBL.22 RW Fall 2

Summary So far we saw how to take a Boolean function and generate a circuit that realizes the function. We learned to construct circuits that can add and subtract. We learned about the ALU: a circuit that can add, subtract, detect overflow, compare, and do bit-wise operations (AND, OR, NOT) Saw how to construct a shifter circuit. Learned about the memory elements: RS-Latch, D-Latches and D-Flip-flops. Learned about Tri-State drivers and BUS Communication. (many-to many) Learned how to construct a register file. Saw how control signals can modify what the circuit will do with inputs. Examples: ALU, Shift, Register read-write,... CPS4 GBL.23 RW Fall 2