Embedded Systems Design: A Unified Hardware/Software Introduction. Outline. Chapter 2: Custom single-purpose processors.
|
|
- Dorothy Hamilton
- 5 years ago
- Views:
Transcription
1 Hrdwre/Softwre Itroductio Chpter Custom sigle-purpose processors Itroductio Combitiol logic Sequetil logic Outlie Custom sigle-purpose processor desig RT-level custom sigle-purpose processor desig Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 2 Itroductio CMOS trsistor o silico Processor Digitl circuit tht performs computtio tsks Cotroller d Geerl-purpose: vriet of computtio tsks Sigle-purpose: oe prticulr computtio tsk Custom sigle-purpose: o-stdrd tsk A custom sigle-purpose processor m be st, smll, low power But, high NRE, loger time-to-mrket, less fleible les CCD Digitl cmer chip A2D JPEG codec DMA ler CCD preprocessor Microler Piel coprocessor Displ ctrl D2A Multiplier/Accum Memor ler ISA bus iterfce UART LCD ctrl Trsistor The bsic electricl compoet i digitl sstems Acts s o/off switch Voltge t gte s whether curret flows from source to dri Do t cofuse this gte with logic gte gte IC pckge IC source gte oide chel dri Silico substrte source Coducts if gte= dri Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 3 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 4
2 CMOS trsistor implemettios Bsic logic gtes Complemetr Metl Oide Semicoductor We refer to logic levels Tpicll is V, is 5V Two bsic CMOS tpes MOS coducts if gte= pmos coducts if gte= Hece complemetr Bsic gtes Iverter, NAND, NOR gte iverter source Coducts if gte= dri MOS = ' gte NAND gte = ()' source Coducts if gte= dri pmos NOR gte = (+)' = Driver = Iverter = AND = ( ) NAND = + OR = (+) NOR =! XOR = XNOR Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 5 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 6 Combitiol logic desig RT-Level Combitiol compoets A) Problem descriptio is if is to, or b d c re. z is if b or c is to, but ot both, or if ll re. D) Miimized output equtios bc z bc Combitiol circuit - digitl circuit whose output is purel fuctio of its preset iputs. = + bc z = b + b c + bc B) Truth tble Iputs Outputs b c z b c C) Output equtios = 'bc + b'c' + b'c + bc' + bc z = 'b'c + 'bc' + b'c + bc' + bc E) Logic Gtes z I(m-) I I S -bit, m Multipleor S(log m) O O = I if S=.. I if S=.. I(m-) if S=.. I(log -) I log Decoder O(-) O O O = if I=.. O = if I=.. O(-) = if I=.. With eble iput e! ll O s re if e= A B -bit Adder sum = A+B (first bits) crr = (+) th bit of A+B With crr-i iput Ci! crr sum sum = A + B + Ci A B -bit Comprtor less equl greter less = if A<B equl = if A=B greter= if A>B A B bit, m fuctio S ALU S(log m) O O = A op B op determied b S. M hve sttus outputs crr, zero, etc. Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 7 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 8
3 Sequetil compoets Sequetil logic desig Sequetil circuit - digitl circuit whose outputs re fuctio of the preset iputs s well s the previous iputs A) Problem Descriptio C) Implemettio Model D) Stte Tble (Moore-tpe) lod cler -bit Register Q = if cler=, I if lod= d clock=, Q(previous) otherwise. I Q shift I Q = lsb - Cotet shifted - I stored i msb -bit Shift register Q -bit Couter Q = if cler=, Q(prev)+ if cout= d clock=. Q You wt to costruct clock divider. Slow dow our preeistig clock so tht ou output for ever four clock ccles = = B) Stte Digrm - SM = = = 3 = = = 2 = = = = Combitiol logic (Geerte output vlues d et stte) Q Q Stte register (Stores curret stte) I I I I Iputs Outputs Q Q I I Give this implemettio model Sequetil logic desig quickl reduces to combitiol logic desig Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 9 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis Sequetil logic desig (cot.) Custom sigle-purpose processor bsic model I QQ I QQ QQ E) Miimized Output Equtios ) Combitiol Logic I = Q Q + Q + QQ I = Q + Q = QQ Q Q I I eterl iputs ler eterl outputs iputs outputs ler d eterl dt iputs eterl dt outputs ler et-stte d logic stte register registers fuctiol uits view iside the ler d Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 2
4 Emple: gretest commo divisor Stte digrm templtes irst crete lgorithm Covert lgorithm to comple stte mchie Kow s SMD: fiitestte mchie with C use templtes to perform such coversio () blck-bo view go_i _i GCD d_o _i (b) desired fuctiolit : it, ; : while () { while (); = _i; = _i; while (!= ) { if ( < ) 7: = - ; else 8: = - ; d_o = ; : 2-J: 7: = - 8: = - -J: 6-J: 5-J: < = _i = _i d_o =!=!!()!(!=)!(<) (c) stte digrm Assigmet sttemet = b et sttemet = b et sttemet C: J: Loop sttemet while (cod) { loop-bodsttemets et sttemet cod loop-bodsttemets et sttemet!cod c stmts Brch sttemet if (c) c stmts else if c2 c2 stmts else other stmts et sttemet C: c J: c2 stmts!c*c2 et sttemet!c*!c2 others Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 3 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 4 Cretig the Cretig the ler s SM Crete register for declred vrible Crete fuctiol uit for ech rithmetic opertio Coect the ports, registers d fuctiol uits Bsed o reds d writes Use multipleors for multiple sources Crete uique idetifier for ech compoet iput d output : 2-J: 7: = - 8: = - -J: 6-J: 5-J: < = _i = _i d_o =!=!!()!(!=)!(<) _i _i _sel -bit 2 -bit 2 _sel _ld : : _ld!= <!= < 8: - _eq lt_ d_ld Dtpth 7: - d d_o : 2-J: 7: = - 8: = - -J: 6-J: 5-J: < = _i = _i d_o =!=!!()!(!=)!(<) Cotroller : 2-J: _lt_!_lt_ 7: _sel = 8: _sel = _ld = _ld = 6-J: 5-J: -J: _sel = _ld = _sel = _ld = d_ld =! _eq_!()!_eq_ go_i Sme structure s SMD Replce comple ctios/coditios with cofigurtios _sel _sel _ld _ld!= < _eq lt_ d_ld _i!= -bit 2 _i : : < -bit 2 8: - Dtpth d 7: - d_o Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 5 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 6
5 Splittig ito ler d Cotroller stte tble for the GCD emple Cotroller implemettio model go_i Combitiol logic Q3 Q2 Q Q I3 Stte register I2 I I _sel _sel _ld _ld _eq lt_ d_ld Cotroller : 2-J: _lt_= _lt_= 7: _sel = 8: _sel = _ld = _ld = 6-J: _sel = _ld = _sel = _ld =!!() _eq_= _eq_= go_i _sel _sel _ld _ld _i -bit 2!= < _eq lt_ d_ld!= _i -bit 2 : : < 8: - (b) Dtpth 7: - d d_o Iputs Outputs Q3 Q2 Q Q _eq _lt_ go_i I3 I2 I I _sel _sel _ld _ld d_ld _ * * * X X * * X X * * X X * * * X X * * * X * * * X * * X X * * X X * * X X * * X X * * * X * * * X * * * X X * * * X X * * * X X 5-J: d_ld = * * * X X * * * X X * * * X X -J: * * * X X Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 7 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 8 Completig the GCD custom sigle-purpose processor desig We fiished the We hve stte tble for the et stte d logic All tht s left is combitiol logic desig This is ot optimized desig, but we see the bsic steps ler et-stte d logic stte register registers fuctiol uits view iside the ler d RT-level custom sigle-purpose processor desig We ofte strt with stte mchie Rther th lgorithm Ccle timig ofte too cetrl to fuctiolit Emple Bus bridge tht coverts 4-bit bus to 8-bit bus Strt with SMD Kow s register-trsfer (RT) level Eercise: complete the desig Problem Specifictio SMD Sede r rd_i clock dt_i(4) rd_i= rd_i= Witirst4 rd_i= WitSecod4 Sed8Strt dt_out=dt_hi & dt_lo rd_out= Bridge A sigle-purpose processor tht coverts two 4-bit iputs, rrivig oe t time over dt_i log with rd_i pulse, ito oe 8-bit output o dt_out log with rd_out pulse. Bridge Recirst4Strt dt_lo=dt_i rd_i= rd_i= RecSecod4Strt dt_hi=dt_i rd_i= Sed8Ed rd_out= rd_out dt_out(8) rd_i= Recirst4Ed rd_i= RecSecod4Ed Rece iver Iputs rd_i: bit; dt_i: bit[4]; Outputs rd_out: bit; dt_out:bit[8] Vribles dt_lo, dt_hi: bit[4]; Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 9 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 2
6 RT-level custom sigle-purpose processor desig (cot ) Optimizig sigle-purpose processors () Cotroller rd_i= rd_i clk dt_i(4) Witirst4 rd_i= WitSecod4 Sed8Strt dt_out_ld= rd_out= Bridge rd_i= Recirst4Strt dt_lo_ld= rd_i= rd_i= RecSecod4Strt dt_hi_ld= Sed8Ed rd_out= rd_i= Recirst4Ed rd_i= RecSecod4Ed rd_out dt_out Optimiztio is the tsk of mkig desig metric vlues the best possible Optimiztio opportuities origil progrm SMD SM to ll registers (b) Dtpth dt_out_ld dt_hi_ld dt_hi dt_out dt_lo dt_lo_ld Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 2 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 22 Optimizig the origil progrm Optimizig the origil progrm (cot ) Alze progrm ttributes d look for res of possible improvemet umber of computtios size of vrible time d spce compleit opertios used multiplictio d divisio ver epesive origil progrm : it, ; : while () { while (); = _i; = _i; while (!= ) { if ( < ) 7: = - ; else 8: = - ; d_o = ; GCD(42, 8) - 9 itertios to complete the loop replce the subtrctio opertio(s) with modulo opertio i order to speed up progrm d vlues evluted s follows : (42, 8), (43, 8), (26,8), (8,8), (, 8), (2,8), (2,6), (2,4), (2,2). optimized progrm : it,, r; : while () { while (); // must be the lrger umber if (_i >= _i) { =_i; =_i; else { 7: =_i; 8: =_i; while (!= ) { : r = % ; : = ; = r; d_o = ; GCD(42,8) - 3 itertios to complete the loop d vlues evluted s follows: (42, 8), (8,2), (2,) Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 23 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 24
7 Optimizig the SMD Optimizig the SMD (cot.) Ares of possible improvemets merge sttes sttes with costts o trsitios c be elimited, trsitio tke is lred kow sttes with idepedet opertios c be merged seprte sttes sttes which require comple opertios (*b*c*d) c be broke ito smller sttes to reduce hrdwre size schedulig 7: it, ;! :!() 2-J: = _i = _i!(!=)!= <!(<) = - 8: = - 6-J: origil SMD elimite stte trsitios hve costt vlues merge stte 2 d stte 2J o loop opertio i betwee them merge stte 3 d stte 4 ssigmet opertios re idepedet of oe other merge stte 5 d stte 6 trsitios from stte 6 c be doe i stte 5 elimite stte 5J d 6J trsitios from ech stte c be doe from stte 7 d stte 8, respectivel optimized SMD < it, ; = _i = _i > go_i 7: = - 8: = - d_o = 5-J: d_o = elimite stte -J trsitio from stte -J c be doe directl from stte 9 -J: Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 25 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 26 Optimizig the Optimizig the SM Shrig of fuctiol uits oe-to-oe mppig, s doe previousl, is ot ecessr if sme opertio occurs i differet sttes, the c shre sigle fuctiol uit Multi-fuctiol uits ALUs support vriet of opertios, it c be shred mog opertios occurrig i differet sttes Stte ecodig tsk of ssigig uique bit ptter to ech stte i SM size of stte register d combitiol logic vr c be treted s orderig problem Stte miimiztio tsk of mergig equivlet sttes ito sigle stte stte equivlet if for ll possible iput combitios the two sttes geerte the sme outputs d trsitios to the et sme stte Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 27 Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 28
8 Summr Custom sigle-purpose processors Strightforwrd desig techiques C be built to eecute lgorithms Tpicll strt with SMD CAD tools c be of gret ssistce Hrdwre/Softwre Itroductio, (c) 2 Vhid/Givrgis 29
Embedded Systems Design: A Unified Hardware/Software Introduction. Chapter 2: Custom single-purpose processors
Hardware/Software Introduction Chapter 2: Custom single-purpose processors Outline Introduction Combinational logic Sequential logic Custom single-purpose processor design RT-level custom single-purpose
More informationEmbedded Systems Design: A Unified Hardware/Software Introduction. Chapter 2: Custom single-purpose processors
Hardware/Software Introduction Chapter 2: Custom single-purpose processors Outline Introduction Combinational logic Sequential logic Custom single-purpose processor design RT-level custom single-purpose
More informationEE414 Embedded Systems Ch 2. Custom Single- Purpose Processors: Hardware
EE44 Embedded Systems Ch 2. Custom Single- Purpose Processors: Hardware Byung Kook Kim School of Electrical Engineering Korea Advanced Institute of Science and Technology Outline 2. Introduction Review
More informationCustom single-purpose processors: Hardware. 4.1 Introduction. 4.2 Combinational logic design 4-1
Chapter 4: Custom sigle-purpose processors: Hardware 4- Chapter 4 Custom sigle-purpose processors: Hardware 4. Itroductio As metioed i the previous chapter, a sigle-purpose processor is a digital sstem
More informationBehavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationSection 3.2: Arithmetic Sequences and Series
Sectio 3.: Arithmetic Sequeces Series Arithmetic Sequeces Let s strt out with efiitio: rithmetic sequece: sequece i which the ext term is fou by ig costt (the commo ifferece ) to the previous term Here
More informationToday s Lecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Recursive Example. Review: The C / C++ code. Recursive Example (Continued)
Tod s Lecture Bsics of Logic Design: Boolen Alger, Logic Gtes Alvin R. Leeck CPS 4 Lecture 8 Homework #2 Due Ferur 3 Outline Review (sseml recursion) Building the uilding locks Logic Design Truth tles,
More informationEE 477 Digital Signal Processing. 8a IIR Systems
EE 477 Digitl Sigl Processig 8 IIR Systems Geerl Differece Equtio FIR: output depeds o curret d pst iputs oly IIR: output depeds o curret d pst iputs d pst outputs y M [] b x[ ] + y[ l] l N l EE 477 DSP
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationComputer Architecture. Microcomputer Architecture and Interfacing Colorado School of Mines Professor William Hoff
Computer rchitecture Microcomputer rchitecture ad Iterfacig Colorado School of Mies Professor William Hoff Computer Hardware Orgaizatio Processor Performs all computatios; coordiates data trasfer Iput
More informationCS280 HW1 Solution Set Spring2002. now, we need to get rid of the n term. We know that:
CS80 HW Solutio Set Sprig00 Solutios by: Shddi Doghmi -) -) 4 * 4 4 4 ) 4 b-) ) ) ) * ) ) ) 0 ) c-) ) ) ) ) ) ow we eed to get rid of the term. We ow tht: ) ) ) ) substitute ito the recursive epressio:
More informationEE213A - EE298-2 Lecture 11
EE23A EE292 Lecture Time multiplexig eferece: F. Ctthoor (prt III) Igrid Verbuwhede Deprtmet of Electricl Egieerig Uiversity of Clifori Los Ageles igrid@ee.ucl.edu Motivtio DSP represettio & modelig to
More information. (b) Evaluate the sum given by. Exercise #1: A sequence is defined by the equation a n 2n
Nme: 453 Dte: SEQUENCES ALGEBRA WITH TRIGONOMETRY Sequeces, or ordered list of umbers, re extremely importt i mthemtics, both theoreticl d pplied A sequece is formlly defied s fuctio tht hs s its domi
More informationLogic Spring Final Review
Idirect Argumet: Cotrdictios d Cotrpositio. Prove the followig by cotrdictio d by cotrpositio. Give two seprte proofs. The egtive of y irrtiol umber is irrtiol. b. For ll iteger, if ² is odd the is odd.
More informationDef : A radical is an expression consisting of a radical sign (radical symbol), a radicand, and an index.
Mth 0 Uit : Roots & Powers Red Buildig O, Big Ides, d New Vocbulry, p. 0 tet.. Estitig Roots ( clss) Red Lesso Focus p. tet. Outcoes Ch. Notes. Defie d give eple of rdicl. pp. 0, 9. Idetify the ide d the
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationPCJ-BLAST massively parallel sequence alignment using NCBI Blast and PCJ Java library
PCJ-BLAST mssively prllel sequece ligmet usig NCBI Blst d PCJ Jv librry Piotr Bł Mrek Nowicki Dvit Bzhlv bl@icm.edu.pl ICM Uiversity of Wrsw frmir@mt.umk.pl ICM Uiversity of Wrsw N. Copericus Uiversity
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationBasics of Logic Design Arithmetic Logic Unit (ALU)
Bsics of Logic Design Arithmetic Logic Unit (ALU) CPS 4 Lecture 9 Tody s Lecture Homework #3 Assigned Due Mrch 3 Project Groups ssigned & posted to lckord. Project Specifiction is on We Due April 9 Building
More informationCS2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
CS DIGITAL LOGIC & STATE MACHINE DESIGN SPRING DUE : April 7, HOMEWOR V READ : Relted portions of Chpters III, IV, VI, VII nd VIII ASSIGNMENT : There re seven questions Solve ll homework nd exm problems
More information3n
Prctice Set 6 Sequeces d Series Clcultor Required Objectives Alyze ptters i sequeces to determie subsequet terms. Fid the first four terms of sequece give equtio for. Fid expressio for give sequece. Expd
More informationGauss-Seidel Method. An iterative method. Basic Procedure:
Guss-Siedel Method Guss-Seidel Method A itertive method. Bsic Procedure: -Algebriclly solve ech lier equtio for i -Assume iitil guess solutio rry -Solve for ech i d repet -Use bsolute reltive pproimte
More informationHigh-Performance Floating Point Divide
High-Performce Flotig Poit Divide Albert A. Liddicot d Michel J. Fly Computer Systems Lbortory Stford Uiversity, Stford, CA 945 liddicot@stford.edu d fly@umuhum.stford.edu Abstrct I moder processors flotig
More informationUsing Gaussian Elimination for Determination of Structure Index in Euler Deconvolution
Austrli Jourl of Bsic d Applied Scieces, 4(1): 6390-6396, 010 ISSN 1991-8178 Usig Gussi Elimitio for Determitio of Structure Idex i Euler Decovolutio 1 Rez.toushmli d M.ghbri 1 Islmic zd uiversity,hmed
More informationThe Reciprocal Function Family. Objectives To graph reciprocal functions To graph translations of reciprocal functions
- The Reciprocl Function Fmil Objectives To grph reciprocl functions To grph trnsltions of reciprocl functions Content Stndrds F.BF.3 Identif the effect on the grph of replcing f () b f() k, kf(), f(k),
More informationCS 130 : Computer Systems - II. Shankar Balachandran Dept. of Computer Science & Engineering IIT Madras
CS 3 : Computer Systems - II Shnkr Blchndrn (shnkr@cse.iitm.c.in) Dept. of Computer Science & Engineering IIT Mdrs Recp Differentite Between s nd s Truth Tbles b AND b OR NOT September 4, 27 Introduction
More informationQuestions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?
Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?
More informationExternal Memory. External Memory. Computational Models. Computational Models
Exterl emory Exterl emory Computtiol model Shortet pth i implicit grid grph lgorithm I/O lgorithm Cche-oliviou lgorithm Computtiol model Shortet pth i implicit grid grph lgorithm I/O lgorithm Cche-oliviou
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationPrimitive Pythagorean triples and generalized Fibonacci sequences
Notes o Number Theory d Discrete Mthemtics Prit ISSN 30 53, Olie ISSN 37 875 Vol 3, 07, No, 5 Primitive Pythgore triples d geerlized ibocci sequeces J V Leyedekkers d A G Sho, 3 culty of Sciece, The Uiversity
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationChapter 5: Processor Design Advanced Topics. Microprogramming: Basic Idea
5-1 Chapter 5 Processor Desig Advaced Topics Chapter 5: Processor Desig Advaced Topics Topics 5.3 Microprogrammig Cotrol store ad microbrachig Horizotal ad vertical microprogrammig 5- Chapter 5 Processor
More informationDigital Design. Chapter 1: Introduction. Digital Design. Copyright 2006 Frank Vahid
Chpter : Introduction Copyright 6 Why Study?. Look under the hood of computers Solid understnding --> confidence, insight, even better progrmmer when wre of hrdwre resource issues Electronic devices becoming
More informationCMSC Computer Architecture Lecture 3: ISA and Introduction to Microarchitecture. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 3: ISA ad Itroductio to Microarchitecture Prof. Yajig Li Uiversity of Chicago Lecture Outlie ISA uarch (hardware implemetatio of a ISA) Logic desig basics Sigle-cycle
More informationECEN 468 Advanced Logic Design Lecture 36: RTL Optimization
ECEN 468 Advnced Logic Design Lecture 36: RTL Optimiztion ECEN 468 Lecture 36 RTL Design Optimiztions nd Trdeoffs 6.5 While creting dtpth during RTL design, there re severl optimiztions nd trdeoffs, involving
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Single-Cycle Disadvantages & Advantages
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 4 The Processor Pipeliig Sigle-Cycle Disadvatages & Advatages Clk Uses the clock cycle iefficietly the clock cycle must
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationModule Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two
Give submodule mux32two: 2-to- MUX module mux32two (iput [3:] i,i, iput sel, output [3:] out); Module Istatiatio Fiite Machies esig methodology for sequetial logic -- idetify distict s -- create trasitio
More informationChapter 4 The Datapath
The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that
More informationSection 3.1: Sequences and Series
Sectio 3.: Sequeces d Series Sequeces Let s strt out with the defiitio of sequece: sequece: ordered list of umbers, ofte with defiite ptter Recll tht i set, order does t mtter so this is oe wy tht sequece
More informationGauss-Siedel Method. Major: All Engineering Majors. Authors: Autar Kaw
Guss-Siedel Method Mjor: All Egieerig Mjors Authors: Autr Kw http://umericlmethods.eg.usf.edu Trsformig Numericl Methods Eductio for STEM Udergrdutes 4//06 http://umericlmethods.eg.usf.edu Guss-Seidel
More informationRaytracing: Quality. Ray Genealogy. Ray Genealogy. Describe what you see! Describe what you see! Describe what you see!
Rytrcig: Qulity COSC 4328/5327 Scott A. Kig Ry Geelogy Primry rys spw off 3 rys. Two of those c spw of 3 more, etc. Whe do you stop? Whe ry leves the scee. Whe the cotriutio is smll eough. After ech ouce
More informationSymbolic Algebra and Timing Driven Data-flow Synthesis
Symolic Alger d Timig Drive Dt-flow Sythesis Armit Peymdoust Giovi De Micheli Computer Systems Lortory, Stford Uiversity Stford, CA 94305 {rmit, i}@stford.edu Astrct The growig mrket of multi-medi pplictios
More informationLecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 3 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationDigital Design. Chapter 4: Datapath Components
Digitl Design Chpter 4: Dtpth Components Slides to ccompny the textbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com Copyright
More informationAddress/Data Control. Port latch. Multiplexer
4.1 I/O PORT OPERATION As discussed in chpter 1, ll four ports of the 8051 re bi-directionl. Ech port consists of ltch (Specil Function Registers P0, P1, P2, nd P3), n output driver, nd n input buffer.
More informationGeorge Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables
George Boole IT 3123 Hrdwre nd Softwre Concepts My 28 Digitl Logic The Little Mn Computer 1815 1864 British mthemticin nd philosopher Mny contriutions to mthemtics. Boolen lger: n lger over finite sets
More informationELCT 501: Digital System Design
ELCT 501: Digital System Lecture 4: CAD tools (Continued) Dr. Mohamed Abd El Ghany, Basic VHDL Concept Via an Example Problem: write VHDL code for 1-bit adder 4-bit adder 2 1-bit adder Inputs: A (1 bit)
More informationChapter 4: Datapath Components. Instructor: Dr. Hyunyoung Lee. Copyright Based on slides by Frank Vahid. Frank Vahid
Chpter 4: Dtpth Components Instructor: Dr. Hyunyoung Lee Bsed on slides by Copyright 2 Instructors of courses requiring Vhid's Digitl Design textbook (published by John Wiley nd Sons) hve permission to
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationTwo-Dimensional Motion Estimation (Part III: Advanced Techniques) Yao Wang Polytechnic University, Brooklyn, NY11201
Two-Dimesiol Motio Estimtio (Prt III: Advced Techiques) Yo Wg Polytechic Uiversity, Brookly, NY11201 yo@visio.poly.edu Yo Wg, 2002 2-D Motio Estimtio Outlie Deformble block mtchig lgorithm (DBMA) Node-bsed
More informationThe Chromatic Covering of a Graph: Ratios, Domination, Areas and Farey Sequences.
The Chromtic Coverig of Grph: Rtios Domitio res d Frey eueces. Pul ugust Witer mthemtics UKZN Durb outh fric emil: witerp@ukz.c.z bstrct The study of the chromtic umber d vertex coverigs of grphs hs opeed
More information)
Chpter Five /SOLUTIONS Since the speed ws between nd mph during this five minute period, the fuel efficienc during this period is between 5 mpg nd 8 mpg. So the fuel used during this period is between
More informationTwo-Dimensional Motion Estimation (Part II: Advanced Techniques) Yao Wang Polytechnic University, Brooklyn, NY
Two-Dimesiol Motio Estimtio (Prt II: Advced Techiques) Yo Wg Polytechic Uiversity, Brookly, NY11201 http://eeweb.poly.edu/~yo Outlie Problems with EBMA Multiresolutio motio estimtio Hierrchicl block mtchig
More informationEXPONENTIAL & POWER GRAPHS
Eponentil & Power Grphs EXPONENTIAL & POWER GRAPHS www.mthletics.com.u Eponentil EXPONENTIAL & Power & Grphs POWER GRAPHS These re grphs which result from equtions tht re not liner or qudrtic. The eponentil
More informationCPSC 213. Polymorphism. Introduction to Computer Systems. Readings for Next Two Lectures. Back to Procedure Calls
Redings for Next Two Lectures Text CPSC 213 Switch Sttements, Understnding Pointers - 2nd ed: 3.6.7, 3.10-1st ed: 3.6.6, 3.11 Introduction to Computer Systems Unit 1f Dynmic Control Flow Polymorphism nd
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationLecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationMark Redekopp, All rights reserved. EE 352 Unit 8. HW Constructs
EE 352 Unit 8 HW Constructs Logic Circuits Combinational logic Perform a specific function (mapping of 2 n input combinations to desired output combinations) No internal state or feedback Given a set of
More informationObjectives (today and tomorrow) CSE401: Lexical Analysis. Lexical analysis (scanning) Separation of lexing & parsing
Objectives (tody d tomorrow) CSE401: Lexicl Alysis Lrry Ruzzo Sprig 2004 Defie overll theory d prcticl structure of lexicl lysis Briefly recp regulr lguges, expressios, fiite stte mchies, d their reltioships
More informationMatrices and Systems of Equations
Mtrices Mtrices nd Sstems of Equtions A mtri is rectngulr rr of rel numbers. CHAT Pre-Clculus Section 8. m m m............ n n n mn We will use the double subscript nottion for ech element of the mtri.
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationIntroduction to Computer Engineering EECS 203 dickrp/eecs203/ CMOS transmission gate (TG) TG example
Introduction to Computer Engineering EECS 23 http://ziyng.eecs.northwestern.edu/ dickrp/eecs23/ CMOS trnsmission gte TG Instructor: Robert Dick Office: L477 Tech Emil: dickrp@northwestern.edu Phone: 847
More informationChapter 1: Introduction
Chpter : Introduction Slides to ccompny the textbook, First Edition, by, John Wiley nd Sons Publishers, 7. http://www.ddvhid.com Copyright 7 Instructors of courses requiring Vhid's textbook (published
More informationMicroprogrammed Control
Calcolatori Elettroici e Sistemi Operativi Microprogrammed Microprogrammed Iputs (state) Status sigals (from datapath) NS = δ(s,i) = ((S),I) O = λ(s) Next state Outputs sigals (to datapath) Microprogrammed
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationComputer Arithmetic Logical, Integer Addition & Subtraction Chapter
Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for
More informationDigital Design with FPGAs. By Neeraj Kulkarni
Digital Design with FPGAs By Neeraj Kulkarni Some Basic Electronics Basic Elements: Gates: And, Or, Nor, Nand, Xor.. Memory elements: Flip Flops, Registers.. Techniques to design a circuit using basic
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationEngineer To Engineer Note
Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More informationOptimization of a precise integration method for seismic modeling based on graphic processing unit
Erthq Sci ()3: 387 393 387 Doi:.7/s589--736- Optimiztio of precise itegrtio method for seismic modelig bsed o grphic processig uit Jigyu Li Geyg Tg d Tiyue Hu, School of Erth d Spce Scieces, Pekig Uiversity,
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationIntroduction to Computing Systems: From Bits and Gates to C and Beyond 2 nd Edition
Lecture Goals Itroductio to Computig Systems: From Bits ad Gates to C ad Beyod 2 d Editio Yale N. Patt Sajay J. Patel Origial slides from Gregory Byrd, North Carolia State Uiversity Modified slides by
More informationL6: FSMs and Synchronization
L6: FSMs ad Sychroizatio Ackowledgemets: Materials i this lecture are courtesy of the followig sources ad are used with permissio. Rex Mi J. Rabaey, A. Chadrakasa, B. Nikolic. igital Itegrated Circuits:
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationModeling Reusable Concurrent Passive Entity Objects in Colored Petri Nets
Modelig Reusble Cocurret Pssive Etity Objects i Colored Petri Nets Rowld Pitts d Hss Gom George Mso Uiversity, Firfx, Virgii, USA {rpitts,hgom}@gmu.edu Abstrct. Cocurret softwre systems re growig icresigly
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationIntroduction CHAPTER Computers
Iside a Computer CHAPTER Itroductio. Computers A computer is a electroic device that accepts iput, stores data, processes data accordig to a set of istructios (called program), ad produces output i desired
More informationEE 435. Lecture 26. Data Converters. Architectures. Characterization
EE 435 Lecture 26 Data Coverters Architectures Characterizatio . Review from last lecture. Data Coverters Types: A/D (Aalog to Digital) Coverts Aalog Iput to a Digital Output D/A (Digital to Aalog) Coverts
More information1 Wire TM Digital Thermometer
DS1820 1 Wire TM Digital Thermometer FEATURES Unique 1 Wire TM interface requires only one port pin for communication Multidrop capability simplifies distributed temperature sensing applications Requires
More informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationSwitch Construction CS
Switch Costructio CS 00 Workstatio-Based Aggregate badwidth /2 of the I/O bus badwidth capacity shared amog all hosts coected to switch example: Gbps bus ca support 5 x 00Mbps ports (i theory) I/O bus
More informationA Variant of Pascal s Triangle Dennis Van Hise Stetson University
A Vrit of Pscl s Trigle eis V Hise tetso Uiversity I. Itroductio d Nottio It is the purpose of this pper to explore vrit of Pscl s trigle. This vrit hs the rule tht every etry, deoted s,, where,, is clculted
More informationLecture 11: PI/T parallel I/O, part I
Lecture 11: PI/T parallel I/O, part I Geeral descriptio of the parallel I/O fuctio Bufferi Hadshaki Iput ad Output trasfers Timi Diarams Reister model of the 68230 Port Geeral Cotrol Reister (PGCR) Port
More informationIntroduction to Wireless & Mobile Systems. Chapter 6. Multiple Radio Access Cengage Learning Engineering. All Rights Reserved.
Itroductio to Wireless & Mobile Systems Chapter 6 Multiple Radio Access 1 Outlie Itroductio Multiple Radio Access Protocols Cotetio-based Protocols Pure ALOHA Slotted ALOHA CSMA (Carrier Sese Multiple
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationInjntu.com Injntu.com Injntu.com R16
1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder
More informationOn Some Iterative Methods for Solving Systems of Linear Equations
Computtiol d Applied Mthemtics Jourl 205; (2: 2-28 Published olie Februry 20, 205 (http://www.scit.org/jourl/cmj O Some Itertive Methods for Solvig Systems of Lier Equtios Fdugb Sudy Emmuel Deprtmet of
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationFundamentals of. Chapter 1. Microprocessor and Microcontroller. Dr. Farid Farahmand. Updated: Tuesday, January 16, 2018
Fudametals of Chapter 1 Microprocessor ad Microcotroller Dr. Farid Farahmad Updated: Tuesday, Jauary 16, 2018 Evolutio First came trasistors Itegrated circuits SSI (Small-Scale Itegratio) to ULSI Very
More information