

 Nathaniel Johnston
 3 years ago
 Views:
Transcription
1 System Modelingg Models of Computation and their Applications Axel Jantsch Laboratory for Electronics and Computer Systems (LECS) Royal Institute of Technology, Stockholm, Sweden February 4, 2005
2 System Modeling, JanFeb 2005, Kista Introduction 1 Contents Introduction Finite State Machines Petri Nets The Untimed Model of Computation The Synchronous Model of Computation The Timed Model of Computation Integration of Different Computational Models Tightly Coupled Process Networks Nondeterminism and Probability Applications
3 System Modeling, JanFeb 2005, Kista Introduction 2 Introduction Motivation System and Model Properties Rugby Meta Model Case Study: A Design Project
4 System Modeling, JanFeb 2005, Kista Introduction 3 Why do we need models? To perform various design tasks! Performance modeling Functional modeling and specification Design and synthesis Validation and verification Test vector generation Test coverage analysis Architecture evaluation and mapping Technology mapping Placement and routing
5 System Modeling, JanFeb 2005, Kista Introduction 4 What is a Model? Model: A model is a simplification of another entity, which can be a physical thing or another model. The model contains exactly those characteristics and properties of the modeled entity which are relevant for a given task. A model is minimal with respect to a task, if it does not contain any other characteristics than those relevant for the task. A model relates to an entity A model is a simplification of that entity A model is related to a task and an objective A model may relate to a not yet existing entity
6 System Modeling, JanFeb 2005, Kista Introduction 5 Properties of Models Inherent property: The property is inherent in every model. E.g. the finite state space of a finite state machine model. Static property: The property can be statically evaluated. E.g. the required memory of a finite state machine model. Dynamic property: The property can only be dynamically evaluated. E.g. the required memory of a C program.
7 System Modeling, JanFeb 2005, Kista Introduction 6 Heterogeneous Models are Necessary A system consists of different parts. E.g. data flow and control flow dominated parts. Different objectives apply for different parts. E.g. the system and its environment. Different parts are developed by different people and tools. E.g. HW and SW.
8 System Modeling, JanFeb 2005, Kista Introduction 7 What is a System? A system is an aggregation or assemblage of things so combined by nature or man as to form an integral or complex whole [Encyclopedia America] a regularly interacting or independent group of items forming a unified whole [Webster s Dictionary] a combination of components that act together to perform a function not possible with any of the individual parts [IEEE Standard Dictionary of Electrical and Electronic Terms]
9 System Modeling, JanFeb 2005, Kista Introduction 8 The InputOutput Modeling Process u(t) = u 1(t). u p (t) y(t) = y 1(t). y m (t) y 1 (t) = f 1 (u 1 (t),..., u p (t)). y m (t) = f m (u 1 (t),..., u p (t)) y(t) = f( u(t)) = f 1(u 1 (t),..., u p (t)). f m (u 1 (t),..., u p (t))
10 System Modeling, JanFeb 2005, Kista Introduction 9 A Mathematical Model of a Real System inputs outputs System u(t) y = f( u) Model
11 System Modeling, JanFeb 2005, Kista Introduction 10 Example Temperature Controller temperature sensor [0V, 5V] temperature controller [ 5V, +5V] heater/ cooler [0, 50 ] temperature controller [ 1, 1] TC1 y(t) = R T u(t) 50 [0V, 5V] temperature controller TC2 [ 5V, +5V] y(t) = R V u(t) [0, 255] temperature controller TC3 [ 127, +127] y(t) = R N u(t) 4
12 System Modeling, JanFeb 2005, Kista Introduction 11 Static and Dynamic Systems Definition: A static system is one where the output y(t) is independent of past values of the input u(t ), t < t for all t Definition: A dynamic system is one where the output y(t) depends on the current input value u(t) and on at least another input value u(t ) with t < t, y(t) = f(u(t), u(t )).
13 System Modeling, JanFeb 2005, Kista Introduction 12 TimeVarying and TimeInvariant Systems Definition: A model M with y(t) = f( u(t)) is timeinvariant if, supplied with input variables u (t) = u(t + τ), it defines output variables y (t) = f( u (t)) = y(t + τ) for any τ. Definition: In contrast, a timevarying model is one for which this property does not hold, i.e. where the output function explicitly depends on t: y(t) = f( u(t), t).
14 System Modeling, JanFeb 2005, Kista Introduction 13 A TimeInvariant System u(t) y(t) = f(u(t)) t t u (t) = u(t + τ) y (t) = f(u (t)) = y(t + τ) τ t τ t
15 System Modeling, JanFeb 2005, Kista Introduction 14 The Concept of State Definition: The state of a system at time t 0 is the information required such that the output y(t) for all t t 0 is uniquely determined by this information and the inputs u(t), t t 0. The state of a system at time t 0 is called the initial state ( x 0 ). The equations required to specify the state for all t t 0, given the initial state and the input u(t), t t 0, are called state equations. The state space X of the system is the set of all possible values of the state.
16 System Modeling, JanFeb 2005, Kista Introduction 15 The State Space Continuousstate models: The state space X is a continuum, e.g. X = R or X = R n Discretestate models: The state space is a discrete set, e.g. X = N or X = {0, 1} or X = { blue, red, green }.
17 System Modeling, JanFeb 2005, Kista Introduction 16 A State Space Model for Continuous Time, Continuous State Systems State equations: Initial state: x(t) = g( x(t), u(t), t) Output equations: x(0) = x 0 y(t) = f( x(t), u(t), t)
18 System Modeling, JanFeb 2005, Kista Introduction 17 State equations: A State Space Model for Discrete Time Systems Initial state: x(t + 1) = g( x(t), u(t), t) Output equations: x(0) = x 0 y(t) = f( x(t), u(t), t)
19 System Modeling, JanFeb 2005, Kista Introduction 18 A State Space Model for TimeInvariant, Discrete Time Systems State equations: Initial state: x(t + 1) = g( x(t), u(t)) Output equations: x(0) = x 0 y(t) = f( x(t), u(t))
20 System Modeling, JanFeb 2005, Kista Introduction 19 Linear and Nonlinear Systems Definition: A function f : A A is linear if and only if f(a 1 x 1 + a 2 x 2 ) = a 1 f(x 1 ) + a 2 f(x 2 ) for all a 1, a 2, x 1, x 2 A. A function f : A n A n is linear if and only if f(a 1 x 1 +a 2 x 2 ) = a 1f( x1 )+a 2f( x2 ) for all a 1, a 2 A, x 1, x 2 A n, where A n is the set of vectors of length n with elements of A. A system with state function g and output function f is linear if and only if both functions f and g are linear.
21 System Modeling, JanFeb 2005, Kista Introduction 20 Matrix Equations for Discrete, Linear Systems x(t + 1) = A(t) x(t) + B(t) u(t) y(t) = C(t) x(t) + D(t) u(t) where A(t) n n matrix, B(t) n p matrix, C(t) m n matrix, D(t) m p matrix, n number of state variables, m number of output variables, p number of input variables.
22 System Modeling, JanFeb 2005, Kista Introduction 21 Matrix Equations for Discrete, Linear, Timeinvariant Systems x(t + 1) = A x(t) + B u(t) y(t) = C x(t) + D u(t) with constant matrices A, B, C, and D.
23 System Modeling, JanFeb 2005, Kista Introduction 22 Deterministic, Stochastic and Nondeterministic Systems Definition: A system model is deterministic if the output function f and the state function g are functions in the sense that they evaluate a given argument always and unambiguously to the same result. A system model is stochastic if at least one of their output variables is a random variable. A system model is nondeterministic if a given input may result in different outputs.
24 System Modeling, JanFeb 2005, Kista Introduction 23 Events Events are associated with a time instance and have no duration. Examples: Arrival of a message; Change of a signal value; Change of a state; A counter exceeding a given threshold value; An elapsed time period; etc.
25 System Modeling, JanFeb 2005, Kista Introduction 24 Timedriven and Eventdriven In timedriven systems the advance of time causes the system to become active. In eventdriven systems the occurrence of an event causes the system to become active.
26 System Modeling, JanFeb 2005, Kista Introduction 25 System Classification Summary Systems Static Dynamic Time varying Time invariant Linear Non linear Systems under consideration Continuous state Discrete state Continuous time Discrete time Event driven Time driven Deterministic Stochastic Nondeterministic
27 System Modeling, JanFeb 2005, Kista Introduction 26 The Rugby MetaModel Abstraction in four domains Computation Communication Time Data
28 System Modeling, JanFeb 2005, Kista Introduction 27 Example of a Hierarchy
29 System Modeling, JanFeb 2005, Kista Introduction 28 Example of an Abstraction
30 System Modeling, JanFeb 2005, Kista Introduction 29 Ways to Handle Complexity Complexity Domains Hierarchy Abstraction Analytic aproach Horizontal approach Vertical approach
31 System Modeling, JanFeb 2005, Kista Introduction 30 Hierarchy, Abstraction, Domain Hierarchy: A hierarchy is a, possibly recursive, partitioning of a design model such, that the details of each part is hidden into a lower hierarchical level. Moving down the hierarchy displays information. Moving up the hierarchy hides information. Abstraction: An abstraction level defines the modeling concepts and their semantics for representing a system. The type of information available at different levels is different. A higher level ignores some irrelevant information of a lower level or encodes it using different concepts. Moving down an abstraction level adds information. Moving up an abstraction level removes information. Domain: A domain is an aspect of a model which can logically be analyzed independently from other aspects.
32 System Modeling, JanFeb 2005, Kista Introduction 31 Rugby Time Computation Idea Physical System High abstraction Communication Data Low abstraction Development time line
33 System Modeling, JanFeb 2005, Kista Introduction 32 Structure and Interface Constraints The Domains in Rugby Communication Inter Process Communication Topology Procedure Call Layout HW SW Relations and Constraints Computation System Function Concurrent Processes Algorithm Logic Block Transistor Instruction Set HW SW Data Data Type Constraints Symbol Number Continuous Value Logic Value HW Time Timing Constraints Causality ClockedTime Physical Time HW Processor Data Types SW Processor Cycle Time SW Idea Physical System Development timeline High Abstraction Low Abstraction
34 System Modeling, JanFeb 2005, Kista Introduction 33 The Computation Domain System Constraints Relations and System Function Concurrent Processes Algorithm Logic Block Set Transistor Instruction HW SW
35 System Modeling, JanFeb 2005, Kista Introduction 34 A MOS Transistor Model V DS > V GS V T (conducting state): I D = k n W W 2L (V GS V T ) 2 (1 + λv DS ) Gate Drain I D Source V DS < V GS V T (subthreshold state): I D = k n W W L ((V GS V T )V DS V 2 DS 2 ) where V T = V T 0 + γ( 2φ F + V SB 2φ F ) V DS... drainsource voltage V GS... gatesource voltage V T... threshold voltage... drainsource current I D
36 System Modeling, JanFeb 2005, Kista Introduction 35 A Transistor as Switch Gate Drain Source Gate Drain Source 0 0 undefined 0 1 undefined
37 System Modeling, JanFeb 2005, Kista Introduction 36 An AND Gate as Transistor Network Input 1 Input 2 Input 3 Input 4 1 R 0 Output Two problems with arbitrary transistor networks: Output is not defined when input is 0. Voltage drop between drain and source is relevant but not visible.
38 System Modeling, JanFeb 2005, Kista Introduction 37 An Inverter as Transistor Network Drain Input Output 2 Input Output Source (b) (c) (a)
39 System Modeling, JanFeb 2005, Kista Introduction 38 Gate Based Abstraction Level 1. The primitive elements are defined by simple models, i.e. small truth tables in this case. 2. The primitive elements can be implemented in a wide range of technologies. 3. The model holds even for arbitrarily large networks of primitive elements.
40 System Modeling, JanFeb 2005, Kista Introduction 39 Algorithms, Functions, Relations Relation [n 1, n 2,...n N ] n SORT i =, <, > n i+1 [n 1, n 2,...n N ] [n 1, n 2,...n N ] [n 1, n 2,...n N ] n i >= n i+1 Function [n 1, n 2,...n N ] n SORT i =, <, > n i+1 [n 1, n 2,...n N ] n i >= n i+1 Algorithm Bubble sort for i := 2 TO N do for j := N downto i do if input [j1] > input [j ] then begin tmp := input [ j 1 ]; input [ j  1] := input [ j ]; input [ j ] := tmp; end Linear sort Quick sort
41 System Modeling, JanFeb 2005, Kista Introduction 40 Sorting Defined as Relation sort (IntArray A) (IntArray B) Precondition: true Post condition: a A : a B b B : b A i, j Integer, b i, b j B : i < j b i b j
42 System Modeling, JanFeb 2005, Kista Introduction 41 Sorting Defined as Function sort ::[Integer] [Integer] sort [] = [] sort (x : xs) = (sort (selectlt x xs)) + + [x] + + (sort (selectge x xs))
43 System Modeling, JanFeb 2005, Kista Introduction 42 Sorting Defined as Algorithms Array sort s (iarray) { Array oarray = EArray; // initialized to the empty array int x = iarray[0]; oarray = sort s(selectlt (x,iarray)); append(orray,x); append(oarray,sort (selectge (x,iarray))); return (oarray); } a sequential algorithm Array sort p (iarray) { Array oarray,oarray2 = EArray; int x = iarray[0]; par{ oarray = sort p(selectlt (x,iarray)) oarray2 = sort p(selectge (x,iarray)) } append(orray,x); append(oarray,oarray2); return (oarray); } a parallel algorithm
44 System Modeling, JanFeb 2005, Kista Introduction 43 The Communication Domain Structure and Interface Constraints Inter Process Communication Topology Layout HW System Procedure Call SW
45 System Modeling, JanFeb 2005, Kista Introduction 44 Communication at the Gate and Layout Level b a c a b x NAND INV c y OR NAND y x
46 System Modeling, JanFeb 2005, Kista Introduction 45 Communication between Processes Communication Network A B
47 System Modeling, JanFeb 2005, Kista Introduction 46 The Data Domain Constraints Data Type Symbol Number Continuous Value Logic Value HW System Data Types Processor SW
48 System Modeling, JanFeb 2005, Kista Introduction 47 The Time Domain Timing Constraints Causality ClockedTime Physical Time HW System Processor Cycle Time SW
49 System Modeling, JanFeb 2005, Kista Introduction 48 Notation for Abstraction Levels: Computation Relations and Constraints RelationConstraints RC System Functions SystemFunctions SF Concurrent Processes, Algorithms Algorithm Alg Logic Block LogicBlock LB Transistor Transistor Tran Instruction Set InstructionSet Inst
50 System Modeling, JanFeb 2005, Kista Introduction 49 Notation for Abstraction Levels: Communication Structural and Interface Constraints InterfaceConstraints IC Inter Process Communication InterProcessComm IPC Topology Topology Top Layout Layout Lay Procedure Call ProcCall PC
51 System Modeling, JanFeb 2005, Kista Introduction 50 Notation for Abstraction Levels: Data Data Type Constraints DataTypeConstraints DTC Symbol Symbol Sym Number Number Num Logic Value LogicValue LV Continuous Value ContValue CV Processor Data Types ProcessorDataTypes PDT
52 System Modeling, JanFeb 2005, Kista Introduction 51 Notation for Abstraction Levels: Time Timing Constraints TimingConstraints TC Causality Causality Caus Clocked Time ClockedTime CT Physical Time PhysicalTime PhyT Processor Cycle Time ProcessorCycleTime PCT
53 System Modeling, JanFeb 2005, Kista Introduction 52 Abstraction Levels in Design Phases RC SF Alg LB IC IPC Top DTC Sym Num LV TC Caus CT PhyT Requirements Definition Specification Design Implementation Development Timeline Tran Lay CV Computation Communication Data Time
54 System Modeling, JanFeb 2005, Kista Introduction 53 Design Activities in Terms of Abstraction Levels RC IC DTC TC System Partitioning Technology mapping SF Alg LB Tran Interface Synthesis Place&Route IPC Top Lay State encoding Technology mapping Sym Num LV CV Scheduling Retiming Caus CT PhyT Computation Communication Data Time
55 System Modeling, JanFeb 2005, Kista Introduction 54 Analysis Activities in Terms of Abstraction Levels Feasibility analysis IC RC DTC TC IPC Logic simulation, Timing analysis Top SF Alg LB Sym Num LV Caus Performance estimation of algorithms CT PhyT Lay Area estimation of algorithms Communication Tran Computation CV Data Time
56 System Modeling, JanFeb 2005, Kista Introduction 55 The Network Terminal Case Study Network Terminal (NT) 0 1 Backbone network
57 System Modeling, JanFeb 2005, Kista Introduction 56 The Network Terminal Case Study CPN Interface NT Core Ethernet Control and Access Network Distribution Network Interface Block Management ATM Switch Telephone Cable TV
58 System Modeling, JanFeb 2005, Kista Introduction 57 The NT Design Flow Requirements SDL Model C Model VHDL Model Assembler Netlist
59 System Modeling, JanFeb 2005, Kista Introduction 58 Models in the NT Design Models Abstraction Levels Computation Communication Data Time Requirements RC IC DTC TC System (SDL) Alg IPC Sym Caus HW VHDL Alg Top Sym,LV CT Netlist LB Top LV PhyT SW C ALg PC Sym CT Assembler Inst PC PDT PCT
60 System Modeling, JanFeb 2005, Kista Introduction 59 The Network Terminal Case Study Time Idea Requirements High abstraction Specification (SDL) Computation Communication Data Design models (VHDL and C) Implementation (Assembler, Netlist) Low abstraction Physical System Development time line
61 System Modeling, JanFeb 2005, Kista Introduction 60 Transformations in the NT Design Requirements Algorithmic: Computation Time Algorithmic: Computation Communication Data Time C Model Assembler SDL Model Algorithmic transformation: none Algorithmic: Computation VHDL Model Netlist Algorithmic: Computation Communication Data Time
Circuit and System Representation. IC Designers must juggle several different problems
Circuit and System Representation IC Designers must juggle several different problems Multiple levels of abstraction IC designs requires refining an idea through many levels of detail, specification >
More informationDigital Logic Design
Digital Logic Design: An Embedded Systems Approach Using VHDL Chapter 1 Introduction and Methodology Portions of this work are from the book, Digital Logic Design: An Embedded Systems Approach Using VHDL,
More informationIntroduction to RTL. Horácio Neto, Paulo Flores INESCID/IST. Design Complexity
Introduction to RTL INESCID/IST 1 Design Complexity How to manage the complexity of a digital design with 100 000 logic gates? Abstraction simplify system model Consider only specific features for the
More informationSystem Modeling Introduction Rugby MetaModel Finite State Machines Petri Nets Untimed Model of Computation Synchronous Model of Computation Timed Model of Computation Integration of Computational Models
More informationDigital System Design. Digital System Design with Verilog
Digital System Design with Verilog Adapted from Z. Navabi Portions Copyright Z. Navabi, 2006 1 Digital System Design Automation with Verilog Digital Design Flow Design entry Testbench in Verilog Design
More informationOverview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification
Introduction Overview Motivating Examples Interleaving Model Semantics of Correctness Testing, Debugging, and Verification Advanced Topics in Software Engineering 1 Concurrent Programs Characterized by
More informationINTRODUCTION TO DIGITAL SYSTEMS. IMPLEMENTATION: MODULES (ICs) AND NETWORKS IMPLEMENTATION OF ALGORITHMS IN HARDWARE
INTRODUCTION TO DIGITAL SYSTEMS 1 DESCRIPTION AND DESIGN OF DIGITAL SYSTEMS FORMAL BASIS: SWITCHING ALGEBRA IMPLEMENTATION: MODULES (ICs) AND NETWORKS IMPLEMENTATION OF ALGORITHMS IN HARDWARE COURSE EMPHASIS:
More informationAgenda. Michele Taliercio, Il circuito Integrato, Novembre 2001
Agenda Introduzione Il mercato Dal circuito integrato al System on a Chip (SoC) La progettazione di un SoC La tecnologia Una fabbrica di circuiti integrati 28 How to handle complexity G The engineering
More informationWhat is Modeling and Simulation and Software Engineering?
What is Modeling and Simulation and Software Engineering? V. Sundararajan Scientific and Engineering Computing Group Centre for Development of Advanced Computing Pune 411 007 vsundar@cdac.in Definitions
More informationA Tutorial Introduction 1
Preface From the Old to the New Acknowledgments xv xvii xxi Verilog A Tutorial Introduction 1 Getting Started 2 A Structural Description 2 Simulating the binarytoeseg Driver 4 Creating Ports For the Module
More informationDigital Design Chapter 1 Introduction and Methodology 17 February 2010
Digital Chapter Introduction and Methodology 7 February 200 Digital : An Embedded Systems Approach Using Chapter Introduction and Methodology Digital Digital: circuits that use two voltage levels to represent
More informationIn Module 9, 10, 11, you have been introduced to examples of combinational logic circuits whereby the outputs are entirely dependent on the current
Module 12 In Module 9, 10, 11, you have been introduced to examples of combinational logic circuits whereby the outputs are entirely dependent on the current inputs. The following topics will be on sequential
More informationFault Modeling. Why model faults? Some real defects in VLSI and PCB Common fault models Stuckat faults. Transistor faults Summary
Fault Modeling Why model faults? Some real defects in VLSI and PCB Common fault models Stuckat faults Single stuckat faults Fault equivalence Fault dominance and checkpoint theorem Classes of stuckat
More informationDigital Systems Design! Lecture 1  Introduction!!
ECE 3401! Digital Systems Design! Lecture 1  Introduction!! Course Basics Classes: Tu/Th 1112:15, ITE 127 Instructor Mohammad Tehranipoor Office hours: T 12pm, or upon appointments @ ITE 441 Email:
More informationRecurrent Neural Networks
Recurrent Neural Networks Neural Computation : Lecture 12 John A. Bullinaria, 2015 1. Recurrent Neural Network Architectures 2. State Space Models and Dynamical Systems 3. Backpropagation Through Time
More informationChapter 3: Combinational Logic Design
Chapter 3: Combinational Logic Design 1 Introduction We have learned all the prerequisite material: Truth tables and Boolean expressions describe functions Expressions can be converted into hardware circuits
More informationVisualization methods for patent data
Visualization methods for patent data Treparel 2013 Dr. Anton Heijs (CTO & Founder) Delft, The Netherlands Introduction Treparel can provide advanced visualizations for patent data. This document describes
More informationELECTRICAL ENGINEERING
EE ELECTRICAL ENGINEERING See beginning of Section H for abbreviations, course numbers and coding. The * denotes labs which are held on alternate weeks. A minimum grade of C is required for all prerequisite
More informationComputer/Information Science Course Descriptions
Computer/Information Science Course Descriptions COMS 1003: Introduction to Computer Based Systems Provides students with both computer concepts and handson applications. Although little or no prior computer
More informationBig Data: Rethinking Text Visualization
Big Data: Rethinking Text Visualization Dr. Anton Heijs anton.heijs@treparel.com Treparel April 8, 2013 Abstract In this white paper we discuss text visualization approaches and how these are important
More informationComparison of power consumption of 4bit binary counters with various state encodings including gray and onehot codes
1 Comparison of power consumption of 4bit binary counters with various state encodings including gray and onehot codes Varun Akula, Graduate Student, Auburn University, Dr. Vishwani D. Agrawal, James
More informationSimulation & Synthesis Using VHDL
Floating Point Multipliers: Simulation & Synthesis Using VHDL By: Raj Kumar Singh  B.E. (Hons.) Electrical & Electronics Shivananda Reddy  B.E. (Hons.) Electrical & Electronics BITS, PILANI Outline Introduction
More informationMemory Systems. Static Random Access Memory (SRAM) Cell
Memory Systems This chapter begins the discussion of memory systems from the implementation of a single bit. The architecture of memory chips is then constructed using arrays of bit implementations coupled
More informationPrinciples and characteristics of distributed systems and environments
Principles and characteristics of distributed systems and environments Definition of a distributed system Distributed system is a collection of independent computers that appears to its users as a single
More informationRAPID PROTOTYPING OF DIGITAL SYSTEMS Second Edition
RAPID PROTOTYPING OF DIGITAL SYSTEMS Second Edition A Tutorial Approach James O. Hamblen Georgia Institute of Technology Michael D. Furman Georgia Institute of Technology KLUWER ACADEMIC PUBLISHERS Boston
More informationUsing the Theory of Reals in. Analyzing Continuous and Hybrid Systems
Using the Theory of Reals in Analyzing Continuous and Hybrid Systems Ashish Tiwari Computer Science Laboratory (CSL) SRI International (SRI) Menlo Park, CA 94025 Email: ashish.tiwari@sri.com Ashish Tiwari
More informationThe System Designer's Guide to VHDLAMS
The System Designer's Guide to VHDLAMS Analog, MixedSignal, and MixedTechnology Modeling Peter J. Ashenden EDA CONSULTANT, ASHENDEN DESIGNS PTY. LTD. VISITING RESEARCH FELLOW, ADELAIDE UNIVERSITY Gregory
More informationThe Concept of State in System Theory
Siegfried Wendt University of Kaiserslautern The Concept of State in System Theory In system theory, state is a key concept. Here, the word state refers to condition, as in the example Since he went into
More informationSystolic Computing. Fundamentals
Systolic Computing Fundamentals Motivations for Systolic Processing PARALLEL ALGORITHMS WHICH MODEL OF COMPUTATION IS THE BETTER TO USE? HOW MUCH TIME WE EXPECT TO SAVE USING A PARALLEL ALGORITHM? HOW
More informationSchool of Computing and Information Sciences. Course Title: Computer Programming III Date: April 9, 2014
Course Title: Computer Date: April 9, 2014 Course Number: Number of Credits: 3 Subject Area: Programming Subject Area Coordinator: Tim Downey email: downeyt@cis.fiu.edu Catalog Description: Programming
More informationDesign Verification and Test of Digital VLSI Circuits NPTEL Video Course. ModuleVII LectureI Introduction to Digital VLSI Testing
Design Verification and Test of Digital VLSI Circuits NPTEL Video Course ModuleVII LectureI Introduction to Digital VLSI Testing VLSI Design, Verification and Test Flow Customer's Requirements Specifications
More informationControl Systems 2. Lecture 7: System theory: controllability, observability, stability, poles and zeros. Roy Smith
Control Systems 2 Lecture 7: System theory: controllability, observability, stability, poles and zeros Roy Smith 216412 7.1 Statespace representations Idea: Transfer function is a ratio of polynomials
More informationEastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students
Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent
More informationGates, Circuits, and Boolean Algebra
Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks
More informationCHAPTER 11: Flip Flops
CHAPTER 11: Flip Flops In this chapter, you will be building the part of the circuit that controls the command sequencing. The required circuit must operate the counter and the memory chip. When the teach
More informationCS311 Lecture: Sequential Circuits
CS311 Lecture: Sequential Circuits Last revised 8/15/2007 Objectives: 1. To introduce asynchronous and synchronous flipflops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationModule3 SEQUENTIAL LOGIC CIRCUITS
Module3 SEQUENTIAL LOGIC CIRCUITS Till now we studied the logic circuits whose outputs at any instant of time depend only on the input signals present at that time are known as combinational circuits.
More informationOptimizing Configuration and Application Mapping for MPSoC Architectures
Optimizing Configuration and Application Mapping for MPSoC Architectures École Polytechnique de Montréal, Canada Email : Sebastien.LeBeux@polymtl.ca 1 MultiProcessor Systems on Chip (MPSoC) Design Trends
More informationBest Practises for LabVIEW FPGA Design Flow. uk.ni.com ireland.ni.com
Best Practises for LabVIEW FPGA Design Flow 1 Agenda Overall Application Design Flow Host, RealTime and FPGA LabVIEW FPGA Architecture Development FPGA Design Flow Common FPGA Architectures Testing and
More informationMETHODOLOGICAL CONSIDERATIONS OF DRIVE SYSTEM SIMULATION, WHEN COUPLING FINITE ELEMENT MACHINE MODELS WITH THE CIRCUIT SIMULATOR MODELS OF CONVERTERS.
SEDM 24 June 16th  18th, CPRI (Italy) METHODOLOGICL CONSIDERTIONS OF DRIVE SYSTEM SIMULTION, WHEN COUPLING FINITE ELEMENT MCHINE MODELS WITH THE CIRCUIT SIMULTOR MODELS OF CONVERTERS. Áron Szûcs BB Electrical
More informationIntroduction to Engineering System Dynamics
CHAPTER 0 Introduction to Engineering System Dynamics 0.1 INTRODUCTION The objective of an engineering analysis of a dynamic system is prediction of its behaviour or performance. Real dynamic systems are
More informationAims and Objectives. E 3.05 Digital System Design. Course Syllabus. Course Syllabus (1) Programmable Logic
Aims and Objectives E 3.05 Digital System Design Peter Cheung Department of Electrical & Electronic Engineering Imperial College London URL: www.ee.ic.ac.uk/pcheung/ Email: p.cheung@ic.ac.uk How to go
More informationUsing Separation of Concerns for Embedded Systems Design. α=90
Using Separation of Concerns for Embedded Systems Design α=90 Ethan Jackson and Janos Sztipanovits EmSoft 05, Jersey City, New Jersey September 19, 2005 Part I Outline Introduction: Discuss major design
More informationECE410 Design Project Spring 2008 Design and Characterization of a CMOS 8bit Microprocessor Data Path
ECE410 Design Project Spring 2008 Design and Characterization of a CMOS 8bit Microprocessor Data Path Project Summary This project involves the schematic and layout design of an 8bit microprocessor data
More informationSpecification and Description Language (SDL)
Definition Specification and Description Language (SDL) Specification and description language (SDL) is an objectoriented, formal language defined by The International Telecommunications Union Telecommunications
More informationLab 1: Seven Segment Decoder
CpE 487 Digital Design Lab Lab 1: Seven Segment Decoder 1. Getting Started The purpose of this lab is to introduce you to the NEXYS2 FPGA development board and a software environment that will allow you
More informationChapter 2 Logic Gates and Introduction to Computer Architecture
Chapter 2 Logic Gates and Introduction to Computer Architecture 2.1 Introduction The basic components of an Integrated Circuit (IC) is logic gates which made of transistors, in digital system there are
More informationWorking with combinational logic. Design example: 2x2bit multiplier
Working with combinational logic Simplification twolevel simplification exploiting don t cares algorithm for simplification Logic realization twolevel logic and canonical forms realized with NNs and
More informationReliable Systolic Computing through Redundancy
Reliable Systolic Computing through Redundancy Kunio Okuda 1, Siang Wun Song 1, and Marcos Tatsuo Yamamoto 1 Universidade de São Paulo, Brazil, {kunio,song,mty}@ime.usp.br, http://www.ime.usp.br/ song/
More information(Refer Slide Time 6:09)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture 3 Combinational Logic Basics We defined digital signal as a signal which
More informationSoftware Engineering Prof. N.L. Sarda Computer Science & Engineering Indian Institute of Technology, Bombay Lecture4 Overview of Phases (Part  II)
Software Engineering Prof. N.L. Sarda Computer Science & Engineering Indian Institute of Technology, Bombay Lecture4 Overview of Phases (Part  II) We studied the problem definition phase, with which
More informationLayered Approach to Development of OO War Game Models Using DEVS Framework
Layered Approach to Development of OO War Game Models Using DEVS Framework Chang Ho Sung*, SuYoun Hong**, and Tag Gon Kim*** Department of EECS KAIST 3731 Kusongdong, Yusonggu Taejeon, Korea 305701
More informationLAB #3 VHDL RECOGNITION AND GAL IC PROGRAMMING USING ALL11 UNIVERSAL PROGRAMMER
LAB #3 VHDL RECOGNITION AND GAL IC PROGRAMMING USING ALL11 UNIVERSAL PROGRAMMER OBJECTIVES 1. Learn the basic elements of VHDL that are implemented in Warp. 2. Build a simple application using VHDL and
More informationMcPAT: An Integrated Power, Area, and Timing Modeling Framework for Multicore and Manycore Architectures
McPAT: An Integrated Power, Area, and Timing Modeling Framework for Multicore and Manycore Architectures Sheng Li, Junh Ho Ahn, Richard Strong, Jay B. Brockman, Dean M Tullsen, Norman Jouppi MICRO 2009
More informationMODULE 11 DESIGN OF SYNCHRONOUS SEQUENTIAL COUNTERS AND STATE MACHINES
Introduction to Digital Electronics Module 11: Design of Sequential Counters and State Machines 1 MODULE 11 DESIGN OF SYNCHRONOUS SEQUENTIAL COUNTERS AND STATE MACHINES OVERVIEW: A synchronous sequential
More informationInformation and Communications Technology Courses at a Glance
Information and Communications Technology Courses at a Glance Level 1 Courses ICT121 Introduction to Computer Systems Architecture This is an introductory course on the architecture of modern computer
More informationCAD TOOLS FOR VLSI. FLOORPLANNING Page 1 FLOORPLANNING
FLOORPLANNING Page 1 FLOORPLANNING Floorplanning: taking layout information into account at early stages of the design process. BEHAVIORAL D. STRUCTURAL D. Systems Algorithms Processors Register transfers
More informationfakultät für informatik informatik 12 technische universität dortmund Data flow models Peter Marwedel Informatik 12 TU Dortmund Germany
12 Data flow models Peter Marwedel Informatik 12 TU Dortmund Germany Models of computation considered in this course Communication/ local computations Communicating finite state machines Data flow model
More informationBasics of Digital Logic Design
CSE 675.2: Introduction to Computer Architecture Basics of Digital Logic Design Presentation D Study: B., B2, B.3 Slides by Gojko Babi From transistors to chips Chips from the bottom up: Basic building
More informationThe Designer's Guide to VHDL
The Designer's Guide to VHDL Third Edition Peter J. Ashenden EDA CONSULTANT, ASHENDEN DESIGNS PTY. LTD. ADJUNCT ASSOCIATE PROFESSOR, ADELAIDE UNIVERSITY AMSTERDAM BOSTON HEIDELBERG LONDON m^^ yj 1 ' NEW
More informationUniversity of Texas at Dallas. Department of Electrical Engineering. EEDG 6306  Application Specific Integrated Circuit Design
University of Texas at Dallas Department of Electrical Engineering EEDG 6306  Application Specific Integrated Circuit Design Synopsys Tools Tutorial By Zhaori Bi Minghua Li Fall 2014 Table of Contents
More informationClassnotes 5: 1. Design and Information Flow A data flow diagram (DFD) is a graphical technique that is used to depict information flow, i.e.
Classnotes 5: 1. Design and Information Flow A data flow diagram (DFD) is a graphical technique that is used to depict information flow, i.e., a representation of information as a continuous flow that
More informationENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 112 Intro to Electrical and Computer Engineering Lecture 19 Sequential Circuits: Latches Overview Circuits require memory to store intermediate data Sequential circuits use a periodic signal to determine
More informationInformation Science 1
Topics covered Information Science 1 Terms and concepts from Week 05 The software development process Program'Development /Algorithms'and'Problem'Solving/'' ' software software life cycle lifecycle models
More informationSystemC Tutorial. John Moondanos. Strategic CAD Labs, INTEL Corp. & GSRC Visiting Fellow, UC Berkeley
SystemC Tutorial John Moondanos Strategic CAD Labs, INTEL Corp. & GSRC Visiting Fellow, UC Berkeley SystemC Introduction Why not leverage experience of C/C++ developers for H/W & System Level Design? But
More information1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.
File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one
More informationNMOS Digital Circuits. Introduction Static NMOS circuits Dynamic NMOS circuits
NMOS Digital Circuits Introduction Static NMOS circuits Dynamic NMOS circuits Introduction PMOS and NMOS families are based on MOS transistors with induced channel of p, respectively n NMOS circuits mostly
More informationLecture 3 APPLICATION OF SIMULATION IN SERVICE OPERATIONS MANAGEMENT
Lecture 3 APPLICATION OF SIMULATION IN SERVICE OPERATIONS MANAGEMENT Learning Objective To discuss application of simulation in services 1. SIMULATION Simulation is a powerful technique for solving a wide
More informationSpecification and Analysis of Contracts Lecture 1 Introduction
Specification and Analysis of Contracts Lecture 1 Introduction Gerardo Schneider gerardo@ifi.uio.no http://folk.uio.no/gerardo/ Department of Informatics, University of Oslo SEFM School, Oct. 27  Nov.
More informationContent. Professur für Steuerung, Regelung und Systemdynamik. Lecture: Vehicle Dynamics Tutor: T. Wey Date: 01.01.08, 20:11:52
1 Content Overview 1. Basics on Signal Analysis 2. System Theory 3. Vehicle Dynamics Modeling 4. Active Chassis Control Systems 5. Signals & Systems 6. Statistical System Analysis 7. Filtering 8. Modeling,
More informationMECE 102 Mechatronics Engineering Orientation
MECE 102 Mechatronics Engineering Orientation Mechatronic System Components Associate Prof. Dr. of Mechatronics Engineering Çankaya University Compulsory Course in Mechatronics Engineering Credits (2/0/2)
More informationA Tool for Generating Partition Schedules of Multiprocessor Systems
A Tool for Generating Partition Schedules of Multiprocessor Systems HansJoachim Goltz and Norbert Pieth Fraunhofer FIRST, Berlin, Germany {hansjoachim.goltz,nobert.pieth}@first.fraunhofer.de Abstract.
More informationCOMBINING THE METHODS OF FORECASTING AND DECISIONMAKING TO OPTIMISE THE FINANCIAL PERFORMANCE OF SMALL ENTERPRISES
COMBINING THE METHODS OF FORECASTING AND DECISIONMAKING TO OPTIMISE THE FINANCIAL PERFORMANCE OF SMALL ENTERPRISES JULIA IGOREVNA LARIONOVA 1 ANNA NIKOLAEVNA TIKHOMIROVA 2 1, 2 The National Nuclear Research
More informationINVERSION OF NONLINEAR AND TIMEVARYING SYSTEMS. Thomas A. Baran and Alan V. Oppenhiem
INVERSION OF NONINEAR AND TIMEVARYING SYSTEMS Thomas A Baran and Alan V Oppenhiem Massachusetts Institute of Technology Digital Signal Processing Group 77 Massachusetts Avenue, Cambridge MA 02139 tbaran@mitedu,
More informationVirtual Time and Timeout in ClientServer Networks
Virtual Time and Timeout in ClientServer Networks Jayadev Misra July 13, 2011 Contents 1 Introduction 2 1.1 Background.............................. 2 1.1.1 Causal Model of Virtual Time...............
More informationICECCS 08/Workshop «UML&AADL 2008», April, 2, 2008
Contractbased approach to analyze software components Abdelhafid Zitouni Lionel SEINTURIER Mahmoud BOUFAIDA Laboratory LIRE LIFLINRIA ADAM Laboratory LIRE University of Constantine University of Lille
More informationComputer Science. Requirements for the Major (updated 11/13/03)
Computer Science Faculty: Knox Chair; Komagata,, Martinovic, Neff, Sampath, Wolz Faculty from mathematics with joint teaching appointments in computer science: Conjura, Greenbaun, Iannone The computer
More informationJMulTi/JStatCom  A Data Analysis Toolkit for Endusers and Developers
JMulTi/JStatCom  A Data Analysis Toolkit for Endusers and Developers Technology White Paper JStatCom Engineering, www.jstatcom.com by Markus Krätzig, June 4, 2007 Abstract JStatCom is a software framework
More informationLoad Balancing on a Nondedicated Heterogeneous Network of Workstations
Load Balancing on a Nondedicated Heterogeneous Network of Workstations Dr. Maurice Eggen Nathan Franklin Department of Computer Science Trinity University San Antonio, Texas 78212 Dr. Roger Eggen Department
More informationOPNET Network Simulator
Simulations and Tools for Telecommunications 521365S: OPNET Network Simulator Jarmo Prokkola Research team leader, M. Sc. (Tech.) VTT Technical Research Centre of Finland Kaitoväylä 1, Oulu P.O. Box 1100,
More informationJames B. Fenwick, Jr., Program Director and Associate Professor Ph.D., The University of Delaware FenwickJB@appstate.edu
118 Master of Science in Computer Science Department of Computer Science College of Arts and Sciences James T. Wilkes, Chair and Professor Ph.D., Duke University WilkesJT@appstate.edu http://www.cs.appstate.edu/
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 8, August 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Development of
More informationContent Map For Career & Technology
Content Strand: Applied Academics CTET11 analysis of electronic A. Fractions and decimals B. Powers of 10 and engineering notation C. Formula based problem solutions D. Powers and roots E. Linear equations
More informationNetwork Virtualization and Data Center Networks 263382500 Data Center Virtualization  Basics. Qin Yin Fall Semester 2013
Network Virtualization and Data Center Networks 263382500 Data Center Virtualization  Basics Qin Yin Fall Semester 2013 1 Walmart s Data Center 2 Amadeus Data Center 3 Google s Data Center 4 Data Center
More informationList of courses MEngg (Computer Systems)
List of courses MEngg (Computer Systems) Course No. Course Title NonCredit Courses CS401 CS402 CS403 CS404 CS405 CS406 Introduction to Programming Systems Design System Design using Microprocessors
More information1: B asic S imu lati on Modeling
Network Simulation Chapter 1: Basic Simulation Modeling Prof. Dr. Jürgen Jasperneite 1 Contents The Nature of Simulation Systems, Models and Simulation Discrete Event Simulation Simulation of a SingleServer
More informationOpenFOAM Optimization Tools
OpenFOAM Optimization Tools Henrik Rusche and Aleks Jemcov h.rusche@wikkigmbh.de and a.jemcov@wikki.co.uk Wikki, Germany and United Kingdom OpenFOAM Optimization Tools p. 1 Agenda Objective Review optimisation
More informationANALYTICS IN BIG DATA ERA
ANALYTICS IN BIG DATA ERA ANALYTICS TECHNOLOGY AND ARCHITECTURE TO MANAGE VELOCITY AND VARIETY, DISCOVER RELATIONSHIPS AND CLASSIFY HUGE AMOUNT OF DATA MAURIZIO SALUSTI SAS Copyr i g ht 2012, SAS Ins titut
More informationhochschule fu r angewandte wissenschaften hamburg Prof. Dr. B. Schwarz FB Elektrotechnik/Informatik
Counters Counters are used for many functions in digital systems, for example, counting the number of occurrences of an event, storing the address of the current instruction of a microprocessor or calculating
More informationChapter 5: Sequential Circuits (LATCHES)
Chapter 5: Sequential Circuits (LATCHES) Latches We focuses on sequential circuits, where we add memory to the hardware that we ve already seen Our schedule will be very similar to before: We first show
More informationParallel Databases. Parallel Architectures. Parallelism Terminology 1/4/2015. Increase performance by performing operations in parallel
Parallel Databases Increase performance by performing operations in parallel Parallel Architectures Shared memory Shared disk Shared nothing closely coupled loosely coupled Parallelism Terminology Speedup:
More informationBSEE Degree Plan Bachelor of Science in Electrical Engineering: 201516
BSEE Degree Plan Bachelor of Science in Electrical Engineering: 201516 Freshman Year ENG 1003 Composition I 3 ENG 1013 Composition II 3 ENGR 1402 Concepts of Engineering 2 PHYS 2034 University Physics
More informationComputer Network. Interconnected collection of autonomous computers that are able to exchange information
Introduction Computer Network. Interconnected collection of autonomous computers that are able to exchange information No master/slave relationship between the computers in the network Data Communications.
More informationCOEN4720 Embedded Systems Design Lecture 1 Introduction Fall 2016. Cristinel Ababei Dept. of Electrical and Computer Engineering Marquette University
COEN4720 Embedded Systems Design Lecture 1 Introduction Fall 2016 Cristinel Ababei Dept. of Electrical and Computer Engineering Marquette University 1 Outline What is an Embedded System (ES) Examples
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 44 Objectives In this lecture we will introduce: 1. Synchronous
More informationLabVIEW Based Embedded Design
LabVIEW Based Embedded Design Sadia Malik Ram Rajagopal Department of Electrical and Computer Engineering University of Texas at Austin Austin, TX 78712 malik@ece.utexas.edu ram.rajagopal@ni.com Abstract
More informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationWorking with combinational logic
Working with combinational logic Simplification twolevel simplification exploiting don t cares algorithm for simplification Logic realization twolevel logic and canonical forms realized with NNs and
More information3 Signals and Systems: Part II
3 Signals and Systems: Part II Recommended Problems P3.1 Sketch each of the following signals. (a) x[n] = b[n] + 3[n  3] (b) x[n] = u[n]  u[n  5] (c) x[n] = 6[n] + 1n + (i)2 [n  2] + (i)ag[n  3] (d)
More informationDigital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill
Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Objectives: Analyze the operation of sequential logic circuits. Understand the operation of digital counters.
More information