2D Critical path = 6. Retiming moving delays. Retiming - Pipelining. Delays can be moved from ALL inputs to ALL outputs
|
|
- Cassandra Caldwell
- 5 years ago
- Views:
Transcription
1 SP esgn SP esgn Retmng movng delays Retmng elays can be moved from LL nputs to LL outputs Reduce Crtcal Path faster reduced power consumpton Reduced number of Regster Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Retmng - Ppelnng Generalzaton of Ppelnng Ppelnng s equvalent to ntroducng delays at the nput followed by retmng Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Retmng () Retmng does not change delay n loop the teraton bound () () Crtcal path 6 Loop bound 6/ Crtcal path Loop bound 6/...but the crtcal path! Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
2 SP esgn x(n) a b t Retmng y(n) () () Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn t Retmng : set of edges that f removed, or cut, results n two dsjont graphs. () Retmng dd delays to edges () gong one way and remove from ones gong the other. Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn t Retmng Retmng: dd delays to edges gong g one way and remove from edges gong the other. () () () () crt +6 # crt ++8 #5 Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Node Retmng Node Retmng: around one node. () () () () crt +6 # crt + #5 Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
3 SP esgn Retmng Formulaton ω(e) weght of edge # of delays r(x) retmng values r(u) U U ω(e) ω r (e) V V ω r (e) ω(e) + r(v) - r(u) r(v) Vald retmng f all ω r (e) > Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Retmng Formulaton () G hg G Graph G Graph G Each node n G has retmng value j and each node n G has retmng value j+k ny value j results n the same retmed graph. Vald retmng f all ω r (e) > Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Node Retmng wth Formulaton Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- G SP esgn Node Retmng wth Formulaton G Orgnal weghts Choose retmng values G r()r()r ( ) ( ) G r() Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
4 SP esgn Node Retmng wth Formulaton () Orgnal weghts Retmng values r(), r(), r() and r ω r (e) ω(e) ) + r(v) -r(u) Receve Send Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Node Retmng wth Formulaton () Retmed weghts lgorthm for clock perod n mnmzaton n.. Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Ppelnng Feedforward Ppelnng s a specal case of cutset retmng: Placng delays at feedforward cutsets. x(n) h h h Feedforward cutset h y(n) Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Replace each by k Slow own by k () () Clock fter -slow transformaton () () clk t.u. ter t.u. Clock t.u. Input new samples every alternate cycles. null operatons account for odd clock cycles. Hardware utlzed only 5% tme clk t.u. ter t.u. t u Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
5 SP esgn () y( n) x( n) + a y( n ) () Example y( n) x( n) + a y( n ) 5 Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Retmng -slow Graph () () clk t.u. ter tu t.u. tu t.u. Hardware Utlzaton 5 % Hardware can be fully utlzed f two ndependent operatons are avalable. clk t.u. ter tu t.u. Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Retmng -stage Lattce Flter SP esgn Retmng Loop ounds -stage Lattce Flter Crtcal Path L L L Crtcal Path (N+) dders + Mult N Number of Stages Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- dd + Mult 5 dd + Mult L L 5 dd + Mult L Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
6 SP esgn Retmng Iteraton ound -stage Lattce Flter SP esgn t Retmng -stage Lattce Flter {,,, } max L L L dd + Mult Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Retmng -stage Lattce Flter Crtcal Path dders + Mult Independent of N nr. of stages n flter compared to Orgnal Crtcal Path (N+) dders + Mult SP esgn t Retmng -stage Lattce Flter Move every second delay Worse for Low N. rade-off depends on M and Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- Crtcal Path dders + Mult Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
7 SP esgn t Retmng 5-stage Lattce Flter SP esgn Retmng wth Slowdown -stage Lattce Flter Crtcal Path Crtcal Path dders +Mult Crtcal Path (N+) dders + Mult N Number of Stages Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Slowdown by factor SP esgn Slowdown of -stage Lattce Flter () Crtcal Path s Crtcal Path has not changed. Same f clk. Inserton of samples to preserve behavor! x x x x x x x x... or x x x x... Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- dd delays on Edges n one drecton and remove n the other Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
8 SP esgn SP esgn Slowdown of -stage Lattce Flter Regster Mnmzaton Crtcal Path Crtcal Path dders + Mult y y y y 7 y y ut requres twce the number of clock cycles Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- lgorthm for regster mnmzaton n.. Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- SP esgn Old Odexample: pe ata-flow Graph (FG) x(n) One s the same SP esgn Pacemaker revsted h h h + + y(n) x(n) h h h + () y(n) Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
9 SP esgn Wavelet Flterbank SP esgn Wavelet Flterbank F ( z) + z + z + z G ( ) b z + z Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden- Vktor Öwall, ept. of Electrcal and Informaton echnology, Lund Unversty, Sweden-
DSP Design Lecture 5. Dr. Fredrik Edman.
SP esign SP esign Lecture 5 Retiming r. Fredrik Edman fredrik.edman@eit.lth.se Fredrik Edman, ept. of Electrical and Information Technology, Lund University, Sweden-www.eit.lth.se SP esign Repetition Critical
More informationDSP Design Lecture 7. Unfolding cont. & Folding. Dr. Fredrik Edman.
SP esign Lecture 7 Unfolding cont. & Folding r. Fredrik Edman fredrik.edman@eit.lth.se Unfolding Unfolding creates a program with more than one iteration, J=unfolding factor Unfolding is a structured way
More informationSignal Flow Graphs. Roger Woods Programmable Systems Lab ECIT, Queen s University Belfast
Signal Flow Graphs Roger Woods r.woods@qub.ac.uk Programmable Systems Lab ECIT, Queen s University Belfast (Slides 2-13 taken from Signal Flow Graphs and Data Flow Graphs chapter by Keshab K. Parhi and
More informationVLSI Signal Processing
VLSI Signal Processing Lecture 1 Pipelining & Retiming ADSP Lecture1 - Pipelining & Retiming (cwliu@twins.ee.nctu.edu.tw) 1-1 Introduction DSP System Real time requirement Data driven synchronized by data
More informationPipelining and Parallel Processing
Pipelining and Parallel Processing Pipelining ---reduction in the critical path increase the clock speed, or reduce power consumption at same speed Parallel Processing ---multiple outputs are computed
More informationRetiming. delay elements in a circuit without affecting the input/output characteristics of the circuit.
Chapter Retiming NCU EE -- SP VLSI esign. Chap. Tsung-Han Tsai 1 Retiming & A transformation techniques used to change the locations of delay elements in a circuit without affecting the input/output characteristics
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationVLSI Design I; A. Milenkovic 1
ourse dmnstraton PE/EE 47, PE 57 VLI esgn I L8: Pass Transstor Logc epartment of Electrcal and omputer Engneerng Unversty of labama n Huntsvlle leksandar Mlenkovc ( www. ece.uah.edu/~mlenka ) www. ece.uah.edu/~mlenka/cpe57-
More informationCompiling for Parallelism & Locality. Example. Announcement Need to make up November 14th lecture. Last time Data dependences and loops
Complng for Parallelsm & Localty Announcement Need to make up November 14th lecture Last tme Data dependences and loops Today Fnsh data dependence analyss for loops CS553 Lecture Complng for Parallelsm
More informationNON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS
NON-LINEAR CONVOLUTION: A NEW APPROAC FOR TE AURALIZATION OF DISTORTING SYSTEMS Angelo Farna, Alberto Belln and Enrco Armellon Industral Engneerng Dept., Unversty of Parma, Va delle Scenze 8/A Parma, 00
More informationSolution (1) Formulate the problem as a LP model.
Benha Unversty Department: Mechancal Engneerng Benha Hgh Insttute of Technology Tme: 3 hr. January 0 -Fall semester 4 th year Eam(Regular) Soluton Subject: Industral Engneerng M4 ------------------------------------------------------------------------------------------------------.
More informationMath Review. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
Math Revew CptS 223 dvanced Data Structures Larry Holder School of Electrcal Engneerng and Computer Scence Washngton State Unversty 1 Why do we need math n a data structures course? nalyzng data structures
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationMultiline Overview. Karl Bois, PhD Lead SI Engineer Servers & Blades. December 5th, 2016
Multlne Overvew Karl Bos, PhD Lead SI Engneer Servers & Blades December 5th, 216 Why are we here? Orgnal Equpment Manufacturers (OEMs) and Orgnal Desgn Manufacturers (ODMs) have desgns that requre that
More informationEffective Power Optimization combining Placement, Sizing, and Multi-Vt techniques
Effectve Power Optmzaton combnng Placement, Szng, and Mult-Vt technques Tao Luo, Davd Newmark*, and Davd Z Pan Department of Electrcal and Computer Engneerng, Unversty of Texas at Austn *Advanced Mcro
More informationMAE140 - Linear Circuits - Winter 16 Final, March 16, 2016
ME140 - Lnear rcuts - Wnter 16 Fnal, March 16, 2016 Instructons () The exam s open book. You may use your class notes and textbook. You may use a hand calculator wth no communcaton capabltes. () You have
More informationHierarchical State Estimation Using Phasor Measurement Units
Herarchcal State Estmaton Usng Phasor Measurement Unts Al Abur Northeastern Unversty Benny Zhao (CA-ISO) and Yeo-Jun Yoon (KPX) IEEE PES GM, Calgary, Canada State Estmaton Workng Group Meetng July 28,
More informationHigh-Speed Low-Complexity Reed-Solomon Decoder using Pipelined Berlekamp-Massey Algorithm and Its Folded Architecture
JOURNAL OF SEMICONUCTOR TECHNOLOGY AN SCIENCE, VOL., NO.3, SEPTEMBER, 2 93 Hgh-Speed Low-Complexty Reed-Solomon ecoder usng Ppelned Berlekamp-Massey Algorthm and Its Folded Archtecture Jeong-In Park, Khoon
More informationIntroduction to Simulation - Lecture 5. QR Factorization. Jacob White. Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy
Introducton to Smulaton - Lecture 5 QR Factorzaton Jacob Whte hanks to Deepak Ramaswamy, Mchal Rewensk, and Karen Veroy Sngular Example LU Factorzaton Fals Strut Jont Load force he resultng nodal matrx
More informationCS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang
CS DESIGN ND NLYSIS OF LGORITHMS DYNMIC PROGRMMING Dr. Dasy Tang Dynamc Programmng Idea: Problems can be dvded nto stages Soluton s a sequence o decsons and the decson at the current stage s based on the
More informationDO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED.
EE 539 Homeworks Sprng 08 Updated: Tuesday, Aprl 7, 08 DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED. For full credt, show all work. Some problems requre hand calculatons.
More informationCIE4801 Transportation and spatial modelling Trip distribution
CIE4801 ransportaton and spatal modellng rp dstrbuton Rob van Nes, ransport & Plannng 17/4/13 Delft Unversty of echnology Challenge the future Content What s t about hree methods Wth specal attenton for
More information6.842 Randomness and Computation February 18, Lecture 4
6.842 Randomness and Computaton February 18, 2014 Lecture 4 Lecturer: Rontt Rubnfeld Scrbe: Amartya Shankha Bswas Topcs 2-Pont Samplng Interactve Proofs Publc cons vs Prvate cons 1 Two Pont Samplng 1.1
More informationMechanics Physics 151
Mechancs Physcs 5 Lecture 7 Specal Relatvty (Chapter 7) What We Dd Last Tme Worked on relatvstc knematcs Essental tool for epermental physcs Basc technques are easy: Defne all 4 vectors Calculate c-o-m
More informationMulti-dimensional Central Limit Argument
Mult-dmensonal Central Lmt Argument Outlne t as Consder d random proceses t, t,. Defne the sum process t t t t () t (); t () t are d to (), t () t 0 () t tme () t () t t t As, ( t) becomes a Gaussan random
More informationDynamic Programming. Lecture 13 (5/31/2017)
Dynamc Programmng Lecture 13 (5/31/2017) - A Forest Thnnng Example - Projected yeld (m3/ha) at age 20 as functon of acton taken at age 10 Age 10 Begnnng Volume Resdual Ten-year Volume volume thnned volume
More informationJoint Energy Management and Resource Allocation in Rechargable Sensor Networks
Jont Energy Management and Resource Allocaton n Rechargable Sensor Networks Ren-Shou Lu, Prasun Snha and C. Emre Koksal Department of CSE and ECE The Oho State Unversty Envronmental Energy Harvestng Many
More informationCSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationNeural networks. Nuno Vasconcelos ECE Department, UCSD
Neural networs Nuno Vasconcelos ECE Department, UCSD Classfcaton a classfcaton problem has two types of varables e.g. X - vector of observatons (features) n the world Y - state (class) of the world x X
More informationThe Problem: Mapping programs to architectures
Complng for Parallelsm & Localty!Last tme! SSA and ts uses!today! Parallelsm and localty! Data dependences and loops CS553 Lecture Complng for Parallelsm & Localty 1 The Problem: Mappng programs to archtectures
More informationCommon loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:
15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before
More informationLecture 3: Dual problems and Kernels
Lecture 3: Dual problems and Kernels C4B Machne Learnng Hlary 211 A. Zsserman Prmal and dual forms Lnear separablty revsted Feature mappng Kernels for SVMs Kernel trck requrements radal bass functons SVM
More informationFPGA Implementation of Pipelined CORDIC Sine Cosine Digital Wave Generator
FPGA Implementaton of Ppelned CORDIC Sne Cosne Dgtal Wave Generator Navdeep Prashar 1 and Balwnder Sngh 1- Acadmc and Consultancy Servces Dvson, Centre for Development of Advanced Computng(C-DAC, Mohal,
More informationMultilayer Perceptrons and Backpropagation. Perceptrons. Recap: Perceptrons. Informatics 1 CG: Lecture 6. Mirella Lapata
Multlayer Perceptrons and Informatcs CG: Lecture 6 Mrella Lapata School of Informatcs Unversty of Ednburgh mlap@nf.ed.ac.uk Readng: Kevn Gurney s Introducton to Neural Networks, Chapters 5 6.5 January,
More informationPipelining and Parallel Processing
Pipelining and Parallel Processing ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 010 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationCommunication with AWGN Interference
Communcaton wth AWG Interference m {m } {p(m } Modulator s {s } r=s+n Recever ˆm AWG n m s a dscrete random varable(rv whch takes m wth probablty p(m. Modulator maps each m nto a waveform sgnal s m=m
More informationKernels in Support Vector Machines. Based on lectures of Martin Law, University of Michigan
Kernels n Support Vector Machnes Based on lectures of Martn Law, Unversty of Mchgan Non Lnear separable problems AND OR NOT() The XOR problem cannot be solved wth a perceptron. XOR Per Lug Martell - Systems
More information( ) = ( ) + ( 0) ) ( )
EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationA random variable is a function which associates a real number to each element of the sample space
Introducton to Random Varables Defnton of random varable Defnton of of random varable Dscrete and contnuous random varable Probablty blt functon Dstrbuton functon Densty functon Sometmes, t s not enough
More informationTwo-level Parallel Computation for Approximate Inverse with AISM Method
Vol 49 No 6 2164 2168 (June 2008) AISM 2 1 2 3 2 AISM SGI Orgn 2400 MPI PE16 PE 13672 Two-level Parallel Computaton for Approxmate Inverse wth AISM Method Lnje Zhang, 1 Kentaro Morya 2 and Takash Nodera
More informationPlanning and Scheduling to Minimize Makespan & Tardiness. John Hooker Carnegie Mellon University September 2006
Plannng and Schedulng to Mnmze Makespan & ardness John Hooker Carnege Mellon Unversty September 2006 he Problem Gven a set of tasks, each wth a deadlne 2 he Problem Gven a set of tasks, each wth a deadlne
More informationEE 2006 Electric Circuit Analysis Fall September 04, 2014 Lecture 02
EE 2006 Electrc Crcut Analyss Fall 2014 September 04, 2014 Lecture 02 1 For Your Informaton Course Webpage http://www.d.umn.edu/~jngba/electrc_crcut_analyss_(ee_2006).html You can fnd on the webpage: Lecture:
More informationEN40: Dynamics and Vibrations. Homework 4: Work, Energy and Linear Momentum Due Friday March 1 st
EN40: Dynamcs and bratons Homework 4: Work, Energy and Lnear Momentum Due Frday March 1 st School of Engneerng Brown Unversty 1. The fgure (from ths publcaton) shows the energy per unt area requred to
More informationClock Synchronization with Bounded Global and Local Skew
Clock Synchronization with ounded Global and Local Skew Distributed Computing Christoph Lenzen, ETH Zurich Thomas Locher, ETH Zurich Roger Wattenhofer, ETH Zurich October 2008 Motivation: No Global Clock
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More informationDigital Modems. Lecture 2
Dgtal Modems Lecture Revew We have shown that both Bayes and eyman/pearson crtera are based on the Lkelhood Rato Test (LRT) Λ ( r ) < > η Λ r s called observaton transformaton or suffcent statstc The crtera
More informationEstimating Delays. Gate Delay Model. Gate Delay. Effort Delay. Computing Logical Effort. Logical Effort
Estmatng Delas Would be nce to have a back of the envelope method for szng gates for speed Logcal Effort ook b Sutherland, Sproull, Harrs Chapter s on our web page Gate Dela Model Frst, normalze a model
More informationIV. Performance Optimization
IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationWeek-5. Sequential Circuit Design. Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA.
Week-5 Sequential Circuit Design Acknowledgement: Most of the following slides are adapted from Prof. Kale's slides at UIUC, USA. Storing a value: SR = 00 What if S = 0 and R = 0? The equations on the
More informationFTCS Solution to the Heat Equation
FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use
More information2 Laminar Structure of Cortex. 4 Area Structure of Cortex
Networks!! Lamnar Structure of Cortex. Bology: The cortex. Exctaton: Undrectonal (transformatons) Local vs. dstrbuted representatons Bdrectonal (pattern completon, amplfcaton). Inhbton: Controllng bdrectonal
More informationA capacitor is simply two pieces of metal near each other, separated by an insulator or air. A capacitor is used to store charge and energy.
-1 apactors A capactor s smply two peces of metal near each other, separate by an nsulator or ar. A capactor s use to store charge an energy. A parallel-plate capactor conssts of two parallel plates separate
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More informationA High-Performance and Energy-Efficient FIR Adaptive Filter using Approximate Distributed Arithmetic Circuits
SUBMITTED FOR REVIEW 1 A Hgh-Performance and Energy-Effcent FIR Adaptve Flter usng Approxmate Dstrbuted Arthmetc Crcuts Honglan Jang, Lebo Lu, Peter Jonker, Duncan Ellott, Fabrzo Lombard, Fellow, IEEE
More informationEfficient many-party controlled teleportation of multi-qubit quantum information via entanglement
Effcent many-party controlled teleportaton of mult-qut quantum nformaton va entanglement Chu-Png Yang, Shh-I Chu, Syuan Han Physcal Revew A, 24 Presentng: Vctora Tchoudakov Motvaton Teleportaton va the
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2019 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons Our goal to derve the form of the abstract quanttes n rate equatons, such as synaptc
More informationPolymer Chains. Ju Li. GEM4 Summer School 2006 Cell and Molecular Mechanics in BioMedicine August 7 18, 2006, MIT, Cambridge, MA, USA
Polymer Chans Ju L GEM4 Summer School 006 Cell and Molecular Mechancs n BoMedcne August 7 18, 006, MIT, Cambrdge, MA, USA Outlne Freely Jonted Chan Worm-Lke Chan Persstence Length Freely Jonted Chan (FJC)
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
More informationNonlinear Classifiers II
Nonlnear Classfers II Nonlnear Classfers: Introducton Classfers Supervsed Classfers Lnear Classfers Perceptron Least Squares Methods Lnear Support Vector Machne Nonlnear Classfers Part I: Mult Layer Neural
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More information8 Derivation of Network Rate Equations from Single- Cell Conductance Equations
Physcs 178/278 - Davd Klenfeld - Wnter 2015 8 Dervaton of Network Rate Equatons from Sngle- Cell Conductance Equatons We consder a network of many neurons, each of whch obeys a set of conductancebased,
More informationME 501A Seminar in Engineering Analysis Page 1
umercal Solutons of oundary-value Problems n Os ovember 7, 7 umercal Solutons of oundary- Value Problems n Os Larry aretto Mechancal ngneerng 5 Semnar n ngneerng nalyss ovember 7, 7 Outlne Revew stff equaton
More informationAdiabatic Sorption of Ammonia-Water System and Depicting in p-t-x Diagram
Adabatc Sorpton of Ammona-Water System and Depctng n p-t-x Dagram J. POSPISIL, Z. SKALA Faculty of Mechancal Engneerng Brno Unversty of Technology Techncka 2, Brno 61669 CZECH REPUBLIC Abstract: - Absorpton
More informationArtificial Intelligence Bayesian Networks
Artfcal Intellgence Bayesan Networks Adapted from sldes by Tm Fnn and Mare desjardns. Some materal borrowed from Lse Getoor. 1 Outlne Bayesan networks Network structure Condtonal probablty tables Condtonal
More informationTokyo Institute of Technology Periodic Sequencing Control over Multi Communication Channels with Packet Losses
oyo Insttute of echnology Fujta Laboratory oyo Insttute of echnology erodc Sequencng Control over Mult Communcaton Channels wth acet Losses FL6-7- /8/6 zwrman Gusrald oyo Insttute of echnology Fujta Laboratory
More informationIntroduction to Random Variables
Introducton to Random Varables Defnton of random varable Defnton of random varable Dscrete and contnuous random varable Probablty functon Dstrbuton functon Densty functon Sometmes, t s not enough to descrbe
More informationCS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015
CS 3710: Vsual Recognton Classfcaton and Detecton Adrana Kovashka Department of Computer Scence January 13, 2015 Plan for Today Vsual recognton bascs part 2: Classfcaton and detecton Adrana s research
More informationSpring Force and Power
Lecture 13 Chapter 9 Sprng Force and Power Yeah, energy s better than orces. What s net? Course webste: http://aculty.uml.edu/andry_danylov/teachng/physcsi IN THIS CHAPTER, you wll learn how to solve problems
More informationChaper 4: Retiming (Tái định thì) GV: Hoàng Trang
ĐẠI HỌC QUỐC GIA TP.HỒ CHÍ MINH TRƯỜNG ĐẠI HỌC BÁCH KHOA KHOA ĐIỆN-ĐIỆN TỬ BỘ MÔN KỸ THUẬT ĐIỆN TỬ XỬ LÝ TÍN HiỆU SỐ VỚI FPGA Chaper 4: Retiming (Tái định thì) GV: Hoàng Trang Email: hoangtrang@hcmut.edu.vn
More information(b) i(t) for t 0. (c) υ 1 (t) and υ 2 (t) for t 0. Solution: υ 2 (0 ) = I 0 R 1 = = 10 V. υ 1 (0 ) = 0. (Given).
Problem 5.37 Pror to t =, capactor C 1 n the crcut of Fg. P5.37 was uncharged. For I = 5 ma, R 1 = 2 kω, = 5 kω, C 1 = 3 µf, and C 2 = 6 µf, determne: (a) The equvalent crcut nvolvng the capactors for
More informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationExternalities in wireless communication: A public goods solution approach to power allocation. by Shrutivandana Sharma
Externaltes n wreless communcaton: A publc goods soluton approach to power allocaton by Shrutvandana Sharma SI 786 Tuesday, Feb 2, 2006 Outlne Externaltes: Introducton Plannng wth externaltes Power allocaton:
More informationAdaptive RFID Indoor Positioning Technology for Wheelchair Home Health Care Robot. T. C. Kuo
Adaptve RFID Indoor Postonng Technology for Wheelchar Home Health Care Robot Contents Abstract Introducton RFID Indoor Postonng Method Fuzzy Neural Netor System Expermental Result Concluson -- Abstract
More informationInteger Multipliers 1
Integer Multipliers Multipliers must have circuit in most DS applications variety of multipliers exists that can be chosen based on their performance Serial, Serial/arallel,Shift and dd, rray, ooth, Wallace
More informationInterconnect Optimization for Deep-Submicron and Giga-Hertz ICs
Interconnect Optmzaton for Deep-Submcron and Gga-Hertz ICs Le He http://cadlab.cs.ucla.edu/~hele UCLA Computer Scence Department Los Angeles, CA 90095 Outlne Background and overvew LR-based STIS optmzaton
More informationHere is the rationale: If X and y have a strong positive relationship to one another, then ( x x) will tend to be positive when ( y y)
Secton 1.5 Correlaton In the prevous sectons, we looked at regresson and the value r was a measurement of how much of the varaton n y can be attrbuted to the lnear relatonshp between y and x. In ths secton,
More information10. Canonical Transformations Michael Fowler
10. Canoncal Transformatons Mchael Fowler Pont Transformatons It s clear that Lagrange s equatons are correct for any reasonable choce of parameters labelng the system confguraton. Let s call our frst
More informationSequential Logic Design
221: igital esign http://jatinga.iitg.ernet.in/~asahu/cs221 equential Logic esign (FF& egister) A. ahu ept of omp. c. & ngg. ndian nstitute of echnology Guwahati Outline FF: haracterization able and quation,,
More informationEE 2006 Electric Circuit Analysis Spring January 23, 2015 Lecture 02
EE 2006 Electrc Crcut Analyss Sprng 2015 January 23, 2015 Lecture 02 1 Lab 1 Dgtal Multmeter Lab nstructons Aalable onlne Prnt out and read before Lab MWAH 391, 4:00 7:00 pm, next Monday or Wednesday (January
More informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationProfessor Fearing EECS150/Problem Set Solution Fall 2013 Due at 10 am, Thu. Oct. 3 (homework box under stairs)
Professor Fearing EECS50/Problem Set Solution Fall 203 Due at 0 am, Thu. Oct. 3 (homework box under stairs). (25 pts) List Processor Timing. The list processor as discussed in lecture is described in RT
More informationEncoder and Decoder Optimization for Source-Channel Prediction in Error Resilient Video Transmission
Encoer an Decoer Optmzaton for Source-Channel Precton n Error Reslent Veo Transmsson Hua Yang an Kenneth Rose Sgnal Compresson Lab ECE Department Unversty of Calforna Santa Barbara, USA Outlne Backgroun
More informationCoarse-Grain MTCMOS Sleep
Coarse-Gran MTCMOS Sleep Transstor Szng Usng Delay Budgetng Ehsan Pakbazna and Massoud Pedram Unversty of Southern Calforna Dept. of Electrcal Engneerng DATE-08 Munch, Germany Leakage n CMOS Technology
More information= 1.23 m/s 2 [W] Required: t. Solution:!t = = 17 m/s [W]! m/s [W] (two extra digits carried) = 2.1 m/s [W]
Secton 1.3: Acceleraton Tutoral 1 Practce, page 24 1. Gven: 0 m/s; 15.0 m/s [S]; t 12.5 s Requred: Analyss: a av v t v f v t a v av f v t 15.0 m/s [S] 0 m/s 12.5 s 15.0 m/s [S] 12.5 s 1.20 m/s 2 [S] Statement:
More informationSVMs: Duality and Kernel Trick. SVMs as quadratic programs
11/17/9 SVMs: Dualt and Kernel rck Machne Learnng - 161 Geoff Gordon MroslavDudík [[[partl ased on sldes of Zv-Bar Joseph] http://.cs.cmu.edu/~ggordon/161/ Novemer 18 9 SVMs as quadratc programs o optmzaton
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationBOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu
BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com
More informationτ rf = Iα I point = mr 2 L35 F 11/14/14 a*er lecture 1
A mass s attached to a long, massless rod. The mass s close to one end of the rod. Is t easer to balance the rod on end wth the mass near the top or near the bottom? Hnt: Small α means sluggsh behavor
More information8. Design Tradeoffs x Computation Structures Part 1 Digital Circuits. Copyright 2015 MIT EECS
8. Design Tradeoffs 6.004x Computation Structures Part 1 Digital Circuits Copyright 2015 MIT EECS 6.004 Computation Structures L08: Design Tradeoffs, Slide #1 There are a large number of implementations
More informationTHE EFFECT OF TORSIONAL RIGIDITY BETWEEN ELEMENTS ON FREE VIBRATIONS OF A TELESCOPIC HYDRAULIC CYLINDER SUBJECTED TO EULER S LOAD
Journal of Appled Mathematcs and Computatonal Mechancs 7, 6(3), 7- www.amcm.pcz.pl p-issn 99-9965 DOI:.75/jamcm.7.3. e-issn 353-588 THE EFFECT OF TORSIONAL RIGIDITY BETWEEN ELEMENTS ON FREE VIBRATIONS
More informationElectrical Engineering Department Network Lab.
Electrcal Engneerng Department Network Lab. Objecte: - Experment on -port Network: Negate Impedance Conerter To fnd the frequency response of a smple Negate Impedance Conerter Theory: Negate Impedance
More information8. Design Tradeoffs x Computation Structures Part 1 Digital Circuits. Copyright 2015 MIT EECS
8. Design Tradeoffs 6.004x Computation Structures Part 1 Digital Circuits Copyright 2015 MIT EECS 6.004 Computation Structures L08: Design Tradeoffs, Slide #1 There are a large number of implementations
More informationPhysics 114 Exam 2 Fall 2014 Solutions. Name:
Physcs 114 Exam Fall 014 Name: For gradng purposes (do not wrte here): Queston 1. 1... 3. 3. Problem Answer each of the followng questons. Ponts for each queston are ndcated n red. Unless otherwse ndcated,
More information