1. Be able to do System Level Designs by: 2. Become proficient in a hardware-description language (HDL)
|
|
- Douglas Cameron
- 6 years ago
- Views:
Transcription
1 Ojetives CENG53 Digitl Sstem Design Digitl Mhine Design Overview 1. Be le to do Sstem Level Designs : Mstering design issues in ottom-up fshion nd Designing sstems for speifi pplitions in top-down methodolog reognizing the differenes etween: Behviorl nd Struturl pprohes Simultion nd Snthesis of digitl designs Controlpth nd Dtpth designs. 2. Beome profiient in hrdwre-desription lnguge (HDL) to simulte nd to snthesize digitl designs. 3. Be fmilir with design utomtion tools to relize the ove ojetive 1 2 Speifition: Informl (English), Forml (C,, Verilog) Design Snthesis: Levels of Design Speifitions Sstem snthesis: Speifitions Arhiteture snthesis: Algorithms Sequentil snthesis: Finite-Stte Mh. Logi snthesis: Boolen expressions Tehnolog mpping: The logi ehvior Design Anlsis: proessors, memor, ASIC, registers, dders, gtes nd flip-flops gte level omponents trnsistor nd lout (CMOS, ) ensure tht design meets spes nd testle Sheduling Unit Binding Stte Minimiztion FSM Snthesis Tehnolog Mpping Ple nd Route Behviorl HDL Desription Register Trnsfer Level Gte Level Trnsistor/ Lout Level Prtitioning Hrdwre Allotion Optimiztion Logi Snthesis Trnsistor Optimiztion Interonnet Optimiztion 3 Digitl Mhine 1
2 Levels of Hrdwre Snthesis Rnge of Design Stles Custom Design Stndrd Cell Gte Arr/FPGA/CPLD Arhiteturl Level Logi Level Ciruit Level (i: 1..16) :: sum = sum*z 1 + oeff[i]*in*z 1 Arhiteture Snthesis stte Logi Snthesis t p x Ciruit Snthesis Custom Control Logi Custom ALU Custom Register File Gtes Stndrd ALU Stndrd Registers Gtes Routing Chnnel Gtes Routing Chnnel Gtes mem * fsm D x Performne Design Complexit (Design Time) Compt Longer wires 5 6 Sstem Definition Copright 1995, 1996 RASSP E&F Primril softwre Funtion Design HW & SW CODESIGN Rodmp RASSP DESIGN LIBRARIES AND DATABASE HW - SW Prtitioning VIRTUAL PROTOTYPE HW DESIGN SW DESIGN HW FAB SW CODE Primril hrdwre Integrtion & TEST Rpid Prototping of Applition Speifi Signl Proessors Progrm Hrdwre Desription Lnguge From struturl to ehviorl design: Flexiilit Reusilit Lrge nd omplex digitl sstems: Costl prototpes Anlsis nd simultion of hrdwre nd softwre Different models different designers: Inonsistenies etween different models Loss of informtion Different tools for different models Redesign of digitl sstems: > $10 illions / er 7 8 Digitl Mhine 2
3 Wh HDL? A unified environment Top-down trnsition in step-wise mnner An integrted nlsis nd design Performne, dependilit, nd funtionl modeling t ll levels Flexiilit to model digitl sstems t mn different levels of desription VHSIC (Ver High Speed Integrted Ciruit) Hrdwre Desription Lnguge IEEE : IEEE stndrd speifition lnguge for desriing digitl hrdwre used industr worldwide Enles hrdwre modeling from the gte to sstem level Provides mehnism for digitl design nd reusle design doumenttion 9 10 Histor 1983: A tem of Intermetris, IBM nd TI were wrded ontrt to develop 1985: The finl version of the lnguge under government ontrt ws relesed: Version 7.2 Design Exmple: Speifitions Design single it hlf dder with rr nd enle Inputs nd outputs re eh one it When enle is high, result gets x plus When enle is high, rr gets n rr of x plus 1987: eme IEEE Stndrd nd in 1988 n ANSI stndrd 1993: ws restndrdized to lrif nd enhne the lnguge Outputs re zero when enle input is low x enle sum rr Digitl Mhine 3
4 Exmple: Entit Delrtion Exmple: Behviorl Speifition First step, the entit delrtion desries the interfe of the omponent input nd output ports. Desrie the funtion of the dder tht n e simulted to verif orret funtionlit of the omponent ENTITY hlf_dder IS PORT(x,, enle: IN BIT; rr, sum: OUT BIT); END hlf_dder; x sum rr enle ARCHITECTURE hlf_dder_ OF hlf_dder IS PROCESS (x,, enle) IF enle = 1 THEN result <= x XOR ; rr <= x AND ; ELSE rr <= 0 ; result <= 0 ; END IF; END PROCESS; END hlf_dder_; 13 1 Exmple: Dt Flow Speifition Use logi equtions to develop dt flow desription tht n e simulted t this level to onfirm the logi equtions Exmple: Struturl Speifition from predesried omponents (lirr) ARCHITECTURE hlf_dder_ OF hlf_dder IS COMPONENT nd2 PORT (in0, in1 : IN BIT; out0 : OUT BIT); END COMPONENT; COMPONENT nd3 PORT (in0, in1, in2 : IN BIT; out0 : OUT BIT); END COMPONENT; ARCHITECTURE hlf_dder_ OF hlf_dder IS rr <= enle AND (x AND ); result <= enle AND (x XOR ); END hlf_dder_; COMPONENT xor2 PORT (in0, in1 : IN BIT; out0 : OUT BIT); END COMPONENT; FOR ALL : nd2 USE ENTITY gte_li.nd2_nt(nd2_); FOR ALL : nd3 USE ENTITY gte_li.nd3_nt(nd3_); FOR ALL : xor2 USE ENTITY gte_li.xor2_nt(xor2_); SIGNAL xor_res : BIT; -- internl signl A0 : nd2 PORT MAP (enle, xor_res, result); A1 : nd3 PORT MAP (x,, enle, rr); X0 : xor2 PORT MAP (x,, xor_res); END hlf_dder_; Digitl Mhine
5 Conurrent/Sequentil Sttements Exmples: Flip/Flops Comintionl Logi - Conurrent Sttements (Dtflow) Boolen Equtions (onurrent or sequentil); Logil Opertors; Reltionl Opertors; With-Selet-When (~Cse), When-Else (~ If-Then); Aggregte nd Contention, Don t Cre omprisons Rising edge triggered D flip-flop: q <= d WHEN (lk EVENT AND lk = 1 ) ELSE q; Comintionl Logi - Sequentil Sttements (Behviorl) Flling edge triggered D flip-flop: If-Then-Else (~ When-Else), Cse-When (~ With-Selet); Implied Lth Sequentil Logi (onurrent or sequentil) Cloking, Wit-Until, Rising_edge(); Reset/Preset, Asn/Sn; Registers; Arithmeti Opertors, Counters; Three-Stte Buffers, Bidiretionl Buses; For-Generte; For Loop, While Loop, Next, Exit q <= d WHEN (lk EVENT AND lk = 0 ) ELSE q; Pulse triggered D lth: q <= d WHEN (lk = 1 ) ELSE q; Rising edge triggered T flip-flop: q <= NOT q WHEN (lk EVENT AND lk = 1 ) ELSE q; An exmple: Adder Bsis Entit - Arhiteture Struture Entit Delrtions (Ports) Stles Effets of Stle on Snthesis Modeling for Simultion Timing Conepts Resolution Funtions Dt Ojets Identifiers, Tpes, Attriutes Exmple Digitl Mhine 5
6 Exmple Code Model it, 2-to-1 Multiplexer 2 ENTITY mmux1 IS 3 PORT (,: IN it_vetor(3 DOWNTO 0); --inputs sel: IN it; 5 : OUT it_vetor(3 DOWNTO 0)); --output 6 END mmux1; 7 8 ARCHITECTURE ehvior OF mmux1 IS 9 10 mux: PROCESS (,,sel) IF sel = 0 THEN <= ; 13 ELSE <= ; 1 END IF; 15 END PROCESS mux; 16 END ehvior; sel Smol 21 Entit Entit Delrtion (Interfe) (Funtion) 22 Devie Model Ports- externl onnetion points tht hve lss, tpe, nd mode Single-proess Entit: <= ( AND ) OR (NOT ) Entit- olletion of onurrent proesses tht desrie the funtion Multiple-proess Entit: Entit Delrtion Entit Delrtion defines externl interfe to this entit or devie omes efore the rhiteture setion Bsi entit sntx: t1 <= AND t2 <= NOT t1 t2 <= t1 OR t2 ENTITY entit_nme IS PORT (port1, port2: MODE TYPE; port3, port: MODE TYPE; port5: MODE TYPE); END entit_nme; 23 2 Digitl Mhine 6
7 Ports Port Delrtion is primr ontent of the Entit Delrtion Eh port represents either externl pin(s) of the devie, or wire(s) onneting two or more entities within omplete devie Eh port hs Port nme (identifier ou rete) Mode (diretion) Port Tpes Ports re lws signls (others: vriles, onstnts, files) Tpes useful for snthesis nd simultion it, it_vetor std_logi, std_logi_vetor oolen integer Tpe (kind of vlues possile) ENTITY entit_nme IS PORT (port1, port2: MODE TYPE; port3, port: MODE TYPE; port5: MODE TYPE); END entit_nme; Tpes onl useful for simultion rel time defines the funtion of the entit follows the entit delrtion Bsi rhiteture sntx: Levels of strtion ( stles) ehviorl dtflow struturl ARCHITECTURE rh_nme OF entit_nme IS CONCURRENT_STATEMENT1; CONCURRENT_STATEMENT2; END rh_nme ; An rhiteture m e written entirel in one stle, or in mixture of stles (more ommon) Vrious stles llow designer to desrie the funtion of devie in the simplest or most nturl form Digitl Mhine 7
8 1- Behviorl Stle 1- Behviorl Stle High-level, Algorithmi Es to write nd understnd Proess with sequentil sttements - order is importnt! Exeutes in zero simultion time ARCHITECTURE ehvior OF mmux1 IS mux: PROCESS (,,sel) IF sel = 0 THEN <= ; ELSE <= ; END IF; END PROCESS mux; END ehvior; Another ehviorl desription of sme devie ARCHITECTURE ehvior2 OF mmux1 IS PROCESS (,,sel) <= ; IF sel = 1 THEN <= ; END IF; END PROCESS; END ehvior2; Dtflow Stle 2- Dtflow Stle RTL (Register Trnsfer Lnguge) stle M e hrder to write nd understnd Multiple onurrent signl ssignment sttements Exeutes in non-zero simultion time ARCHITECTURE dtflow OF mmux1 IS <= WHEN (sel = 0 ) ELSE ; END dtflow ; Another dtflow desription of sme devie Conurrent sttements - order is irrelevnt ARCHITECTURE oolen_dtflow OF mmux1 IS (3) <= ((3) AND NOT sel) OR ((3) AND sel); (2) <= ((2) AND NOT sel) OR ((2) AND sel); (1) <= ((1) AND NOT sel) OR ((1) AND sel); (0) <= ((0) AND NOT sel) OR ((0) AND sel); END oolen_ dtflow ; Digitl Mhine 8
9 3- Struturl Stle Low-level, netlist - omponent instntitions nd wiring Essentill the text version of shemti Hierrhil Uses pkge of pre-defined lower-level omponents M e hrd to write nd understnd (ver detiled nd low level) No Proess or onurrent signl ssignment sttements 3- Struturl Stle USE work.gtes_pkg.ll; ARCHITECTURE struturl OF mmux1 IS SIGNAL t, t: it_vetor (3 downto 0); SIGNAL seln: it; u0: nd2 PORT MAP ((3),seln, t(3)); u1: nd2 PORT MAP ((2),seln, t(2)); u2: nd2 PORT MAP ((1),seln, t(1)); u3: nd2 PORT MAP ((0),seln, t(0)); u: nd2 PORT MAP ((3),sel, t(3)); u5: nd2 PORT MAP ((2),sel, t(2)); u6: nd2 PORT MAP ((1),sel, t(1)); u7: nd2 PORT MAP ((0),sel, t(0)); u8: or2 PORT MAP (t(3), t(3), (3)); u9: or2 PORT MAP (t(2), t(2), (2)); u10: or2 PORT MAP (t(1), t(1), (1)); u11: or2 PORT MAP (t(0), t(0), (0)); u12: not PORT MAP (sel, seln); END struturl; 33 3 Digitl Mhine 9
CMPUT101 Introduction to Computing - Summer 2002
CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,
More informationClass 04 MUX / DMUX and Full Adder
lss 4 MUX / DMUX nd Full dder June 3, 23 2 Multiplexer MUX S S Y D D D 2 D 3 S S Y 3 D 3 D 3 D 23 D 33 Y 2 D 2 D 2 D 22 D 32 Y D D D 2 D 3 Y D D D 2 D 3 June 3, 23 3 Multiplexer MUX ENTITY mux4sel IS s:
More informationc s ha2 c s Half Adder Figure 2: Full Adder Block Diagram
Adder Tk: Implement 2-it dder uing 1-it full dder nd 1-it hlf dder omponent (Figure 1) tht re onneted together in top-level module. Derie oth omponent in VHDL. Prepre two implementtion where VHDL omponent
More informationCompiling a Parallel DSL to GPU
Compiling Prllel DSL to GPU Rmesh Nrynswmy Bdri Gopln Synopsys In. Synopsys 2012 1 Agend Overview of Verilog Simultion Prllel Verilog Simultion Algorithms Prllel Simultion Trdeoffs on GPU Chllenges Synopsys
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More informationDon Thomas, 1998, Page 1
The Verilog Hrdwre Desription Lnguge Professor Don Thoms Crnegie Mellon University (CMU) thoms@ee.mu.edu http://www.ee.mu.edu/~thoms This is not one ohesive presenttion on Verilog. The slides ontined here
More informationIntroduction to hardware design using VHDL
Introuction to hrwre esign using VHDL Tim Güneysu n Nele Mentens ECC school Novemer 11, 2017, Nijmegen Outline Implementtion pltforms Introuction to VHDL Hrwre tutoril 1 Implementtion pltforms Microprocessor
More informationCS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.
CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over
More informationUTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS
UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-
More informationPattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions
Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its
More informationOutline. Activity 2. Activity 2. Structured Design. Coping with Complexity. Lecture 2: MIPS Processor Example. Introduction to CMOS VLSI Design
Introdution to COS VLSI Design Leture : IPS Proessor Emple Dvid Hrris Outline Design Prtitioning IPS Proessor Emple Arhiteture irorhiteture Logi Design Ciruit Design Physil Design Frition, Pkging, Testing
More informationShared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion
Tody s Outline Arhitetures Progrmming nd Synhroniztion Disuss pper on Cosmi Cube (messge pssing) Messge pssing review Cosmi Cube disussion > Messge pssing mhine Shred memory model > Communition > Synhroniztion
More informationError Numbers of the Standard Function Block
A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution
More informationDistributed Systems Principles and Paradigms
Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,
More informationDistributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems
Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationConcepts Introduced. A 1-Bit Logical Unit. 1-Bit Half Adder (cont.) 1-Bit Half Adder
oncepts Introduced A -Bit Logicl Unit sic rithmetic/logic unit clocks ltches nd ip-ops registers SRAMs nd RAMs nite stte mchines Below is -it logicl unit tht performs AN nd OR opertions Both the AN nd
More informationPackage Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation
A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model
More informationCS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
More informationToday s Lecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Recursive Example. Review: The C / C++ code. Recursive Example (Continued)
Tod s Lecture Bsics of Logic Design: Boolen Alger, Logic Gtes Alvin R. Leeck CPS 4 Lecture 8 Homework #2 Due Ferur 3 Outline Review (sseml recursion) Building the uilding locks Logic Design Truth tles,
More informationIntroduction to Computer Engineering EECS 203 dickrp/eecs203/ CMOS transmission gate (TG) TG example
Introduction to Computer Engineering EECS 23 http://ziyng.eecs.northwestern.edu/ dickrp/eecs23/ CMOS trnsmission gte TG Instructor: Robert Dick Office: L477 Tech Emil: dickrp@northwestern.edu Phone: 847
More informationClass Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414
Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro
More informationINTEGRATED WORKFLOW ART DIRECTOR
ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures
More informationCOSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview
COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition
More informationBasics of Logic Design Arithmetic Logic Unit (ALU)
Bsics of Logic Design Arithmetic Logic Unit (ALU) CPS 4 Lecture 9 Tody s Lecture Homework #3 Assigned Due Mrch 3 Project Groups ssigned & posted to lckord. Project Specifiction is on We Due April 9 Building
More informationLINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION
Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil
More informationSpecification, Implementation and Verification of High-Grade Cryptographic Applications
Cryptol Speifition, Implementtion nd Verifition of High-Grde Cryptogrphi Applitions CACE 2008, Porto Lee Pike leepike@glois.om he Cryptol tem, pst nd present: Slly Browning, Levent Erkok, Sigjorn inne,
More informationParallelization Optimization of System-Level Specification
Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion
More informationCS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08
CS412/413 Introduction to Compilers Tim Teitelum Lecture 4: Lexicl Anlyzers 28 Jn 08 Outline DFA stte minimiztion Lexicl nlyzers Automting lexicl nlysis Jlex lexicl nlyzer genertor CS 412/413 Spring 2008
More informationType Checking. Roadmap (Where are we?) Last lecture Context-sensitive analysis. This lecture Type checking. Symbol tables
Type Cheking Rodmp (Where re we?) Lst leture Contet-sensitie nlysis Motition Attriute grmmrs Ad ho Synt-direted trnsltion This leture Type heking Type systems Using synt direted trnsltion Symol tles Leil
More informationDescribing Combinational circuits in BSV
Decriing Comintionl circuit in BSV Arvind Computer Science & Artificil Intelligence L. Mchuett Intitute of Technology Ferury 13, 2018 http://cg.cil.mit.edu/6.s084 L03-1 Three imple comintionl circuit NOT
More informationMcAfee Web Gateway
Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This
More informationCOMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:
In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationGeorge Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables
George Boole IT 3123 Hrdwre nd Softwre Concepts My 28 Digitl Logic The Little Mn Computer 1815 1864 British mthemticin nd philosopher Mny contriutions to mthemtics. Boolen lger: n lger over finite sets
More informationCS553 Lecture Introduction to Data-flow Analysis 1
! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow
More informationCOSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup
COSC 6374 Prllel Computtion Communition Performne Modeling (II) Edgr Griel Fll 2015 Overview Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition Impt of olletive ommunition
More informationComparison between nmos Pass Transistor logic style vs. CMOS Complementary Cells*
Comprison etween nmos Pss Trnsistor logi style vs. CMOS Complementry Cells* Rkesh Mehrotr, Mssoud Pedrm Xunwei Wu Dept. of E.E.-Systems Dept. of Eletroni Eng. University of Southern Cliforni Hngzhou University
More information6/23/2011. Review: IEEE-754. CSE 2021: Computer Organization. Exercises. Examples. Shakil M. Khan (adapted from Profs. Roumani & Asif)
6/23/2 CSE 22: Computer Orgniztion Lecture-8() Floting point computing (IEEE 754) Review: IEEE-754 single: 8 its doule: its single: 23 its doule: 52 its S Exponent Frction S x ( ) ( Frction) 2 (Exponent
More informationCombinational Logic in a Dataflow Style
ÄÄÄ Why HDLs? Why HDLs? Digitl Design with Synthesizble VHDL Prof. Stephen A. Edwrds sedwrds@cs.columbi.edu Columbi University Spring 2008 1970s: SPICE trnsistor-level netlists An XOR built from four NAND
More informationbox Boxes and Arrows 3 true 7.59 'X' An object is drawn as a box that contains its data members, for example:
Boxes nd Arrows There re two kinds of vriles in Jv: those tht store primitive vlues nd those tht store references. Primitive vlues re vlues of type long, int, short, chr, yte, oolen, doule, nd flot. References
More informationMatrices and Systems of Equations
Mtrices Mtrices nd Sstems of Equtions A mtri is rectngulr rr of rel numbers. CHAT Pre-Clculus Section 8. m m m............ n n n mn We will use the double subscript nottion for ech element of the mtri.
More informationUT1553B BCRT True Dual-port Memory Interface
UTMC APPICATION NOTE UT553B BCRT True Dul-port Memory Interfce INTRODUCTION The UTMC UT553B BCRT is monolithic CMOS integrted circuit tht provides comprehensive MI-STD- 553B Bus Controller nd Remote Terminl
More information[SYLWAN., 158(6)]. ISI
The proposl of Improved Inext Isomorphi Grph Algorithm to Detet Design Ptterns Afnn Slem B-Brhem, M. Rizwn Jmeel Qureshi Fulty of Computing nd Informtion Tehnology, King Adulziz University, Jeddh, SAUDI
More informationEnterprise Digital Signage Create a New Sign
Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their
More informationExample: 2:1 Multiplexer
Exmple: 2:1 Multiplexer Exmple #1 reg ; lwys @( or or s) egin if (s == 1') egin = ; else egin = ; 1 s B. Bs 114 Exmple: 2:1 Multiplexer Exmple #2 Normlly lwys include egin nd sttements even though they
More informationInternet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.
omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to
More informationCS453 INTRODUCTION TO DATAFLOW ANALYSIS
CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register
More informationMidterm Exam CSC October 2001
Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not
More informationEnginner To Engineer Note
Technicl Notes on using Anlog Devices DSP components nd development tools from the DSP Division Phone: (800) ANALOG-D, FAX: (781) 461-3010, EMAIL: dsp_pplictions@nlog.com, FTP: ftp.nlog.com Using n ADSP-2181
More informationIncremental Design Debugging in a Logic Synthesis Environment
Inrementl Design Deugging in Logi Synthesis Environment Andres Veneris Jing Brndon Liu University of Toronto Freesle Semiondutors Dept ECE nd CS High Performne Tools Group Toronto, ON M5S 3G4 Austin, TX
More informationRolling Back Remote Provisioning Changes. Dell Command Integration for System Center
Rolling Bk Remote Provisioning Chnges Dell Commn Integrtion for System Center Notes, utions, n wrnings NOTE: A NOTE inites importnt informtion tht helps you mke etter use of your prout. CAUTION: A CAUTION
More informationFrom Dependencies to Evaluation Strategies
From Dependencies to Evlution Strtegies Possile strtegies: 1 let the user define the evlution order 2 utomtic strtegy sed on the dependencies: use locl dependencies to determine which ttriutes to compute
More information6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.
6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem
More informationA Formalism for Functionality Preserving System Level Transformations
A Formlism for Functionlity Preserving System Level Trnsformtions Smr Abdi Dniel Gjski Center for Embedded Computer Systems UC Irvine Center for Embedded Computer Systems UC Irvine Irvine, CA 92697 Irvine,
More informationMcAfee Network Security Platform
Pssive Fil-Open Kit Quik Strt Guide Revision D MAfee Network Seurity Pltform MAfee Network Seurity Pltform IPS Sensors, when deployed in-line, route ll inoming trffi through designted port pir. However,
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationAn Efficient 8b/10b Encoder and Decoder Design using Reversible Logic Gates
Interntionl Journl of Eletril Eletronis & Computer Siene Engineering Volume 4, Issue 6 (Deemer, 207) E-ISSN : 2348-2273 P-ISSN : 2454-222 Aville Online t www.ijeese.om An Effiient 8/0 Enoder nd Deoder
More informationRegister Transfer Level (RTL) Design
CSE4: Components nd Design Techniques for Digitl Systems Register Trnsfer Level (RTL) Design Tjn Simunic Rosing Where we re now Wht we hve covered lst time: Register Trnsfer Level (RTL) design Wht we re
More informationDigital Signal Processing: A Hardware-Based Approach
Digitl Signl Processing: A Hrdwre-Bsed Approch Roert Esposito Electricl nd Computer Engineering Temple University troduction Teching Digitl Signl Processing (DSP) hs included the utilition of simultion
More informationSection 5.3 : Finding Area Between Curves
MATH 9 Section 5. : Finding Are Between Curves Importnt: In this section we will lern just how to set up the integrls to find re etween curves. The finl nswer for ech emple in this hndout is given for
More informationLecture 5: Spatial Analysis Algorithms
Lecture 5: Sptil Algorithms GEOG 49: Advnced GIS Sptil Anlsis Algorithms Bsis of much of GIS nlsis tod Mnipultion of mp coordintes Bsed on Eucliden coordinte geometr http://stronom.swin.edu.u/~pbourke/geometr/
More informationLexical Analysis: Constructing a Scanner from Regular Expressions
Lexicl Anlysis: Constructing Scnner from Regulr Expressions Gol Show how to construct FA to recognize ny RE This Lecture Convert RE to n nondeterministic finite utomton (NFA) Use Thompson s construction
More informationTool Vendor Perspectives SysML Thus Far
Frontiers 2008 Pnel Georgi Tec, 05-13-08 Tool Vendor Perspectives SysML Thus Fr Hns-Peter Hoffmnn, Ph.D Chief Systems Methodologist Telelogic, Systems & Softwre Modeling Business Unit Peter.Hoffmnn@telelogic.com
More informationVMware Horizon FLEX Administration Guide
VMwre Horizon FLEX Administrtion Guide Horizon FLEX 1.6 This doument supports the version of eh produt listed nd supports ll susequent versions until the doument is repled y new edition. To hek for more
More informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
More informationCOMP108 Algorithmic Foundations
Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother
More informationQuestions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?
Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?
More informationCOMPUTER SCIENCE 123. Foundations of Computer Science. 6. Tuples
COMPUTER SCIENCE 123 Foundtions of Computer Science 6. Tuples Summry: This lecture introduces tuples in Hskell. Reference: Thompson Sections 5.1 2 R.L. While, 2000 3 Tuples Most dt comes with structure
More informationMcAfee Data Loss Prevention Prevent
Quik Strt Guide Revision B MAfee Dt Loss Prevention Prevent version 10.x This quik strt guide provides high-level instrutions for setting up MAfee Dt Loss Prevention Prevent (MAfee DLP Prevent) hrdwre
More informationASTs, Regex, Parsing, and Pretty Printing
ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,
More informationSummer Review Packet For Algebra 2 CP/Honors
Summer Review Pcket For Alger CP/Honors Nme Current Course Mth Techer Introduction Alger uilds on topics studied from oth Alger nd Geometr. Certin topics re sufficientl involved tht the cll for some review
More informationSoftware Configuration Management
Softwre Configurtion Mngement Leture: Introdution SCM Chpters: 1, 2 nd 3 René Krikhr Niels Veermn Leture Objetives Lern bout SCM nd history of SCM Lern the reltion between SCM nd Softwre development proess
More informationA Reconfigurable Arithmetic Datapath Architecture
A Reconfigurle Arithmetic Dtpth Architecture Reiner W. Hrtenstein, Riner Kress, Helmut Reinig University of Kiserslutern Erwin-Schrödinger-Strße, D-67663 Kiserslutern, Germny Fx: 49 631 205 2640, emil:
More informationThe Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline
CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The
More informationIZT DAB ContentServer, IZT S1000 Testing DAB Receivers Using ETI
IZT DAB ContentServer, IZT S1000 Testing DAB Receivers Using ETI Appliction Note Rel-time nd offline modultion from ETI files Generting nd nlyzing ETI files Rel-time interfce using EDI/ETI IZT DAB CONTENTSERVER
More informationthe machine and check the components AC Power Cord Carrier Sheet/ Plastic Card Carrier Sheet DVD-ROM
Quik Setup Guide Strt Here ADS-2100 Plese red the Produt Sfety Guide first efore you set up your mhine. Then, plese red this Quik Setup Guide for the orret setup nd instlltion. WARNING WARNING indites
More informationIntroduction to CMOS VLSI Design. Lecture 2: MIPS Processor Example. David Harris. Harvey Mudd College Spring Outline
Introduction to CMOS VLSI Design Lecture 2: MIPS Processor Exmple Dvid Hrris Hrvey Mudd College Spring 24 Outline Design Prtitioning MIPS Processor Exmple Architecture Microrchitecture Logic Design Circuit
More informationHIGH-LEVEL TRANSFORMATIONS DATA-FLOW MODEL OF COMPUTATION TOKEN FLOW IN A DFG DATA FLOW
1 2 Topis: * Dt-flow grphs * (Non)overlpped sheduling * Miniml itertion period Further reding: * Trnsformtions for speed-up * Trnsformtions for low power Prhi, K.K., High-Level Algorithm nd Arhiteture
More informationLab 1 - Counter. Create a project. Add files to the project. Compile design files. Run simulation. Debug results
1 L 1 - Counter A project is collection mechnism for n HDL design under specifiction or test. Projects in ModelSim ese interction nd re useful for orgnizing files nd specifying simultion settings. The
More informationthis grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
More informationArchitecture and Data Flows Reference Guide
Arhiteture nd Dt Flows Referene Guide BlkBerry UEM Version 12.7 Pulished: 2017-07-12 SWD-20170627140413745 Contents Aout this guide... 5 Arhiteture: BlkBerry UEM solution... 6 BlkBerry UEM omponents...
More information! Initially developed under DOD auspices, later standardized as IEEE standards , , & (standard logic data type)
VHDL Introduction, Part I Figures in this lecture are from: Rapid Prototyping of Digital Systems, Second Edition James O. Hamblen & Michael D. Furman, Kluwer cademic Publishers, 2001, ISN 0-7923-7439-8
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationEXPONENTIAL & POWER GRAPHS
Eponentil & Power Grphs EXPONENTIAL & POWER GRAPHS www.mthletics.com.u Eponentil EXPONENTIAL & Power & Grphs POWER GRAPHS These re grphs which result from equtions tht re not liner or qudrtic. The eponentil
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationArchitecture and Data Flows Reference Guide
Arhiteture nd Dt Flows Referene Guide BES12 Version 12.5 Pulished: 2016-06-29 SWD-20160620150844487 Contents Aout this guide... 5 Arhiteture: BES12 EMM solution... 6 BES12 omponents...8 Components used
More informationDefinition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
More informationAn introduction to model checking
An introduction to model checking Slide 1 University of Albert Edmonton July 3rd, 2002 Guy Trembly Dépt d informtique UQAM Outline Wht re forml specifiction nd verifiction methods? Slide 2 Wht is model
More informationMcAfee Network Security Platform
NS3x00 Quik Strt Guide Revision B MAfee Network Seurity Pltform This quik strt guide explins how to quikly set up nd tivte your MAfee Network Seurity Pltform NS3100 nd NS3200 Sensors in inline mode. These
More informationMITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam
Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...
More informationCOMMON HALF YEARLY EXAMINATION DECEMBER 2018
li.net i.net li.net i.net li.net i.net li.net i.net li.net i.net li.net i.net li.net i.net li.net i.net li.net i.net.pds.pds COMMON HALF YEARLY EXAMINATION DECEMBER 2018 STD : XI SUBJECT: COMPUTER SCIENCE
More informationLAB L Hardware Building Blocks
LAB L Hrdwre Building Blocks Perform the following groups of tsks: LL1.v 1. In previous l we creted the 2-to-1 mux shown in the left prt of the figure elow nd found tht it cts s n if sttement. c c 0 1
More informationLecture 8: Graph-theoretic problems (again)
COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V
More informationECEN 468 Advanced Logic Design Lecture 36: RTL Optimization
ECEN 468 Advnced Logic Design Lecture 36: RTL Optimiztion ECEN 468 Lecture 36 RTL Design Optimiztions nd Trdeoffs 6.5 While creting dtpth during RTL design, there re severl optimiztions nd trdeoffs, involving
More informationResource and Memory Management Techniques for the High-Level Synthesis of Software Threads into Parallel FPGA Hardware
Resoure n Memory Mngement Tehniques for the High-Level Synthesis of Softwre Thres into Prllel FPGA Hrwre Jongsok Choi, Stephen Brown, n Json Anerson ECE Deprtment, University of Toronto, Toronto, ON, Cn
More informationWORKSHOP 6 FRAME SURFACE MODEL ANALYSIS
WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS WS6-1 WS6-2 Workshop Ojetives Crete finite element moel (meshes; onnet jent elements; pply e los, operting los, n grvity los; onstrin noes) for intermeitely iffiult
More informationDigital Design. Chapter 6: Optimizations and Tradeoffs
Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com
More informationCSCE 531, Spring 2017, Midterm Exam Answer Key
CCE 531, pring 2017, Midterm Exm Answer Key 1. (15 points) Using the method descried in the ook or in clss, convert the following regulr expression into n equivlent (nondeterministic) finite utomton: (
More informationTroubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page
Trouleshooting This setion explins the following: Verify the Ciso Prime Collortion Provisioning Instlltion (for Advned or Stndrd Mode), pge 1 Upgrde the Ciso Prime Collortion Provisioning from Smll to
More information