Laboratory Exercise 6
|
|
- Primrose Cox
- 6 years ago
- Views:
Transcription
1 Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two way: firt by writing Verilog code that decribe the required functionality, and econd by making ue of predefined ubcircuit from Altera library of parameterized module (LPM). The reult produced for variou implementation will be compared, both in term of the circuit tructure and it peed of operation. Part I Conider again the four-bit ripple-carry adder circuit that wa ued in lab exercie 2; a diagram of thi circuit i reproduced in Figure 1a. You are to create an 8-bit verion of the adder and include it in the circuit hown in Figure 1b. Your circuit hould be deigned to upport igned number in 2 -complement form, and the Overflow output hould be et to 1 whenever the um produced by the adder doe not provide the correct igned value. Perform the tep hown below. c 3 c 2 c 1 c in FA FA FA FA c out a) Four-bit ripple-carry adder circuit 8 8 Clock R Q R Q A B Q D cout c out + ccin 8 R Q Overflow S b) Eight-bit regitered adder circuit Figure 1. An 8-bit igned adder with regitered input and output. 1
2 1. Make a new Quartu II project and write Verilog code that decribe the circuit in Figure 1b. Ue the circuit tructure in Figure 1a to decribe your adder. 2. Include the required input and output port in your project to implement the adder circuit on the DE2 board. Connect the input A and B to witche SW 15 8 and SW 7, repectively. Ue KEY a an active-low aynchronou reet input, and ue KEY 1 a a manual clock input. Diplay the um output of the adder on the red LEDR 7 light and diplay the overflow output on the green LEDG 8 light. The hexadecimal value of A and B hould be hown on the diplay HEX7-6 and HEX5-4, and the hexadecimal value of S hould appear on HEX Compile your code and ue timing imulation to verify the correct operation of the circuit. Once the imulation work properly, download the circuit onto the DE2 board and tet it by uing different value of A and B. Be ure to check for proper functionality of the Overflow output. 4. Open the Quartu II Compilation Report and examine the reult reported by the Timing Analyzer. What i the maximum operating frequency, fmax, of your circuit? What i the longet path in the circuit in term of delay? Part II Modify your circuit from Part I o that it can perform both addition and ubtraction of eight-bit number. Ue witch SW 16 to pecify whether addition or ubtraction hould be performed. Connect the other witche, light, and diplay a decribed for Part I. 1. Simulate your adder/ubtractor circuit to how that it function properly, and then download it onto the DE2 board and tet it by uing different witch etting. 2. Open the Quartu II Compilation Report and examine the reult reported by the Timing Analyzer. What i the fmax of your circuit? What i the longet path in the circuit in term of delay? Part III Repeat Part I uing the predefined adder circuit called lpm add ub, intead of your ripple-carry adder tructure from Figure 1. The lpm add ub module can be found in Altera library of parameterized module (LPM), which i provided a part of the Quartu II ytem. The procedure for uing thee predefined module in Quartu II project i decribed in the tutorial Uing Library Module in Verilog Deign, which i available on the DE2 Sytem CD and in the Univerity Program ection of Altera web ite. 1. Configure the lpm add ub module o that it perform only addition, to make the functionality comparable to Part I. Store your configuration of the lpm add ub module in the file lpm add8.v. After intantiating thi module in your Verilog code, compile the project and ue the Quartu II Chip Planner tool to examine ome of the detail of the implemented circuit. One way to examine the adder ubcircuit uing the Chip Planner tool i illutrated in Figure 2. In the Quartu II Project Navigator window right-click on the part of your circuit hierarchy that repreent the lpm add8 ubcircuit, and elect the command Locate > Locate in Chip Planner(Floor Plan & Chip Editor). Thi open the Chip Planner window hown in Figure 3. The logic element in the Cyclone II FPGA that are ued to implement the adder are highlighted in blue in the Chip Planner tool. Poition your moue pointer over any of thee logic element and double-click to open the Reource Property Editor window diplayed in Figure 4. In the box labeled Node name you can elect any of the nine logic element that implement the adder module. The Reource Property Editor allow you to examine the content of a logic element and to ee how one logic element i connected other. 2
3 Figure 2. Locating the eight-bit adder in the Chip Planner tool. Figure 3. The highlighted logic element for the eight-bit adder. Uing the tool decribed above, and referencing the Data Sheet information for the Cyclone II FPGA, decribe the eight-bit adder circuit implemented with the lpm add ub module. 3
4 Figure 4. Examining detail in a logic element uing the Reource Property Editor. 2. Open the Quartu II Compilation Report and and compare the fmax of your adder circuit with the one deigned in Part I. Dicu any difference in performance that are oberved. Part IV Repeat Part II uing the predefined adder circuit called lpm add ub, intead of your adder-ubtractor circuit baed on Figure 1. Comment briefly on the circuit tructure obtained uing the LPM module, and compare the fmax of thi circuit to the one from Part II. Decribe how the lpm add ub module implement the Overflow ignal. 4
5 Part V Figure 5a give an example of the traditional paper-and-pencil multiplication P = A B, where A = 12 and B =11. We need to add two ummand that are hifted verion of A to form the product P = 132. Part b of the figure how the ame example uing four-bit binary number. Since each digit in B i either 1 or, the ummand are either hifted verion of A or. Figure 5c how how each ummand can be formed by uing the Boolean AND operation of A with the appropriate bit in B. 1 2 x a) Decimal 1 1 x b) Binary x p 7 p 6 p 5 p 4 p 3 p 2 p 1 p c) Implementation Figure 5. Multiplication of binary number. A four-bit circuit that implement P = A B i illutrated in Figure 6. Becaue of it regular tructure, thi type of multiplier circuit i uually called an array multiplier. The haded area in the circuit correpond to the haded column in Figure 5c. In each row of the multiplier AND gate are ued to produce the ummand, and full adder module are ued to generate the required um. 5
6 b p 7 p 6 p 5 p 4 p 3 p 2 p 1 p Figure 6. An array multiplier circuit. Ue the following tep to implement the array multiplier circuit: 1. Create a new Quartu II project which will be ued to implement the deired circuit on the Altera DE2 board. 2. Generate the required Verilog file, include it in your project, and compile the circuit. 3. Ue functional imulation to verify that your code i correct. 4. Augment your deign to ue witche SW 11 8 to repreent the number A and witche SW 3 to repreent B. The hexadecimal value of A and B are to be diplayed on the 7-egment diplay HEX6 and HEX4, repectively. The reult P = A B i to be diplayed on HEX1 and HEX. 5. Aign the pin on the FPGA to connect to the witche and 7-egment diplay, a indicated in the Uer Manual for the DE2 board. 6. Recompile the circuit and download it into the FPGA chip. 7. Tet the functionality of your deign by toggling the witche and oberving the 7-egment diplay. 6
7 Part VI Extend your multiplier to multiply 8-bit number and produce 6-bit product. Ue witche SW 15 8 to repreent the number A and witche SW 7 to repreent B. The hexadecimal value of A and B are to be diplayed on the 7-egment diplay HEX7 6 and HEX5 4, repectively. The reult P = A B i to be diplayed on HEX3. Add regiter to your circuit to tore the value of A, B, and the product P, uing a imilar tructure a hown for the regitered adder in Figure 1. After uccefully compiling and teting your multiplier circuit, examine the reult produced by the Quartu II Timing Analyzer to determine the fmax of your circuit. What i the longet path in term of delay between regiter? Part VII Change your Verilog code to implement the 8 x 8 multiplier by uing the lpm mult module from the library of parameterized module in the Quartu II ytem. Complete the deign tep above. Compare the reult in term of the number of logic element (LE) needed and the circuit fmax. Part VIII It many application of digital circuit it i ueful to be able to perform ome number of multiplication and then produce a ummation of the reult. For thi part of the exercie you are to deign a circuit that perform the calculation S =(A B)+(C D) The input A, B, C, and D are eight-bit unigned number, and S provide 6-bit reult. Your circuit hould alo provide a carry-out ignal, C out. All of the input and output of the circuit hould be regitered, imilar to the tructure hown in Figure 1b. 1. Create a new Quartu II project which will be ued to implement the deired circuit on the Altera DE2 board. Ue the lpm mult and lpm add ub module to realize the multiplier and adder in your deign. 2. Connect the input A and C to witche SW 15 8 and connect the input B and D to witche SW 7. Ue witch SW 16 to elect between thee two et of input: A, B or C, D. Alo, ue the witch SW 17 a a write enable (WE) input. Setting WE to 1 hould allow data to be loaded into the input regiter when an active clock edge occur, while etting WE to hould prevent loading of thee regiter. 3. Ue KEY a an active-low aynchronou reet input, and ue KEY 1 a a manual clock input. 4. Diplay the hexadecimal value of either A or C, a elected by SW 16, on diplay HEX7-6 and diplay either B or D on HEX5-4. The um S hould be hown on HEX3-, and the C out ignal hould appear on LEDG Compile your code and ue either functional or timing imulation to verify that your circuit work properly. Then download the circuit onto the DE2 board and tet it operation. 6. It i often neceary to enure that a digital circuit i able to meet certain peed requirement, uch a a particular frequency of a ignal applied to a clock input. Such requirement are provided to a CAD ytem in the form of timing contraint. The procedure for uing timing contraint in the Quartu II CAD ytem i decribed in the tutorial Timing Conideration with Verilog-Baed Deign, which i available on the DE2 Sytem CD and in the Univerity Program ection of Altera web ite. For thi exercie we are uing a manual clock that i applied by a puhbutton witch, o no realitic timing requirement exit. But to demontrate the deign iue involved, aume that your circuit i required to operate with a clock frequency of 22 MHz. Enter thi frequency a a timing contraint in the Quartu II oftware, and recompile your project. The Timing Analyzer hould report that it i unable to meet the timing requirement due to the length of variou regiter-to-regiter path in the circuit. Examine the timing analyi report and decribe briefly the timing violation oberved. 7
8 7. One way to increae the peed of operation of a given circuit i to inert regiter into the circuit in a way that horten the length of it longet path. Thi technique i referred to a pipelining a circuit, and the inerted regiter are often called pipeline regiter. Inert pipeline regiter into your deign between the multiplier and the adder. Recompile your project and dicu the reult obtained. Part IX The Quartu II oftware include a predeigned module called altmult add that can perform calculation of the form S =(A B) +(C D). Repeat Part VIII uing thi module intead of the lpm mult and lpm add ub module. Tet your circuit uing both imulation and by downloading the circuit onto the DE2 board. Briefly decribe how the implementation of your circuit differ when uing the altmult add module. Examine it performance both with and without the pipeline regiter dicued in Part VIII. Copyright c 26 Altera Corporation. 8
Laboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationCourse Project: Adders, Subtractors, and Multipliers a
In the name Allah Department of Computer Engineering 215 Spring emeter Computer Architecture Coure Intructor: Dr. Mahdi Abbai Coure Project: Adder, Subtractor, and Multiplier a a The purpoe of thi p roject
More informationLaboratory Exercise 1
Laboratory Eercie Switche, Light, and Multipleer The purpoe of thi eercie i to learn how to connect iple input and output device to an FPGA chip and ipleent a circuit that ue thee device. We will ue the
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationDynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array
Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Januz A. Starzyk,Yongtao Guo, and Zhineng Zhu School of Electrical Engineering & Computer Science
More informationLaboratory Exercise 8
Laboratory Exercise 8 Memory Blocks In computer systems it is necessary to provide a substantial amount of memory. If a system is implemented using FPGA technology it is possible to provide some amount
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationSIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial
SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult
More informationDIGITAL LOGIC WITH VHDL (Fall 2013) Unit 4
DIGITAL LOGIC WITH VHDL (Fall 2013) Unit 4 Integer DATA TYPE STRUCTURAL DESCRIPTION Hierarchical deign: port-map, for-generate, ifgenerate. Eample: Adder, comparator, multiplier, Look-up Table, Barrel
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationSpring 2012 EE457 Instructor: Gandhi Puvvada
Spring 2012 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 2/17/2012, Friday in SLH200 Calculator and Cadence Verilog Guide are allowed; Time: 10:00AM-12:45PM Cloed-book/Cloed-note Exam Total point:
More informationFall 2010 EE457 Instructor: Gandhi Puvvada Date: 10/1/2010, Friday in SGM123 Name:
Fall 2010 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 10/1/2010, Friday in SGM123 Name: Calculator and Cadence Verilog guide are allowed; Cloed-book, Cloed-note, Time: 12:00-2:15PM Total point:
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationHardware-Based IPS for Embedded Systems
Hardware-Baed IPS for Embedded Sytem Tomoaki SATO, C&C Sytem Center, Hiroaki Univerity Hiroaki 036-8561 Japan Shuya IMARUOKA and Maa-aki FUKASE Graduate School of Science and Technology, Hiroaki Univerity
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationLaboratory Exercise 7
Laboratory Exercise 7 Finite State Machines This is an exercise in using finite state machines. Part I We wish to implement a finite state machine (FSM) that recognizes two specific sequences of applied
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationSIMIT 7. Profinet IO Gateway. User Manual
SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion
More informationFall 2010 EE457 Instructor: Gandhi Puvvada Date: 10/1/2010, Friday in SGM123 Name:
Fall 2010 EE457 Intructor: Gandhi Puvvada Quiz (~ 10%) Date: 10/1/2010, Friday in SGM123 Name: Calculator and Cadence Verilog guide are allowed; Cloed-book, Cloed-note, Time: 12:00-2:15PM Total point:
More informationModelling the impact of cyber attacks on the traffic control centre of an urban automobile transport system by means of enhanced cybersecurity
Modelling the impact of cyber attack on the traffic control centre of an urban automobile tranport ytem by mean of enhanced cyberecurity Yoana Ivanova 1,* 1 Bulgarian Academy of Science, Intitute of ICT,
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationLaboratory Exercise 1
Laboratory Exercise 1 Switches, Lights, and Multiplexers The purpose of this exercise is to learn how to connect simple input and output devices to an FPGA chip and implement a circuit that uses these
More informationSIMIT 7. What's New In SIMIT V7.1? Manual
SIMIT 7 What' New In SIMIT V7.1? Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimization-reult are only non-binding uggetion
More informationVLSI Design 9. Datapath Design
VLSI Deign 9. Datapath Deign 9. Datapath Deign Lat module: Adder circuit Simple adder Fat addition Thi module omparator Shifter Multi-input Adder Multiplier omparator detector: A = 1 detector: A = 11 111
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationAspects of Formal and Graphical Design of a Bus System
Apect of Formal and Graphical Deign of a Bu Sytem Tiberiu Seceleanu Univerity of Turku, Dpt. of Information Technology Turku, Finland tiberiu.eceleanu@utu.fi Tomi Weterlund Turku Centre for Computer Science
More information(12) Patent Application Publication (10) Pub. No.: US 2013/ A1. Dhar et al. (43) Pub. Date: Jun. 6, 2013 NY (US) (57) ABSTRACT
(19) United State US 2013 0145314A1 (12) Patent Application Publication (10) Pub. No.: US 2013/0145314 A1 Dhar et al. (43) Pub. Date: Jun. 6, 2013 (54) SYSTEMAND METHOD FORCHANGEABLE (52) U.S. Cl. FOCUS
More informationGeneric Traverse. CS 362, Lecture 19. DFS and BFS. Today s Outline
Generic Travere CS 62, Lecture 9 Jared Saia Univerity of New Mexico Travere(){ put (nil,) in bag; while (the bag i not empty){ take ome edge (p,v) from the bag if (v i unmarked) mark v; parent(v) = p;
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationAn Active Stereo Vision System Based on Neural Pathways of Human Binocular Motor System
Journal of Bionic Engineering 4 (2007) 185 192 An Active Stereo Viion Sytem Baed on Neural Pathway of Human Binocular Motor Sytem Yu-zhang Gu 1, Makoto Sato 2, Xiao-lin Zhang 2 1. Department of Advanced
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationParameters, UVM, Coverage & Emulation Take Two and Call Me in the Morning
Parameter, UVM, Coverage & Emulation Take Two and Call Me in the Morning Michael Horn Mentor Graphic Corporation Colorado, USA Mike_Horn@mentor.com Bryan Ramirez Mentor Graphic Corporation Colorado, USA
More informationLaboratory Exercise 3
Laboratory Exercise 3 Latches, Flip-flops, and egisters The purpose of this exercise is to investigate latches, flip-flops, and registers. Part I Altera FPGAs include flip-flops that are available for
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More information(12) Patent Application Publication (10) Pub. No.: US 2003/ A1
US 2003O196031A1 (19) United State (12) Patent Application Publication (10) Pub. No.: US 2003/0196031 A1 Chen (43) Pub. Date: Oct. 16, 2003 (54) STORAGE CONTROLLER WITH THE DISK Related U.S. Application
More informationAdvanced Datapath Synthesis using Graph Isomorphism
Advanced Datapath Synthei uing Graph Iomorphim Cunxi Yu, Mihir Choudhury 2, Andrew Sullivan 2, Maciej Cieielki ECE Department, Univerity o Maachuett, Amhert *IBM T.J Waton Reearch Center 2 ycunxi@uma.edu,
More informationStress-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling
Stre-Blended Eddy Simulation (SBES) - A new Paradigm in hybrid RANS-LES Modeling Menter F.R. ANSYS Germany GmbH Introduction It i oberved in many CFD imulation that RANS model how inherent technology limitation
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationFinite Elements Method in Split Hopkinson Pressure Bar developing process
6th WSEAS International Conference on SYSTEM SCIENCE and SIMULATION in ENGINEERING, Venice, Italy, November 1-3, 007 63 Finite Element Method in Split Hopkinon Preure Bar developing proce ROTARIU ADRIAN
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationFrequency Table Computation on Dataflow Architecture
Frequency Table Computation on Dataflow Architecture P. Škoda *, V. Sruk **, and B. Medved Rogina * * Ruđer Bošković Intitute, Zagreb, Croatia ** Faculty of Electrical Engineering and Computing, Univerity
More informationDomain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures
Domain-Specific Modeling for Rapid Sytem-Wide Energy Etimation of Reconfigurable Architecture Seonil Choi 1,Ju-wookJang 2, Sumit Mohanty 1, Viktor K. Praanna 1 1 Dept. of Electrical Engg. 2 Dept. of Electronic
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationCS201: Data Structures and Algorithms. Assignment 2. Version 1d
CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and
More informationTechnical Bulletin TB1554. Class: INFO. JVM Software Update Procedure
Serie Cla: INFO Reviion: B Sheet 1 of 9 Releae Date: 14.08.2014 With the introduction of the JVM (Johnton Viual Module) on the product range it i now poible to download oftware by mean of a Johnton USB
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationTAM 212 Worksheet 3. Solutions
Name: Group member: TAM 212 Workheet 3 Solution The workheet i concerned with the deign of the loop-the-loop for a roller coater ytem. Old loop deign: The firt generation of loop wa circular, a hown below.
More informationTechnical Bulletin TB1570. Class: INFO. Subject JVM Software Update Procedure. Series V-Range (501,651,801)
Serie V-Range (501,651,801) Cla: INFO Reviion: E Sheet 1 of 8 Releae Date: 16.12.2015 With the introduction of CAN communication and control on the truck mounted range of Johnton Sweeper, there i now the
More information(12) Patent Application Publication (10) Pub. No.: US 2011/ A1
(19) United State US 2011 0316690A1 (12) Patent Application Publication (10) Pub. No.: US 2011/0316690 A1 Siegman (43) Pub. Date: Dec. 29, 2011 (54) SYSTEMAND METHOD FOR IDENTIFYING ELECTRICAL EQUIPMENT
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationPractical Analog and Digital Filter Design
Practical Analog and Digital Filter Deign Artech Houe, Inc. Le Thede 004 Thi text i dedicated to my wife who keep me grounded, and to my grandchildren who know no bound. Content Preface xi Chapter Introduction
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationTechnical Bulletin TB1554. Class: INFO. JVM Software Update Procedure
Serie Cla: INFO Reviion: D Sheet 1 of 8 Releae Date: 14.08.2014 With the introduction of the JVM (Johnton Viual Module) on the product range it i now poible to download oftware by mean of a Johnton USB
More informationTAM 212 Worksheet 3. The worksheet is concerned with the design of the loop-the-loop for a roller coaster system.
Name: Group member: TAM 212 Workheet 3 The workheet i concerned with the deign of the loop-the-loop for a roller coater ytem. Old loop deign: The firt generation of loop wa circular, a hown below. R New
More informationResearch Article Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks
International Optic Volume 0, Article ID 9, page http://dxdoiorg/0/0/9 Reearch Article Longet Path Reroute to Optimize the Optical Multicat Routing in Spare Splitting WDM Network Huanlin Liu, Hongyue Dai,
More information999 Computer System Network. (12) Patent Application Publication (10) Pub. No.: US 2006/ A1. (19) United States
(19) United State US 2006O1296.60A1 (12) Patent Application Publication (10) Pub. No.: Mueller et al. (43) Pub. Date: Jun. 15, 2006 (54) METHOD AND COMPUTER SYSTEM FOR QUEUE PROCESSING (76) Inventor: Wolfgang
More informationLearning Outcomes. Spiral 2-2. Digital System Design DATAPATH COMPONENTS
2-2. 2-2.2 Learning Outcomes piral 2-2 Arithmetic Components and Their Efficient Implementations I understand the control inputs to counters I can design logic to control the inputs of counters to create
More informationEthernet Peer-To-Peer Communication With Model 353 And Procidia i pac Controllers
iemen Energy & utomation pplication ata Ethernet Peer-To-Peer Communication With odel 353 nd Procidia ipac Controller 353-113 Rev. 1 July Ethernet i a leading form of network communication that i often
More informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
More informationINVERSE DYNAMIC SIMULATION OF A HYDRAULIC DRIVE WITH MODELICA. α Cylinder chamber areas ratio... σ Viscous friction coefficient
Proceeding of the ASME 2013 International Mechanical Engineering Congre & Expoition IMECE2013 November 15-21, 2013, San Diego, California, USA IMECE2013-63310 INVERSE DYNAMIC SIMULATION OF A HYDRAULIC
More informationarxiv: v1 [cs.ar] 31 Aug 2017
Advanced Datapath Synthei uing Graph Iomorphim Cunxi Yu, Mihir Choudhury 2, Andrew Sullivan 2, Maciej Cieielki ECE Department, Univerity o Maachuett, Amhert IBM T.J Waton Reearch Center 2 ycunxi@uma.edu,
More informationE5ZE-8 Multipoint Temperature Controller Communications Manual
E5ZE-8 Multipoint Temperature Controller Communication Manual Produced December 2000 Notice: OMRON product are manufactured for ue according to proper procedure by a qualified operator and only for the
More informationPolicy-based Injection of Private Traffic into a Public SDN Testbed
Intitut für Techniche Informatik und Kommunikationnetze Adrian Friedli Policy-baed Injection of Private Traffic into a Public SDN Tetbed Mater Thei MA-2013-12 Advior: Dr. Bernhard Ager, Vaileio Kotroni
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationManaging Clock Distribution and Optimizing Clock Skew in Networking Applications
Application te 14 123456789012345678901234567890121234567890123456789012345678901212345678901234567890123456789012123456789012345678901234567890121234 Managing Clock itribution and Optimizing Clock Skew
More informationIntegration of Digital Test Tools to the Internet-Based Environment MOSCITO
Integration of Digital Tet Tool to the Internet-Baed Environment MOSCITO Abtract Current paper decribe a new environment MOSCITO for providing acce to tool over the internet. The environment i built according
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationA DIVISIVE HIERARCHICAL CLUSTERING- BASED METHOD FOR INDEXING IMAGE INFORMATION
A DIVISIVE HIERARCHICAL CLUSTERING- BASED METHOD FOR INDEXING IMAGE INFORMATION ABSTRACT Najva Izadpanah Department of Computer Engineering, Ilamic Azad Univerity, Qazvin Branch, Qazvin, Iran In mot practical
More informationHow to. write a paper. The basics writing a solid paper Different communities/different standards Common errors
How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationWavelet Decomposition for Denoising GPS/INS Outputs in Vehicular Navigation System
Wavelet Decompoition for Denoiing GPS/INS Output in Vehicular Navigation Syem SALAM ISMAEEL 1 and AYMAN AL-KHAZRAJI 2 Department of Computer Science Ryeron Univerity 35 Victoria St, Toronto, ON M5B 2K3
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More information