Review. Combined Datapath
|
|
- Lizbeth Wilkinson
- 5 years ago
- Views:
Transcription
1 Review Topics:. A single cycle implementation 2. State Diagrams. A mltiple cycle implementation COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot # Designing a IPS Processor I: Control Patterson: Section. and Appendi D. D. Goal: Implement a sbset of core instrctions from the IPS instrction set, given below Category Instrction Eample eaning Comments Arithmetic and Logical Data Transfer Branch add add $s,$s2,$s $s! $s2+$s sbtract sb $s,$s2,$s $s! $s2-$s and add $s,$s2,$s $s! $s2&$s & => and or or $s,$s2,$s $s! $s2 $s => or slt slt $s,$s2,$s If $s < $s, $s! else $s! load word lw $s,($s2) $s! em[$s2+] store word sw $s,($s2) em[$s2+]! $s branch on eqal beq $s,$s2,l if($s==$s2) go to L nconditional jmp j 25 go to 2 Combined Datapath add/sb/or/and/slt $s,$s2,$s Combined Datapath: Arithmetic Operations (add,sb,or,and,slt) S r c S r c r e s l t r e s l t I n s t r c t i o n I n s t r c t i o n 2 R e g 6 2 e t e n d o p e r a t i o n r e s l t r e s s e m e m e m t o R e g I n s t r c t i o n I n s t r c t i o n 2 R e g 6 2 e t e n d o p e r a t i o n r e s l t r e s s e m e m e m t o R e g
2 lw $s, offset($s2) Combined Datapath: Data Transfer (load) Review: Data Transfer (store) sw $s, offset($s2) S r c S r c r e s l t r e s l t I n s t r c t i o n I n s t r c t i o n 2 R e g 6 2 e t e n d o p e r a t i o n r e s l t r e s s e m e m e m t o R e g I n s t r c t i o n I n s t r c t i o n 2 R e g 6 2 e t e n d o p e r a t i o n r e s l t r e s s e m e m e m t o R e g 5 6 beq $s, $s2, w_offset Review: Data Transfer (branch) Types of Datapath I n s t r c t i o n I n s t r c t i o n 2 R e g 6 2 e t e n d r e s l t o p e r a t i o n r e s l t S r c r e s s e m e m e m t o R e g! Datapaths can be divided into two categories.! Single cycle datapath: An instrction (e.g. lw) is performed in clock cycle 2.! ltiple cycle datapath: An instrction is performed in mltiple clock cycles! Advantage of single datapath: Keeps the design simpler! Disadvantage of single datapath:.! No datapath resorce can be sed more than once in a clock cycle 2.! Elements being accessed more than once in an instrction be dplicated or have mltiple inpts and otpts..! An instrction memory separate from data memory is reqired! In section., a single cycle datapath is considered. We epand the discssion to mltiple cycle datapaths later. 7 8
3 Control Control: ALU Control Unit ()! What needs to be added to complete the design of the single cycle datapath?! Control Unit activates appropriate controls at.! ALU 2.! UX s ().! Read/write signals for register file.! Read/write signals for data memory! Consider the design of the ALU Control Unit ALU Control Lines Reslt o p e r a t i o n! Inpts to ALU Control:.! Fnction fields of instrctions 2.! 2-bit control field ()! Otpt of ALU Control:.! -bit signal that controls the ALU Instrctions [5-] 5 ALU Control a b ALU reslt AND OR Add Sbtract SLT NOR a b C a r r y O t R e s l t O v e r f l o w 9 2 Control: ALU Control Unit (2) Control: ALU Control Unit () I-format: op ( 26) rs (25 2) rt (2 6) Immediate / Offset (5 ).! I-format instrctions (lw/sw/beq) does not have a fnction field 2.! Use to differentiate the operation from the rest e.g., = for lw/sw; = for beq R-format: op ( 26) rs (25 2) rt (2 6) rd (5 ) shamt ( 6) fnct (5 ).! R-format instrctions (add/sb/and/or) does have a fnction field 2.! = for all instrctions.! Fnction field is 2 for add, for sb, 6 for AND, 7 for OR, and 2 for SLT Instrction (opcode) Inpts ( ) Fnction Field (F5 F) Desired ALU action Otpts Operation (Op Op) lw (I) X X X X X X add sw (I) X X X X X X add beq (I) X X X X X X sb add (2) add sb () sb and (6) and or (7) or slt (2) slt.! The first two rows of the trth table are the same. 2.! Nmber of inpts in the trth table are 6 while nmber of rows in the table are 8..! Only 8 of the 2 6 = 2 possible combinations of inpt are being sed..! Some DO NOT CARE entries can be added to simplify the above trth table. 2
4 Control: ALU Control Unit () Instrction (opcode) Inpts ( ) Fnction Field (F5 F) Desired ALU action Otpts Operation (Op Op) lw (I) ( ) X X X X X X add sw (I) ( ) X X X X X X add beq (I) ( ) X X X X X X sb add (2) ( ) X X add sb () X ( ) X X sb and (6) ( ) X X and or (7) ( ) X X or slt (2) X ( ) X X slt does not se encoding, so, and may be replaced with X. The first two fields of the fnction fields are always, so, they are replaced by XX. Control: ALU Control Unit () Trth Table for Operation2 = : Simplified Epressions: Fnction code fields F5 F F F2 F F X X X X X X X X X X X() X() Op2 = + ALUOP" F The trth table above shows the inpt combinations for which the ALU Control shold be,,, or (the other combinations are not sed). Control: ALU Control Unit () Trth Table for Operation = : Fnction code fields F5 F F F2 F F X X X X X X X X() X X X X X() X() Simplified Epressions: Op = + F2 Op2 = + ALUOP F Control: ALU Control Unit () Trth Table for Operation = : Fnction code fields F5 F F F2 F F X X X X X X X X X X X X Simplified Epressions: Op = (F + F) Op = + F2 Op2 = + ALUOP F 5 6
5 Control: ALU Control Unit (5) Op = (F + F) Op = + F2 Op2 = + ALUOP F O p b l o c k O p O p F ( 5 ) F F 2 F O p e r a t i o n 2 O p e r a t i o n O p e r a t i o n F O p e r a t i o n ain Control () R-format: op ( 26) rs (25 2) rt (2 6) rd (5 ) shamt ( 6) fnct (5 ) I-format: op ( 26) rs (25 2) rt (2 6) Immediate / Offset (5 ).! Opcode is contained in bits ! Registers specified by rs (bits 25 2) and rt (bits 2 6) are always read.! Base register (w/ base address) for lw/sw instrction is specified by rs (bits 25 2).! 6-bit offset for beq, lw, and sw is always specified in bits 5. 5.! Destination register is specified in one of the two places:! For R-type instrctions (add/sb/and/or), destination register is specified by bits (5 )! For lw instrction, destination register is specified by bits (2 6) Using information ( 5), we can add the instrction labels and additional UX s to the datapath that we have constrcted. Combinational Circit for the ALU Control Unit 7 8 ain Control (2) ain Control () S r c Control Inpt Effect when Deasserted () Effect when asserted () R e g r e s l t RegDst Regwrite Destination register nmber comes from bits 2 6 of the instrction (sw) None Destination register nmber comes from bits 5 of the instrction (add,sb,or,and,slt) Data on the write data inpt is written on the register specified on the write register inpt (lw, add,sb,or,and) I n s t r c t i o n [ ] I n s t r c t i o n I n s t r c t i o n [ ] I n s t r c t i o n [ 2 6 ] I n s t r c t i o n [ 5 ] I n s t r c t i o n [ 5 ] e t e n d I n s t r c t i o n [ 5 ] O p r e s l t e m r e s s e m e m t o R e g ALUSrc emread emwrite emtoreg PCSrc Second operand to ALU comes from the second register file otpt (add,sb,or,and,beq,slt) None None Data from the otpt of ALU is fed into write data inpt of the register file (add,sb,or,and,slt) PC is replaced by the otpt of adder which adds to the eisting content of PC (ecept for beq) Second operand to ALU is sign etended, lower 6 bits of instrction(lw,sw) Data from memory location specified by address inpt is placed on the read data otpt (lw) Data from write data inpt replaces memory location specified by address inpt (sw) Data from the read data otpt of data memory is fed into write data inpt of the register file (lw) PC is replaced by the otpt of adder which comptes branch target by adding eisting content of PC with 2-bit right shifted offset (beq) Nmber of control lines is ( for UX s, for ALU control, 2 for data memory, for register file) 9 Net step in the design of datapath is to add a control nit that generates the control inpts to UX s 2
6 ain Control () ain Control (5) I n s t r c t i o n [ 2 6 ] e m e m t o R e g O p e m R e g r e s l t S r c Inpts of Control Unit: Instrction Opcode in Decimal Opcode in Binary Op5 Op Op Op2 Op Op R-format ten lw 5 ten sw ten beq ten I n s t r c t i o n I n s t r c t i o n [ ] I n s t r c t i o n [ 25 2 ] I n s t r c t i o n [ 2 6 ] I n s t r c t i o n [ 5 ] I n s t r c t i o n [ 5 ] e t e n d r e s l t r e s s Otpts of Control Unit: Instrction RegDst ALUSrc emtoreg RegWrite emread emwrite Branch R-format lw sw X X beq X X I n s t r c t i o n [ 5 ] 2 which constittes the trth table 22 I n p t s ain Control (6) O p 5 O p O p O p 2 O p O p R - f o r m a t I w s w b e q O t p t s Eample: R-type Instrction (step: fetch instrction & increment PC) I n s t r c t i o n [ 2 6 ] e m e m t o R e g O p e m R e g r e s l t e m t o R e g R e g e m e m O p 2 O p O I n s t r c t i o n Step. Fetch instrction I n s t r c t i o n [ ] 2. Add to the vale of PC I n s t r c t i o n [ ] I n s t r c t i o n [ 2 6 ] I n s t r c t i o n [ 5 ] I n s t r c t i o n [ 5 ] 2 I n s t r c t i o n [ 5 ] 6 2 e t e n d r e s l t r e s s 2
7 Eample: R-type Instrction (step2: Read two sorce registers) Eample: R-type Instrction (step: ALU operates on operands) I n s t r c t i o n [ 2 6 ] e m e m t o R e g O p e m R e g r e s l t I n s t r c t i o n [ 2 6 ] e m e m t o R e g O p e m R e g r e s l t I n s t r c t i o n I n s t r c t i o n [ ] I n s t r c t i o n [ ] I n s t r c t i o n [ 2 6 ] I n s t r c t i o n [ 5 ] I n s t r c t i o n [ 5 ] Step 2:. Sorce registers are read from the register file 2. Control nit ses the opcode to activate nits. = set based on opcode 2 I n s t r c t i o n [ 5 ] 6 2 e t e n d r e s l t r e s s 25 I n s t r c t i o n Step :. ALUSrc = I n s t r c t i o n [ ] I n s t r c t i o n [ ] I n s t r c t i o n [ 2 6 ] I n s t r c t i o n [ 5 ] I n s t r c t i o n [ 5 ] 2. Control line vales of ALU set by ALU-control 2. ALU performs desired operation on inpt data 2 I n s t r c t i o n [ 5 ] 6 2 e t e n d r e s l t r e s s 26 Eample: R-type Instrction (step : Write reslt in destination register) Why single-cycle implementation is not sed? I n s t r c t i o n I n s t r c t i o n [ ] Step :. emtoreg = ; RegDst = ; I n s t r c t i o n [ 2 6 ] I n s t r c t i o n [ ] I n s t r c t i o n [ 2 6 ] I n s t r c t i o n [ 5 ] I n s t r c t i o n [ 5 ] e m e m t o R e g O p e m R e g e t e n d r e s l t r e s l t r e s s Assming no delay at adder, sign etension nit, shift left nit, PC, control nit, and UX:! Load cycle reqires 5 fnctional nits: instrction fetch, register access, ALU, data memory access, register access! Store cycle reqires fnctional nits: instrction fetch, register access, ALU, data memory access! R-type instrction cycle reqires fnctional nits: instrction fetch, register access, ALU, register access! Path for a branch instrction reqires fnctional nits: instrction fetch, register access, ALU! Path for a jmp instrction reqires fnctional nit: instrction fetch Using a clock cycle of eqal dration for each instrction is a waste of resorces. 2. Reslt of ALU is written in specified register I n s t r c t i o n [ 5 ]. PC is incremented by 27 28
Topics: A multiple cycle implementation. Distributed Notes
COSC 22: Compter Organization Instrctor: Dr. Amir Asif Department of Compter Science York University Handot # lticycle Implementation of a IPS Processor Topics: A mltiple cycle implementation Distribted
More informationDesigning MIPS Processor
CSE 675.: Introdction to Compter Architectre Designing IPS Processor (lti-cycle) Presentation H Reading Assignment: 5.5,5.6 lti-cycle Design Principles Break p eection of each instrction into steps. The
More informationCPU DESIGN The Single-Cycle Implementation
22 ompter Organization Seqential vs. ombinational ircits Digital circits can be classified into two categories: DESIGN The Single-ycle Implementation. ombinational ircits: m, 2. Seqential ircits: flip-flops,
More informationDesigning Single-Cycle MIPS Processor
CSE 32: Introdction to Compter Architectre Designing Single-Cycle IPS Processor Presentation G Stdy:.-. Gojko Babić 2/9/28 Introdction We're now ready to look at an implementation of the system that incldes
More informationCPU DESIGN The Single-Cycle Implementation
CSE 202 Computer Organization CPU DESIGN The Single-Cycle Implementation Shakil M. Khan (adapted from Prof. H. Roumani) Dept of CS & Eng, York University Sequential vs. Combinational Circuits Digital circuits
More informationInstruction register. Data. Registers. Register # Memory data register
Where we are headed Single Cycle Problems: what if we had a more complicated instrction like floating point? wastefl of area One Soltion: se a smaller cycle time have different instrctions take different
More informationComputer Engineering Department. CC 311- Computer Architecture. Chapter 4. The Processor: Datapath and Control. Single Cycle
Computer Engineering Department CC 311- Computer Architecture Chapter 4 The Processor: Datapath and Control Single Cycle Introduction The 5 classic components of a computer Processor Input Control Memory
More informationLecture 12: Pipelined Implementations: Control Hazards and Resolutions
18-447 Lectre 12: Pipelined Implementations: Control Hazards and Resoltions S 09 L12-1 James C. Hoe Dept of ECE, CU arch 2, 2009 Annoncements: Spring break net week!! Project 2 de the week after spring
More informationL07-L09 recap: Fundamental lesson(s)!
L7-L9 recap: Fundamental lesson(s)! Over the next 3 lectures (using the IPS ISA as context) I ll explain:! How functions are treated and processed in assembly! How system calls are enabled in assembly!
More informationComputer Architecture Lecture 5: ISA Wrap-Up and Single-Cycle Microarchitectures
8-447 Compter Architectre Lectre 5: ISA Wrap-Up and Single-Cycle icroarchitectres Prof. Onr tl Carnegie ellon University Spring 22, /25/22 Homework Was de Wednesday! 34 received 2 Reminder: Homeworks for
More informationLecture 9: Control Hazard and Resolution. James C. Hoe Department of ECE Carnegie Mellon University
18 447 Lectre 9: Control Hazard and Resoltion James C. Hoe Department of ECE Carnegie ellon University 18 447 S18 L09 S1, James C. Hoe, CU/ECE/CALC, 2018 Yor goal today Hosekeeping simple control flow
More informationConcepts Introduced. Digital Electronics. Logic Blocks. Truth Tables
Concepts Introdced Digital Electronics trth tables, logic eqations, and gates combinational logic seqential logic Digital electronics operate at either high or low voltage. Compters se a binary representation
More informationProcessor Design & ALU Design
3/8/2 Processor Design A. Sahu CSE, IIT Guwahati Please be updated with http://jatinga.iitg.ernet.in/~asahu/c22/ Outline Components of CPU Register, Multiplexor, Decoder, / Adder, substractor, Varity of
More informationCSE Computer Architecture I
Execution Sequence Summary CSE 30321 Computer Architecture I Lecture 17 - Multi Cycle Control Michael Niemier Department of Computer Science and Engineering Step name Instruction fetch Instruction decode/register
More informationProject Two RISC Processor Implementation ECE 485
Project Two RISC Processor Implementation ECE 485 Chenqi Bao Peter Chinetti November 6, 2013 Instructor: Professor Borkar 1 Statement of Problem This project requires the design and test of a RISC processor
More information61C In the News. Processor Design: 5 steps
www.eetimes.com/electronics-news/23235/thailand-floods-take-toll-on--makers The Thai floods have already claimed the lives of hundreds of pele, with tens of thousands more having had to flee their homes
More informationPipelined Datapath. Reading. Sections Practice Problems: 1, 3, 8, 12 (2) Lecture notes from MKP, H. H. Lee and S.
Pipelined Datapath Lectre notes from KP, H. H. Lee and S. Yalamanchili Sections 4.5 4. Practice Problems:, 3, 8, 2 Reading (2) Pipeline Performance Assme time for stages is v ps for register read or write
More informationEC 413 Computer Organization
EC 413 Computer Organization rithmetic Logic Unit (LU) and Register File Prof. Michel. Kinsy Computing: Computer Organization The DN of Modern Computing Computer CPU Memory System LU Register File Disks
More informationSpiral 1 / Unit 3
-3. Spiral / Unit 3 Minterm and Maxterms Canonical Sums and Products 2- and 3-Variable Boolean Algebra Theorems DeMorgan's Theorem Function Synthesis use Canonical Sums/Products -3.2 Outcomes I know the
More informationOutcomes. Spiral 1 / Unit 2. Boolean Algebra BOOLEAN ALGEBRA INTRO. Basic Boolean Algebra Logic Functions Decoders Multiplexers
-2. -2.2 piral / Unit 2 Basic Boolean Algebra Logic Functions Decoders Multipleers Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name eamples of each.
More informationControl. Control. the ALU. ALU control signals 11/4/14. Next: control. We built the instrument. Now we read music and play it...
// CS 2, Fall 2! CS 2, Fall 2! We built the instrument. Now we read music and play it... A simple implementa/on uc/on uct r r 2 Write r Src Src Extend 6 Mem Next: path 7-2 CS 2, Fall 2! signals CS 2, Fall
More information4. (3) What do we mean when we say something is an N-operand machine?
1. (2) What are the two main ways to define performance? 2. (2) When dealing with control hazards, a prediction is not enough - what else is necessary in order to eliminate stalls? 3. (3) What is an "unbalanced"
More informationBuilding a Computer. Quiz #2 on 10/31, open book and notes. (This is the last lecture covered) I wonder where this goes? L16- Building a Computer 1
Building a Computer I wonder where this goes? B LU MIPS Kit Quiz # on /3, open book and notes (This is the last lecture covered) Comp 4 Fall 7 /4/7 L6- Building a Computer THIS IS IT! Motivating Force
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] When we talk about the number of operands in an instruction (a 1-operand or a 2-operand instruction, for example), what do we mean? [2] What are the two main ways to define performance? [2] Predicting
More information[2] Predicting the direction of a branch is not enough. What else is necessary?
[2] What are the two main ways to define performance? [2] Predicting the direction of a branch is not enough. What else is necessary? [2] The power consumed by a chip has increased over time, but the clock
More informationPipeline Datapath. With some slides from: John Lazzaro and Dan Garcia
Pipeline Datapath With some slides from: John Lazzaro and Dan Garcia The single cycle CPU Instrction [25 ] Shift Jmp address [3 ] left 2 26 28 PC+ [3 28] Instrction [3 26] Control RegDst Jmp Branch em
More informationOn the circuit complexity of the standard and the Karatsuba methods of multiplying integers
On the circit complexity of the standard and the Karatsba methods of mltiplying integers arxiv:1602.02362v1 [cs.ds] 7 Feb 2016 Igor S. Sergeev The goal of the present paper is to obtain accrate estimates
More informationCPSC 3300 Spring 2017 Exam 2
CPSC 3300 Spring 2017 Exam 2 Name: 1. Matching. Write the correct term from the list into each blank. (2 pts. each) structural hazard EPIC forwarding precise exception hardwired load-use data hazard VLIW
More information1. (2 )Clock rates have grown by a factor of 1000 while power consumed has only grown by a factor of 30. How was this accomplished?
1. (2 )Clock rates have grown by a factor of 1000 while power consumed has only grown by a factor of 30. How was this accomplished? 2. (2 )What are the two main ways to define performance? 3. (2 )What
More information3. (2) What is the difference between fixed and hybrid instructions?
1. (2 pts) What is a "balanced" pipeline? 2. (2 pts) What are the two main ways to define performance? 3. (2) What is the difference between fixed and hybrid instructions? 4. (2 pts) Clock rates have grown
More informationFast Path-Based Neural Branch Prediction
Fast Path-Based Neral Branch Prediction Daniel A. Jiménez http://camino.rtgers.ed Department of Compter Science Rtgers, The State University of New Jersey Overview The context: microarchitectre Branch
More information中村宏 工学部計数工学科 情報理工学系研究科システム情報学専攻 計算システム論第 2 1
計算システム論第 2 (3 章 ) 中村宏 工学部計数工学科 情報理工学系研究科システム情報学専攻 計算システム論第 2 IPS Assembly Langage ( 抜粋 ) IPS operands Name Eample Comments $s-$s7, $t-$t9, $zero, Fast locations for data. In IPS, data mst be in registers
More informationTEST 1 REVIEW. Lectures 1-5
TEST 1 REVIEW Lectures 1-5 REVIEW Test 1 will cover lectures 1-5. There are 10 questions in total with the last being a bonus question. The questions take the form of short answers (where you are expected
More informationReview: Single-Cycle Processor. Limits on cycle time
Review: Single-Cycle Processor Jump 3:26 5: MemtoReg Control Unit LUControl 2: Op Funct LUSrc RegDst PCJump PC 4 uction + PCPlus4 25:2 2:6 2:6 5: 5: 2 3 WriteReg 4: Src Src LU Zero LUResult Write + PC
More informationImplementing the Controller. Harvard-Style Datapath for DLX
6.823, L6--1 Implementing the Controller Laboratory for Computer Science M.I.T. http://www.csg.lcs.mit.edu/6.823 6.823, L6--2 Harvard-Style Datapath for DLX Src1 ( j / ~j ) Src2 ( R / RInd) RegWrite MemWrite
More informationLecture 13: Sequential Circuits, FSM
Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines 1 Clocks A microprocessor is composed of many different circuits that are operating simultaneously if each
More informationLecture 13: Sequential Circuits, FSM
Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines Reminder: midterm on Tue 2/28 will cover Chapters 1-3, App A, B if you understand all slides, assignments,
More informationArithmetic and Logic Unit First Part
Arithmetic and Logic Unit First Part Arquitectura de Computadoras Arturo Díaz D PérezP Centro de Investigación n y de Estudios Avanzados del IPN adiaz@cinvestav.mx Arquitectura de Computadoras ALU1-1 Typical
More informationCSc 256 Midterm 2 Fall 2010
CSc 256 Midterm 2 Fall 2010 NAME: 1a)YouaregivenaMIPSbranchinstruction: x:beq$12,$0,y Theaddressofthelabel"y"is0x40013c.Thememorylocationat"x"contains: addresscontents 0x4002080001000110000000????????????????...whichrepresentsthebeqinstruction;the????...????arethe
More informationCOVER SHEET: Problem#: Points
EEL 4712 Midterm 3 Spring 2017 VERSION 1 Name: UFID: Sign here to give permission for your test to be returned in class, where others might see your score: IMPORTANT: Please be neat and write (or draw)
More informationComputer Architecture. ECE 361 Lecture 5: The Design Process & ALU Design. 361 design.1
Computer Architecture ECE 361 Lecture 5: The Design Process & Design 361 design.1 Quick Review of Last Lecture 361 design.2 MIPS ISA Design Objectives and Implications Support general OS and C- style language
More informationLecture 3, Performance
Lecture 3, Performance Repeating some definitions: CPI Clocks Per Instruction MHz megahertz, millions of cycles per second MIPS Millions of Instructions Per Second = MHz / CPI MOPS Millions of Operations
More informationFigure 4.9 MARIE s Datapath
Term Control Word Microoperation Hardwired Control Microprogrammed Control Discussion A set of signals that executes a microoperation. A register transfer or other operation that the CPU can execute in
More informationLecture 3, Performance
Repeating some definitions: Lecture 3, Performance CPI MHz MIPS MOPS Clocks Per Instruction megahertz, millions of cycles per second Millions of Instructions Per Second = MHz / CPI Millions of Operations
More informationClassify by number of ports and examine the possible structures that result. Using only one-port elements, no more than two elements can be assembled.
Jnction elements in network models. Classify by nmber of ports and examine the possible strctres that reslt. Using only one-port elements, no more than two elements can be assembled. Combining two two-ports
More informationDesign of Digital Circuits Lecture 14: Microprogramming. Prof. Onur Mutlu ETH Zurich Spring April 2017
Design of Digital Circuits Lecture 4: Microprogramming Prof. Onur Mutlu ETH Zurich Spring 27 7 April 27 Agenda for Today & Next Few Lectures! Single-cycle Microarchitectures! Multi-cycle and Microprogrammed
More informationUNIVERSITY OF WISCONSIN MADISON
CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Prof. Gurindar Sohi TAs: Minsub Shin, Lisa Ossian, Sujith Surendran Midterm Examination 2 In Class (50 minutes) Friday,
More informationA Second Datapath Example YH16
A Second Datapath Example YH16 Lecture 09 Prof. Yih Huang S365 1 A 16-Bit Architecture: YH16 A word is 16 bit wide 32 general purpose registers, 16 bits each Like MIPS, 0 is hardwired zero. 16 bit P 16
More informationBLOOM S TAXONOMY. Following Bloom s Taxonomy to Assess Students
BLOOM S TAXONOMY Topic Following Bloom s Taonomy to Assess Stdents Smmary A handot for stdents to eplain Bloom s taonomy that is sed for item writing and test constrction to test stdents to see if they
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Simple Processor CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Digital
More informationProblem Class 4. More State Machines (Problem Sheet 3 con t)
Problem Class 4 More State Machines (Problem Sheet 3 con t) Peter Cheng Department of Electrical & Electronic Engineering Imperial College London URL: www.ee.imperial.ac.k/pcheng/ee2_digital/ E-mail: p.cheng@imperial.ac.k
More informationDesign. Dr. A. Sahu. Indian Institute of Technology Guwahati
CS222: Processor Design: Multi Cycle Design Dr. A. Sahu Dept of Comp. Sc. & Engg. Indian Institute of Technology Guwahati Mid Semester Exam Multi Cycle design Outline Clock periods in single cycle and
More informationPipelining. Traditional Execution. CS 365 Lecture 12 Prof. Yih Huang. add ld beq CS CS 365 2
Pipelining CS 365 Lecture 12 Prof. Yih Huang CS 365 1 Traditional Execution 1 2 3 4 1 2 3 4 5 1 2 3 add ld beq CS 365 2 1 Pipelined Execution 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5
More informationSection 7.4: Integration of Rational Functions by Partial Fractions
Section 7.4: Integration of Rational Fnctions by Partial Fractions This is abot as complicated as it gets. The Method of Partial Fractions Ecept for a few very special cases, crrently we have no way to
More informationSimple Instruction-Pipelining. Pipelined Harvard Datapath
6.823, L8--1 Simple ruction-pipelining Laboratory for Computer Science M.I.T. http://www.csg.lcs.mit.edu/6.823 Pipelined Harvard path 6.823, L8--2. I fetch decode & eg-fetch execute memory Clock period
More informationDepartment of Electrical and Computer Engineering The University of Texas at Austin
Department of Electrical and Computer Engineering The University of Texas at Austin EE 360N, Fall 2004 Yale Patt, Instructor Aater Suleman, Huzefa Sanjeliwala, Dam Sunwoo, TAs Exam 1, October 6, 2004 Name:
More informationThe Design Procedure. Output Equation Determination - Derive output equations from the state table
The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types
More informationComputer Architecture ELEC2401 & ELEC3441
Last Time Pipeline Hazard Computer Architecture ELEC2401 & ELEC3441 Lecture 8 Pipelining (3) Dr. Hayden Kwok-Hay So Department of Electrical and Electronic Engineering Structural Hazard Hazard Control
More informationSimple Instruction-Pipelining. Pipelined Harvard Datapath
6.823, L8--1 Simple ruction-pipelining Updated March 6, 2000 Laboratory for Computer Science M.I.T. http://www.csg.lcs.mit.edu/6.823 Pipelined Harvard path 6.823, L8--2. fetch decode & eg-fetch execute
More informationCHAPTER log 2 64 = 6 lines/mux or decoder 9-2.* C = C 8 V = C 8 C * 9-4.* (Errata: Delete 1 after problem number) 9-5.
CHPTER 9 2008 Pearson Education, Inc. 9-. log 2 64 = 6 lines/mux or decoder 9-2.* C = C 8 V = C 8 C 7 Z = F 7 + F 6 + F 5 + F 4 + F 3 + F 2 + F + F 0 N = F 7 9-3.* = S + S = S + S S S S0 C in C 0 dder
More informationWorkshop on Understanding and Evaluating Radioanalytical Measurement Uncertainty November 2007
1833-3 Workshop on Understanding and Evalating Radioanalytical Measrement Uncertainty 5-16 November 007 Applied Statistics: Basic statistical terms and concepts Sabrina BARBIZZI APAT - Agenzia per la Protezione
More informationCA Compiler Construction
CA4003 - Compiler Construction Code Generation to MIPS David Sinclair Code Generation The generation o machine code depends heavily on: the intermediate representation;and the target processor. We are
More informationPipeline Datapath. With some slides from: John Lazzaro and Dan Garcia
Pipeline path With some slides from: John Lazzaro and Dan Garcia Gotta Do Landry Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, fold, and pt away Washer takes 3 mintes A B C D Dryer
More informationLogic and Computer Design Fundamentals. Chapter 8 Sequencing and Control
Logic and Computer Design Fundamentals Chapter 8 Sequencing and Control Datapath and Control Datapath - performs data transfer and processing operations Control Unit - Determines enabling and sequencing
More informationECE 3401 Lecture 23. Pipeline Design. State Table for 2-Cycle Instructions. Control Unit. ISA: Instruction Specifications (for reference)
ECE 3401 Lecture 23 Pipeline Design Control State Register Combinational Control Logic New/ Modified Control Word ISA: Instruction Specifications (for reference) P C P C + 1 I N F I R M [ P C ] E X 0 PC
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationECE290 Fall 2012 Lecture 22. Dr. Zbigniew Kalbarczyk
ECE290 Fall 2012 Lecture 22 Dr. Zbigniew Kalbarczyk Today LC-3 Micro-sequencer (the control store) LC-3 Micro-programmed control memory LC-3 Micro-instruction format LC -3 Micro-sequencer (the circuitry)
More informationName: ID# a) Complete the state transition table for the aforementioned circuit
UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences EECS150 Fall 2001 Prof. Subramanian Final Examination 1) You are to design a sequential circuit with two JK FFs A and
More informationShift Register Counters
Shift Register Counters Shift register counter: a shift register with the serial output connected back to the serial input. They are classified as counters because they give a specified sequence of states.
More informationLoad. Load. Load 1 0 MUX B. MB select. Bus A. A B n H select S 2:0 C S. G select 4 V C N Z. unit (ALU) G. Zero Detect.
9- Write D data Load eable A address A select B address B select Load R 2 2 Load Load R R2 UX 2 3 UX 2 3 2 3 Decoder D address 2 Costat i Destiatio select 28 Pearso Educatio, Ic.. orris ao & Charles R.
More informationLogic Design. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Logic Deign CS 270: Mathematical Foundation of Computer Science Jeremy Johnon Logic Deign Objective: To provide an important application of propoitional logic to the deign and implification of logic circuit.
More informationChapter 4 Supervised learning:
Chapter 4 Spervised learning: Mltilayer Networks II Madaline Other Feedforward Networks Mltiple adalines of a sort as hidden nodes Weight change follows minimm distrbance principle Adaptive mlti-layer
More informationCMP 334: Seventh Class
CMP 334: Seventh Class Performance HW 5 solution Averages and weighted averages (review) Amdahl's law Ripple-carry adder circuits Binary addition Half-adder circuits Full-adder circuits Subtraction, negative
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Adders 2 Circuit Delay Transistors have instrinsic resistance and capacitance
More informationUncertainties of measurement
Uncertainties of measrement Laboratory tas A temperatre sensor is connected as a voltage divider according to the schematic diagram on Fig.. The temperatre sensor is a thermistor type B5764K [] with nominal
More informationChapter 3 MATHEMATICAL MODELING OF DYNAMIC SYSTEMS
Chapter 3 MATHEMATICAL MODELING OF DYNAMIC SYSTEMS 3. System Modeling Mathematical Modeling In designing control systems we mst be able to model engineered system dynamics. The model of a dynamic system
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Introduction Logic Gates Boolean Algebra Map Specification Combinational Circuits Flip-Flops Sequential Circuits Memory Components Integrated Circuits Digital Computers 2 LOGIC GATES
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationCSCI-564 Advanced Computer Architecture
CSCI-564 Advanced Computer Architecture Lecture 8: Handling Exceptions and Interrupts / Superscalar Bo Wu Colorado School of Mines Branch Delay Slots (expose control hazard to software) Change the ISA
More informationECE380 Digital Logic. Positional representation
ECE380 Digital Logic Number Representation and Arithmetic Circuits: Number Representation and Unsigned Addition Dr. D. J. Jackson Lecture 16-1 Positional representation First consider integers Begin with
More information3. Several Random Variables
. Several Random Variables. To Random Variables. Conditional Probabilit--Revisited. Statistical Independence.4 Correlation beteen Random Variables Standardied (or ero mean normalied) random variables.5
More informationUNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL
8th International DAAAM Baltic Conference "INDUSTRIAL ENGINEERING - 19-1 April 01, Tallinn, Estonia UNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL Põdra, P. & Laaneots, R. Abstract: Strength analysis is a
More informationDiscontinuous Fluctuation Distribution for Time-Dependent Problems
Discontinos Flctation Distribtion for Time-Dependent Problems Matthew Hbbard School of Compting, University of Leeds, Leeds, LS2 9JT, UK meh@comp.leeds.ac.k Introdction For some years now, the flctation
More informationQuadratic and Rational Inequalities
Chapter Qadratic Eqations and Ineqalities. Gidelines for solving word problems: (a) Write a verbal model that will describe what yo need to know. (b) Assign labels to each part of the verbal model nmbers
More informationCSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing
CSE4: Components and Design Techniques for Digital Systems Decoders, adders, comparators, multipliers and other ALU elements Tajana Simunic Rosing Mux, Demux Encoder, Decoder 2 Transmission Gate: Mux/Tristate
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationCS 52 Computer rchitecture and Engineering Lecture 4 - Pipelining Krste sanovic Electrical Engineering and Computer Sciences University of California at Berkeley http://www.eecs.berkeley.edu/~krste! http://inst.eecs.berkeley.edu/~cs52!
More informationTable of Content. Chapter 11 Dedicated Microprocessors Page 1 of 25
Chapter 11 Dedicated Microprocessors Page 1 of 25 Table of Content Table of Content... 1 11 Dedicated Microprocessors... 2 11.1 Manual Construction of a Dedicated Microprocessor... 3 11.2 FSM + D Model
More informationDesign of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
More informationSystem Data Bus (8-bit) Data Buffer. Internal Data Bus (8-bit) 8-bit register (R) 3-bit address 16-bit register pair (P) 2-bit address
Intel 8080 CPU block diagram 8 System Data Bus (8-bit) Data Buffer Registry Array B 8 C Internal Data Bus (8-bit) F D E H L ALU SP A PC Address Buffer 16 System Address Bus (16-bit) Internal register addressing:
More informationChapter 2 Difficulties associated with corners
Chapter Difficlties associated with corners This chapter is aimed at resolving the problems revealed in Chapter, which are cased b corners and/or discontinos bondar conditions. The first section introdces
More informationClock T FF1 T CL1 T FF2 T T T FF T T FF T CL T FF T CL T FF T T FF T T FF T CL. T cyc T H. Clock T FF T T FF T CL T FF T T FF T CL.
etup TA 60 c, vcc 3v Hold TA 30 c, vcc 5v Tkew TL TL TH FF FF 2 T cyc T H T L Clock TpdFF 2 TpdCL2Tetup FF Tcyc TL 2 2 TpdFF TpdCL Tetup FF2 TH 2 T FF T T FF T CL Hold L cd cd T FF T T FF T CL Hold L cd
More informationCS61C : Machine Structures
CS 61C L15 Blocks (1) inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks Outline CL Blocks Latches & Flip Flops A Closer Look 2005-07-14 Andy Carle CS
More informationINPUT-OUTPUT APPROACH NUMERICAL EXAMPLES
INPUT-OUTPUT APPROACH NUMERICAL EXAMPLES EXERCISE s consider the linear dnamical sstem of order 2 with transfer fnction with Determine the gain 2 (H) of the inpt-otpt operator H associated with this sstem.
More informationDepartment of Industrial Engineering Statistical Quality Control presented by Dr. Eng. Abed Schokry
Department of Indstrial Engineering Statistical Qality Control presented by Dr. Eng. Abed Schokry Department of Indstrial Engineering Statistical Qality Control C and U Chart presented by Dr. Eng. Abed
More informationDigital Logic Appendix A
Digital Logic Appendix A Boolean Algebra Gates Combinatorial Circuits Sequential Circuits 1 Boolean Algebra George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 Describe digital circuitry
More informationCS61C : Machine Structures
inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #15: Combinational Logic Blocks 2005-07-14 CS 61C L15 Blocks (1) Andy Carle Outline CL Blocks Latches & Flip Flops A Closer Look CS
More information2
Computer System AA rc hh ii tec ture( 55 ) 2 INTRODUCTION ( d i f f e r e n t r e g i s t e r s, b u s e s, m i c r o o p e r a t i o n s, m a c h i n e i n s t r u c t i o n s, e t c P i p e l i n e E
More informationEECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary
EECS50 - Digital Design Lecture - Shifters & Counters February 24, 2003 John Wawrzynek Spring 2005 EECS50 - Lec-counters Page Register Summary All registers (this semester) based on Flip-flops: q 3 q 2
More informationDigital Image Processing. Lecture 8 (Enhancement in the Frequency domain) Bu-Ali Sina University Computer Engineering Dep.
Digital Image Processing Lectre 8 Enhancement in the Freqenc domain B-Ali Sina Uniersit Compter Engineering Dep. Fall 009 Image Enhancement In The Freqenc Domain Otline Jean Baptiste Joseph Forier The
More information