Discrete Event Simulation & VHDL. Prof. K. J. Hintz Dept. of Electrical and Computer Engineering George Mason University
|
|
- Lesley White
- 5 years ago
- Views:
Transcription
1 Discrete Event Simulation & VHDL Prof. K. J. Hintz Dept. of Electrical and Computer Engineering George Mason University
2 Discrete Event Simulation Material from VHDL Programming with Advanced Topics by Louis Baker, Wiley, /8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 2
3 DES & VHDL VHDL is a special case of DES Not continuous differential equation Not finite difference equation DES is discontinuous in time Microprocessor/microcontroller Finite State Machine Language Recognizer Clocked/synchronous devices in general 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 3
4 DES Properties Restricts Allowed Values of Signals Restricts Transitions to the Result of Events, i.e., It Is Causal 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 4
5 Why discuss DES? Understanding Leads to Better and More Efficient Use of Simulation Queuing of Transactions May Not Reflect Reality Due to Inertial or Transport Delay Not All Simulations Will Be Deterministic Interrupts Instruction Mix Intermediate values causing branching 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 5
6 Two Approaches to DES Event Scheduling Simulation proceeds from event to event VHDL Process Interaction Follows customer through system Suitable for queuing systems SIMULA language 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 6
7 Queues Events Ordered in Time Many Deletions of Events From Queue May Be Expected Due to the Default Inertial Delay 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 7
8 Queues Each Driver Must Maintain Projected Waveform Time and value of most recent event (s'last_event) Next scheduled transaction When event occurs, value before event must be saved (s'last_value) Event time (s'last_active) 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 8
9 Queues History of Signals Is NOT Maintained by Simulation Even Though Saved in History File Access is only available implicitly 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 9
10 Efficient Simulation Finite Propagation Delay Vice Delta Delay Finite delay more accurately deflects world, but requires simulation to check each different delay time, therefore slow A δ-delay only needs to resolve signals after one δ-delay, therefore faster If all components had same delay, then no difference 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 10
11 Efficient Simulation Limit Use of INOUT Ports Use Only When Essential Usage Limits Error Checking Associated With Port Modes Simulation Must Resolve Direction 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 11
12 Efficient Simulation Limit Use of Generics Generic statements require global storage Minimize Feedback The More Layers of Feedback There Are, the More Simulations Are Needed to Resolve the Output at Its Next State 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 12
13 Internal Event Queues Necessary to Simulate Interaction With Outside World Signals Cannot Be Used Because They Can't Represent External Events Put on a Queue VHDL Allows Coding Your Own Event Queues 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 13
14 Simulation Determinism Deterministic Microprocessor with no interrupt doing welldefined task, e.g., boot-up sequence, MSDOS start for x86 All inputs to a combinational circuit 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 14
15 Stochastic Simulation More Common Economic Simulation Truly random #: derived from physical process Pseudo-random: U ( 0,1 ) Generators uniform, zero mean, unit variance All other generators can be computed from this 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 15
16 Stochastic Simulation Random Variables Empirical: fit to data Component failure, Weibull No justification, however fits data and easy to manipulate Function of known distribution Central limit theorem, summation of large number of RV approaches Gaussian Maximum of a number of RV's: Gumbel Distribution 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 16
17 Stochastic Simulation Variance Reduction Techniques The greater the variance in results, the less certain we are of their validity. There is a square root of N improvement in variance with N, but not very efficient 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 17
18 Stochastic Simulation Correlated Sampling Vary design, but use same pseudo-random sequence of inputs If 2 designs are equally effective, then the simulation results should be very similar 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 18
19 Stochastic Simulation Correlated Sampling Suppose Independent RVs are used to compare 2 designs and P 1 and P 2 are performance measures then a figure of merit, D= P 1 - P 2 has variance σ If σ D not independent, 2 D = σ = σ P 1 2 P 1 + σ + σ ( P, P ) That is, the more similar the RVs are, the smaller is σ d P P cov 1 2 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 19
20 Stochastic Simulation Antithetic Variables Simulate using U s (0,1) RV and save value Generate new sequence based on old by 1-U 1, 1-U 2, etc. If U s were particularly good sequences then you might expect 1-U s to be particularly bad sequences 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 20
21 Stochastic Simulation Stratified Sampling Subdivide sample space into groups with minimum variance, e.g, computer instruction set distribution associated with business applications distribution associated with scientific applications 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 21
22 Stochastic Simulation Importance Sampling Devote more simulation runs to the sets of inputs which have greater variance Assures that enough "rare" events occur to make sound statistical inferences 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 22
23 Stochastic Simulation Sequential Analysis Adaptively modify sampling sequence, e.g., simulation fails when one bit is set so only test all variations with that bit set 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 23
24 Stochastic Simulation Initialization May take long time for startup transients to converge to steady state behavior Analyze transient behavior separately Initialize near steady state values for subsequent analysis 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 24
25 System Stressing Often interested in degradation characteristics under increasing load Catastrophic failures Graceful degradation Disable certain services to simulate their being fully occupied and not available 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 25
26 Simulation Validation Run simple cases for which results are known or calculable and compare results Perturb parameters to perform sensitivity analysis Fisher's Law: The more optimized a system is for one environment, the worse it will do in another Monte-Carlo: large # of runs, average results 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 26
27 Concurrent Simulation Optimistic Run parts concurrently but only check interaction at large time intervals. If an event occurred, backtrack Conservative Each parallel process proceeds no further than it can without the possibility of backtracking 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 27
28 VHDL Implementation of FSMs Why FSMs? Represent combinational circuits with feedback Represent memory Represent state dependent behavior Are ubiquitous Used for Regular language recognizers Computer Control Units Represent bus/network protocols 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 28
29 FSM Types Automata Basic machine with state transitions, but no output Moore Output is only a function of present state Mealy Output is a function of both present state and present input 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 29
30 FSM Equivalence It can be shown that there is a behavioral equivalence between Moore and Mealy Machines Any Moore machine can be converted to a behaviorally equivalent Mealy machine and vice-versa 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 30
31 DFA/NDFA Deterministic Finite Automata (DFA) aka, completely specified Non-Deterministic Finite Automata (NDFA) Not all ((state, input),state) pairs are defined in transition function, δ Transitions based on strings rather than single inputs Different state transitions for same (state, input) 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 31
32 DFA/NDFA Any NDFA Can Be Converted to a DFA Net Result, Only Need to Study DFA Mealy Machine 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 32
33 Insert some slides from 331_18/19 here 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 33
34 Inappropriate Use of FSMs Combinational Circuits Fixed Sequencers (no branching, no feedback) n-phase clock shift registers digital FIR w/o feedback 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 34
35 Sample FSM in VHDL Insert more here 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 35
36 End 5/8/2001 Copyright 1997/8/9, KJH, 545_12, 11/17/99 36
Stochastic Simulation: Algorithms and Analysis
Soren Asmussen Peter W. Glynn Stochastic Simulation: Algorithms and Analysis et Springer Contents Preface Notation v xii I What This Book Is About 1 1 An Illustrative Example: The Single-Server Queue 1
More informationChapter 1. Introduction
Chapter 1 Introduction A Monte Carlo method is a compuational method that uses random numbers to compute (estimate) some quantity of interest. Very often the quantity we want to compute is the mean of
More informationComputational Methods. Randomness and Monte Carlo Methods
Computational Methods Randomness and Monte Carlo Methods Manfred Huber 2010 1 Randomness and Monte Carlo Methods Introducing randomness in an algorithm can lead to improved efficiencies Random sampling
More informationComputer Systems Performance Analysis and Benchmarking (37-235)
Computer Systems Performance Analysis and Benchmarking (37-235) Analytic Modeling Simulation Measurements / Benchmarking Lecture by: Prof. Thomas Stricker Assignments/Projects: Christian Kurmann Textbook:
More informationBootstrapping Method for 14 June 2016 R. Russell Rhinehart. Bootstrapping
Bootstrapping Method for www.r3eda.com 14 June 2016 R. Russell Rhinehart Bootstrapping This is extracted from the book, Nonlinear Regression Modeling for Engineering Applications: Modeling, Model Validation,
More informationMonte Carlo Methods; Combinatorial Search
Monte Carlo Methods; Combinatorial Search Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico November 22, 2012 CPD (DEI / IST) Parallel and
More informationAutomata Construct with Genetic Algorithm
Automata Construct with Genetic Algorithm Vít Fábera Department of Informatics and Telecommunication, Faculty of Transportation Sciences, Czech Technical University, Konviktská 2, Praha, Czech Republic,
More informationTowards Interactive Global Illumination Effects via Sequential Monte Carlo Adaptation. Carson Brownlee Peter S. Shirley Steven G.
Towards Interactive Global Illumination Effects via Sequential Monte Carlo Adaptation Vincent Pegoraro Carson Brownlee Peter S. Shirley Steven G. Parker Outline Motivation & Applications Monte Carlo Integration
More informationSimulation Modeling and Analysis
Simulation Modeling and Analysis FOURTH EDITION Averill M. Law President Averill M. Law & Associates, Inc. Tucson, Arizona, USA www. averill-law. com Boston Burr Ridge, IL Dubuque, IA New York San Francisco
More informationAdvanced Digital Logic Design EECS 303
Advanced Digital Logic Design EECS 303 http://ziyang.eecs.northwestern.edu/eecs303/ Teacher: Robert Dick Office: L477 Tech Email: dickrp@northwestern.edu Phone: 847 467 2298 Outline 1. Finite state machines
More informationECE 545 Lecture 12. Datapath vs. Controller. Structure of a Typical Digital System Data Inputs. Required reading. Design of Controllers
ECE 545 Lecture 12 Design of Controllers Finite State Machines and Algorithmic State Machine (ASM) Charts Required reading P. Chu, using VHDL Chapter 1, Finite State Machine: Principle & Practice Chapter
More informationCombinatorial Search; Monte Carlo Methods
Combinatorial Search; Monte Carlo Methods Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico May 02, 2016 CPD (DEI / IST) Parallel and Distributed
More informationRegister Transfer Methodology II
Register Transfer Methodology II Chapter 12 1 Outline 1. Design example: One shot pulse generator 2. Design Example: GCD 3. Design Example: UART 4. Design Example: SRAM Interface Controller 5. Square root
More informationOutline. Register Transfer Methodology II. 1. One shot pulse generator. Refined block diagram of FSMD
Outline Register Transfer Methodology II 1. Design example: One shot pulse generator 2. Design Example: GCD 3. Design Example: UART 4. Design Example: SRAM Interface Controller 5. Square root approximation
More informationIntroduction to Electronic Design Automation. Model of Computation. Model of Computation. Model of Computation
Introduction to Electronic Design Automation Model of Computation Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Spring 03 Model of Computation In system design,
More information10703 Deep Reinforcement Learning and Control
10703 Deep Reinforcement Learning and Control Russ Salakhutdinov Machine Learning Department rsalakhu@cs.cmu.edu Policy Gradient I Used Materials Disclaimer: Much of the material and slides for this lecture
More informationFast Automated Estimation of Variance in Discrete Quantitative Stochastic Simulation
Fast Automated Estimation of Variance in Discrete Quantitative Stochastic Simulation November 2010 Nelson Shaw njd50@uclive.ac.nz Department of Computer Science and Software Engineering University of Canterbury,
More informationInformatics 1. Computation and Logic. Lecture 17 The Big Ideas
Informatics 1 Computation and Logic Lecture 17 The Big Ideas Creative Commons License Informatics 1: Computation and Logic by Michael Paul Fourman is licensed under a Creative Commons Attribution-ShareAlike
More informationThe Plan: Basic statistics: Random and pseudorandom numbers and their generation: Chapter 16.
Scientific Computing with Case Studies SIAM Press, 29 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 28 What is a Monte-Carlo method?
More informationScientific Computing with Case Studies SIAM Press, Lecture Notes for Unit IV Monte Carlo
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit IV Monte Carlo Computations Dianne P. O Leary c 2008 1 What is a Monte-Carlo
More informationFinite State Machines
Finite State Machines CS 3410 Computer System Organization & Programming [K. Bala, A. Bracy, E. Sirer, and H. Weatherspoon] Stateful Components Combinational logic Output computed directly from inputs
More informationDECISION SCIENCES INSTITUTE. Exponentially Derived Antithetic Random Numbers. (Full paper submission)
DECISION SCIENCES INSTITUTE (Full paper submission) Dennis Ridley, Ph.D. SBI, Florida A&M University and Scientific Computing, Florida State University dridley@fsu.edu Pierre Ngnepieba, Ph.D. Department
More informationFSM-based Digital Design using Veriiog HDL
FSM-based Digital Design using Veriiog HDL Peter Minns lan Elliott Northumbria University, UK John Wiley & Sons, Ltd Contents Preface Acknowledgements xi xv 1 Introduction to Finite-State Machines and
More informationIntroduction to Computational Mathematics
Introduction to Computational Mathematics Introduction Computational Mathematics: Concerned with the design, analysis, and implementation of algorithms for the numerical solution of problems that have
More informationSimulation: Solving Dynamic Models ABE 5646 Week 12, Spring 2009
Simulation: Solving Dynamic Models ABE 5646 Week 12, Spring 2009 Week Description Reading Material 12 Mar 23- Mar 27 Uncertainty and Sensitivity Analysis Two forms of crop models Random sampling for stochastic
More informationWhat We ll Do... Random
What We ll Do... Random- number generation Random Number Generation Generating random variates Nonstationary Poisson processes Variance reduction Sequential sampling Designing and executing simulation
More informationFrom Par(cle Filters to Malliavin Filtering with Applica(on to Target Tracking Sérgio Pequito Phd Student
From Par(cle Filters to Malliavin Filtering with Applica(on to Target Tracking Sérgio Pequito Phd Student Final project of Detection, Estimation and Filtering course July 7th, 2010 Guidelines Mo(va(on
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 13 Random Numbers and Stochastic Simulation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright
More informationECE 2300 Digital Logic & Computer Organization. More Verilog Finite State Machines
ECE 2300 Digital Logic & Computer Organization Spring 2017 More Verilog Finite State Machines Lecture 8: 1 Announcements 1 st batch of (raw) quiz scores released on CMS Solutions to HW 1-3 released on
More informationShort-Cut MCMC: An Alternative to Adaptation
Short-Cut MCMC: An Alternative to Adaptation Radford M. Neal Dept. of Statistics and Dept. of Computer Science University of Toronto http://www.cs.utoronto.ca/ radford/ Third Workshop on Monte Carlo Methods,
More informationCprE 583 Reconfigurable Computing
Recap 4:1 Multiplexer CprE / ComS 583 Reconfigurable Computing Prof. Joseph Zambreno Department of Electrical and Computer Engineering Iowa State University Lecture #18 VHDL for Synthesis I LIBRARY ieee
More informationQueuing Networks. Renato Lo Cigno. Simulation and Performance Evaluation Queuing Networks - Renato Lo Cigno 1
Queuing Networks Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queuing Networks - Renato Lo Cigno 1 Moving between Queues Queuing Networks - Renato Lo Cigno - Interconnecting Queues 2 Moving
More informationLecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool
SMA6304 M2 ---Factory Planning and scheduling Lecture Discrete Event of Manufacturing Systems Simulation Sivakumar AI Lecture: 12 copyright 2002 Sivakumar 1 Simulation Simulation - A Predictive Tool Next
More informationSimulation with Arena
Simulation with Arena Sixth Edition W. David Kelton Professor Department of Operations, Business Analytics, and Information Systems University of Cincinnati Randall P. Sadowski Retired Nancy B. Zupick
More information1 Construct implication chart, one square for each combination of states. 2 Square labeled S i, S j, if outputs differ than square gets X (0).
Advanced Digital Logic Design EECS 33 http://ziyang.eecs.northwestern.edu/eecs33/ FSM design overview Teacher: Robert Dick Office: L477 Tech Email: dickrp@northwestern.edu Phone: 847 467 2298 State diagram
More informationPetri Nets ee249 Fall 2000
Petri Nets ee249 Fall 2000 Marco Sgroi Most slides borrowed from Luciano Lavagno s lecture ee249 (1998) 1 Models Of Computation for reactive systems Main MOCs: Communicating Finite State Machines Dataflow
More informationSequential Monte Carlo Adaptation in Low-Anisotropy Participating Media. Vincent Pegoraro Ingo Wald Steven G. Parker
Sequential Monte Carlo Adaptation in Low-Anisotropy Participating Media Vincent Pegoraro Ingo Wald Steven G. Parker Outline Introduction Related Work Monte Carlo Integration Radiative Energy Transfer SMC
More informationPerformance COE 403. Computer Architecture Prof. Muhamed Mudawar. Computer Engineering Department King Fahd University of Petroleum and Minerals
Performance COE 403 Computer Architecture Prof. Muhamed Mudawar Computer Engineering Department King Fahd University of Petroleum and Minerals What is Performance? How do we measure the performance of
More informationRandom Number Generation and Monte Carlo Methods
James E. Gentle Random Number Generation and Monte Carlo Methods With 30 Illustrations Springer Contents Preface vii 1 Simulating Random Numbers from a Uniform Distribution 1 1.1 Linear Congruential Generators
More informationM.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES
(DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2014 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer
More informationOverview of the Simulation Process. CS1538: Introduction to Simulations
Overview of the Simulation Process CS1538: Introduction to Simulations Simulation Fundamentals A computer simulation is a computer program that models the behavior of a physical system over time. Program
More informationSynthesis from VHDL. Krzysztof Kuchcinski Department of Computer Science Lund Institute of Technology Sweden
Synthesis from VHDL Krzysztof Kuchcinski Krzysztof.Kuchcinski@cs.lth.se Department of Computer Science Lund Institute of Technology Sweden March 23, 2006 Kris Kuchcinski (LTH) Synthesis from VHDL March
More informationYou ve already read basics of simulation now I will be taking up method of simulation, that is Random Number Generation
Unit 5 SIMULATION THEORY Lesson 39 Learning objective: To learn random number generation. Methods of simulation. Monte Carlo method of simulation You ve already read basics of simulation now I will be
More informationIntroduction to Verilog
Introduction to Verilog Synthesis and HDLs Verilog: The Module Continuous (Dataflow) Assignment Gate Level Description Procedural Assignment with always Verilog Registers Mix-and-Match Assignments The
More informationVHDL Essentials Simulation & Synthesis
VHDL Essentials Simulation & Synthesis Course Description This course provides all necessary theoretical and practical know-how to design programmable logic devices using VHDL standard language. The course
More information1.2 Numerical Solutions of Flow Problems
1.2 Numerical Solutions of Flow Problems DIFFERENTIAL EQUATIONS OF MOTION FOR A SIMPLIFIED FLOW PROBLEM Continuity equation for incompressible flow: 0 Momentum (Navier-Stokes) equations for a Newtonian
More informationPetri Nets. Petri Nets. Petri Net Example. Systems are specified as a directed bipartite graph. The two kinds of nodes in the graph:
System Design&Methodologies Fö - 1 System Design&Methodologies Fö - 2 Petri Nets 1. Basic Petri Net Model 2. Properties and Analysis of Petri Nets 3. Extended Petri Net Models Petri Nets Systems are specified
More informationDeep Reinforcement Learning
Deep Reinforcement Learning 1 Outline 1. Overview of Reinforcement Learning 2. Policy Search 3. Policy Gradient and Gradient Estimators 4. Q-prop: Sample Efficient Policy Gradient and an Off-policy Critic
More informationSynthesis of Language Constructs. 5/10/04 & 5/13/04 Hardware Description Languages and Synthesis
Synthesis of Language Constructs 1 Nets Nets declared to be input or output ports are retained Internal nets may be eliminated due to logic optimization User may force a net to exist trireg, tri0, tri1
More informationOutline. Petri nets. Introduction Examples Properties Analysis techniques. 1 EE249Fall04
Outline Petri nets Introduction Examples Properties Analysis techniques 1 Petri Nets (PNs) Model introduced by C.A. Petri in 1962 Ph.D. Thesis: Communication with Automata Applications: distributed computing,
More informationMonte Carlo Integration
Lab 18 Monte Carlo Integration Lab Objective: Implement Monte Carlo integration to estimate integrals. Use Monte Carlo Integration to calculate the integral of the joint normal distribution. Some multivariable
More informationIntroduction to VHDL Lecture D
Introduction to VHDL Lecture D Prof. K. J. Hintz Department of Electrical and Computer Engineering George Mason University Copyright 1995, 1996 Basic VHDL RASSP Education & Facilitation Module 10 Version
More informationVHDL: RTL Synthesis Basics. 1 of 59
VHDL: RTL Synthesis Basics 1 of 59 Goals To learn the basics of RTL synthesis. To be able to synthesize a digital system, given its VHDL model. To be able to relate VHDL code to its synthesized output.
More informationDepartment of Computer Science and Electrical Engineering. CMPE 415 Verilog Events Timing and Testbenches Prof. Ryan Robucci
Department of Computer Science and Electrical Engineering CMPE 415 Verilog Events Timing and Testbenches Prof. Ryan Robucci An Event Driven Language also used for Synthesis We emphasize use of Verilog
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 11 Putting it all together Where are we now?
Outline EECS 5 - Components and Design Techniques for Digital Systems Lec Putting it all together -5-4 David Culler Electrical Engineering and Computer Sciences University of California Berkeley Top-to-bottom
More informationFinite Automata. Dr. Nadeem Akhtar. Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur
Finite Automata Dr. Nadeem Akhtar Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur PhD Laboratory IRISA-UBS University of South Brittany European University
More informationERROR PROPAGATION IN OVERLAY ANALYSIS
ERROR PROPAGATION IN OVERLAY ANALYSIS Ali A. Alesheikh Department of Geomatics and Geodesy Eng. K.N.T University of Technology, Vali-asr St., Tehran, IRAN Tel: 8779473-5 Fax: 8779476 Email: ali_alesheikh@hotmail.com
More informationEE 3170 Microcontroller Applications
EE 3170 Microcontroller Applications Lecture 4 : Processors, Computers, and Controllers - 1.2 (reading assignment), 1.3-1.5 Based on slides for ECE3170 by Profs. Kieckhafer, Davis, Tan, and Cischke Outline
More informationDiscrete-Event Simulation: A First Course. Steve Park and Larry Leemis College of William and Mary
Discrete-Event Simulation: A First Course Steve Park and Larry Leemis College of William and Mary Technical Attractions of Simulation * Ability to compress time, expand time Ability to control sources
More informationCSE Theory of Computing Spring 2018 Project 2-Finite Automata
CSE 30151 Theory of Computing Spring 2018 Project 2-Finite Automata Version 1 Contents 1 Overview 2 2 Valid Options 2 2.1 Project Options.................................. 2 2.2 Platform Options.................................
More informationSunburst Design - Verilog-2001 Design & Best Coding Practices by Recognized Verilog & SystemVerilog Guru, Cliff Cummings of Sunburst Design, Inc.
World Class Verilog & SystemVerilog Training Sunburst Design - Verilog-2001 Design & Best Coding Practices by Recognized Verilog & SystemVerilog Guru, Cliff Cummings of Sunburst Design, Inc. Cliff Cummings
More informationA Tutorial Introduction 1
Preface From the Old to the New Acknowledgments xv xvii xxi 1 Verilog A Tutorial Introduction 1 Getting Started A Structural Description Simulating the binarytoeseg Driver Creating Ports For the Module
More informationFMA901F: Machine Learning Lecture 3: Linear Models for Regression. Cristian Sminchisescu
FMA901F: Machine Learning Lecture 3: Linear Models for Regression Cristian Sminchisescu Machine Learning: Frequentist vs. Bayesian In the frequentist setting, we seek a fixed parameter (vector), with value(s)
More informationF.Y.B.Sc Eletronics COURSE OUTCOMES ELE 111: Analog Electronics I
F.Y.B.Sc Eletronics COURSE OUTCOMES ELE 111: Analog Electronics I 1. Understand electronic systems with a continuously variable signal 2. Understand proportional relationship between a signal and a voltage
More informationNumerical approach estimate
Simulation Nature of simulation Numericalapproachfor investigating models of systems. Data are gathered to estimatethe true characteristics of the model. Garbage in garbage out! One of the techniques of
More informationMULTI-DIMENSIONAL MONTE CARLO INTEGRATION
CS580: Computer Graphics KAIST School of Computing Chapter 3 MULTI-DIMENSIONAL MONTE CARLO INTEGRATION 2 1 Monte Carlo Integration This describes a simple technique for the numerical evaluation of integrals
More informationInclusion of Aleatory and Epistemic Uncertainty in Design Optimization
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA Inclusion of Aleatory and Epistemic Uncertainty in Design Optimization Sirisha Rangavajhala
More informationLecture 7: Introduction to Co-synthesis Algorithms
Design & Co-design of Embedded Systems Lecture 7: Introduction to Co-synthesis Algorithms Sharif University of Technology Computer Engineering Dept. Winter-Spring 2008 Mehdi Modarressi Topics for today
More informationIntegration. Volume Estimation
Monte Carlo Integration Lab Objective: Many important integrals cannot be evaluated symbolically because the integrand has no antiderivative. Traditional numerical integration techniques like Newton-Cotes
More informationPerformance Evaluation. Recommended reading: Heidelberg and Lavenberg Computer Performance Evaluation IEEETC, C33, 12, Dec. 1984, p.
Thomas Clark 5/4/09 cs162 lecture notes cs162-aw Performance Evaluation Recommended reading: Heidelberg and Lavenberg Computer Performance Evaluation IEEETC, C33, 12, Dec. 1984, p. 1195 We ve been talking
More informationStatistics (STAT) Statistics (STAT) 1. Prerequisites: grade in C- or higher in STAT 1200 or STAT 1300 or STAT 1400
Statistics (STAT) 1 Statistics (STAT) STAT 1200: Introductory Statistical Reasoning Statistical concepts for critically evaluation quantitative information. Descriptive statistics, probability, estimation,
More informationSTATISTICS (STAT) Statistics (STAT) 1
Statistics (STAT) 1 STATISTICS (STAT) STAT 2013 Elementary Statistics (A) Prerequisites: MATH 1483 or MATH 1513, each with a grade of "C" or better; or an acceptable placement score (see placement.okstate.edu).
More informationLecture 5: Performance Analysis I
CS 6323 : Modeling and Inference Lecture 5: Performance Analysis I Prof. Gregory Provan Department of Computer Science University College Cork Slides: Based on M. Yin (Performability Analysis) Overview
More informationCongestion Control. Andreas Pitsillides University of Cyprus. Congestion control problem
Congestion Control Andreas Pitsillides 1 Congestion control problem growing demand of computer usage requires: efficient ways of managing network traffic to avoid or limit congestion in cases where increases
More informationlec3:nondeterministic finite state automata
lec3:nondeterministic finite state automata 1 1.introduction Nondeterminism is a useful concept that has great impact on the theory of computation. When the machine is in a given state and reads the next
More informationUncertainty analysis in spatial environmental modelling. Kasia Sawicka Athens, 29 Mar 2017
Uncertainty analysis in spatial environmental modelling Kasia Sawicka Athens, 29 Mar 2017 Uncertainty propagation overview Input ± U Model (± U) Output ± U Input data Model parameters Model structure Solution
More informationChapter 6. Logic Design Optimization Chapter 6
Chapter 6 Logic Design Optimization Chapter 6 Optimization The second part of our design process. Optimization criteria: Performance Size Power Two-level Optimization Manipulating a function until it is
More information9.1. K-means Clustering
424 9. MIXTURE MODELS AND EM Section 9.2 Section 9.3 Section 9.4 view of mixture distributions in which the discrete latent variables can be interpreted as defining assignments of data points to specific
More informationEP2200 Queueing theory and teletraffic systems
EP2200 Queueing theory and teletraffic systems Viktoria Fodor Laboratory of Communication Networks School of Electrical Engineering Lecture 1 If you want to model networks Or a complex data flow A queue's
More informationFinal Exam Review. b) Using only algebra, prove or disprove the following:
EE 254 Final Exam Review 1. The final exam is open book and open notes. It will be made up of problems similar to those on the previous 3 hour exams. For review, be sure that you can work all of the problems
More informationSpecifications Part 1
pm3 12 Specifications Part 1 Embedded System Design Kluwer Academic Publisher by Peter Marwedel TU Dortmund 2008/11/15 ine Marwedel, 2003 Graphics: Alexandra Nolte, Ges Introduction 12, 2008-2 - 1 Specification
More informationSequential Logic Synthesis
Sequential Logic Synthesis Logic Circuits Design Seminars WS2010/2011, Lecture 9 Ing. Petr Fišer, Ph.D. Department of Digital Design Faculty of Information Technology Czech Technical University in Prague
More informationRandom-Number Generation
Random-Number Generation Overview Desired properties of a good generator Linear-congruential generators Tausworthe generators Survey of random number generators Seed selection Myths about random number
More informationComputer Graphics. Sampling Theory & Anti-Aliasing. Philipp Slusallek
Computer Graphics Sampling Theory & Anti-Aliasing Philipp Slusallek Dirac Comb (1) Constant & δ-function flash Comb/Shah function 2 Dirac Comb (2) Constant & δ-function Duality f(x) = K F(ω) = K (ω) And
More informationGAMES Webinar: Rendering Tutorial 2. Monte Carlo Methods. Shuang Zhao
GAMES Webinar: Rendering Tutorial 2 Monte Carlo Methods Shuang Zhao Assistant Professor Computer Science Department University of California, Irvine GAMES Webinar Shuang Zhao 1 Outline 1. Monte Carlo integration
More informationHardware Design Environments. Dr. Mahdi Abbasi Computer Engineering Department Bu-Ali Sina University
Hardware Design Environments Dr. Mahdi Abbasi Computer Engineering Department Bu-Ali Sina University Outline Welcome to COE 405 Digital System Design Design Domains and Levels of Abstractions Synthesis
More informationSpeculative High-Performance Simulation. Alessandro Pellegrini A.Y. 2017/2018
Speculative High-Performance Simulation Alessandro Pellegrini A.Y. 2017/2018 Simulation From latin simulare (to mimic or to fake) It is the imitation of a real-world process' or system's operation over
More informationECE 551 Digital System Design and Synthesis. Instructor: Kewal K. Saluja. Midterm Exam
Last (family) name: First (given) name: Student I.D. #: Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE 551 Digital System Design and Synthesis Instructor: Kewal
More informationThe Bootstrap and Jackknife
The Bootstrap and Jackknife Summer 2017 Summer Institutes 249 Bootstrap & Jackknife Motivation In scientific research Interest often focuses upon the estimation of some unknown parameter, θ. The parameter
More informationIntroduction to the course
Introduction to the course Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ 1. What is the teletraffic theory? Multidisciplinary
More informationECE 2300 Digital Logic & Computer Organization. More Verilog Finite State Machines
ECE 2300 Digital Logic & Computer Organization Spring 2018 More Verilog Finite Machines Lecture 8: 1 Prelim 1, Thursday 3/1, 1:25pm, 75 mins Arrive early by 1:20pm Review sessions Announcements Monday
More informationSimulation. Outline. Common Mistakes in Simulation (3 of 4) Common Mistakes in Simulation (2 of 4) Performance Modeling Lecture #8
Introduction (1 of 3) The best advice to those about to embark on a very large simulation is often the same as Punch s famous advice to those about to marry: Don t! Bratley, Fox and Schrage (1986) Simulation
More informationThe Verilog Hardware Description Language
Donald Thomas Philip Moorby The Verilog Hardware Description Language Fifth Edition 4y Spri nnger Preface From the Old to the New Acknowledgments xv xvii xxi 1 Verilog A Tutorial Introduction Getting Started
More informationCompiling Regular Expressions COMP360
Compiling Regular Expressions COMP360 Logic is the beginning of wisdom, not the end. Leonard Nimoy Compiler s Purpose The compiler converts the program source code into a form that can be executed by the
More informationIntroduction to Computers & Programming
16.070 Introduction to Computers & Programming Theory of computation 5: Reducibility, Turing machines Prof. Kristina Lundqvist Dept. of Aero/Astro, MIT States and transition function State control A finite
More informationProbabilistic Graphical Models
Probabilistic Graphical Models Lecture 17 EM CS/CNS/EE 155 Andreas Krause Announcements Project poster session on Thursday Dec 3, 4-6pm in Annenberg 2 nd floor atrium! Easels, poster boards and cookies
More informationECE 551: Digital System *
ECE 551: Digital System * Design & Synthesis Lecture Set 5 5.1: Verilog Behavioral Model for Finite State Machines (FSMs) 5.2: Verilog Simulation I/O and 2001 Standard (In Separate File) 3/4/2003 1 Explicit
More informationOutline. CPE/EE 422/522 Advanced Logic Design L05. Review: General Model of Moore Sequential Machine. Review: Mealy Sequential Networks.
Outline CPE/EE 422/522 Advanced Logic Design L05 Electrical and Computer Engineering University of Alabama in Huntsville What we know Combinational Networks Sequential Networks: Basic Building Blocks,
More informationIJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY FPGA
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY FPGA Implementations of Tiny Mersenne Twister Guoping Wang Department of Engineering, Indiana University Purdue University Fort
More informationChapter 2 Random Number Generators
Chapter 2 Random Number Generators Introduction For many past years, numerous applications of randomness have led to a wide variety of methods for generating random data of various type, like rolling dice,
More information