8.0 Resolving Multi-Signal Drivers
|
|
- Gervase Owen
- 5 years ago
- Views:
Transcription
1 Fileame= ch8_2 8.0 Resolvig Multi-Sigal Drivers 8.1 Buses B ACTL BCTL DBUS DBUS A DBUS Ope circle deotes a iput coectio Solid dot deotes a output coectio The ope circles at the bus iputs respreset switched coectios ACTL BCTL DBUS 0 0 impemetatio depedet ( o iput activated) 0 1 B 1 0 A 1 1 implemetatio depedet (both iputs activated) 8.2 Bus Implemetatio NMOS Bus Driver 1
2 VDD C C i out = out i DBUS ACTL BCTL A B ACTL BCTL DBUS 0 0 Floatig 0 1 B 1 0 A 1 1 Udefied (Avoid) 2
3 8.2.2 Tri-State Bus Driver DBUS ACTL BCTL A B VDD C C i*c i out = out i*c i ACTL BCTL DBUS 0 0 Udefied (Avoid) 0 1 A 1 0 B 1 1 Floatig Whe C=1 both out trasistors are tured off ad the output out is left floatig C=0 oe of the output trastor is eabled ad the other disabled, as selected by the iput data i, out <= i. There are situatios where bus cotrol iputs are geerated by devices operatig idepedetly ad asychroously. Iterrupt request (IRQ) lies are a commo example. Multiple drivers ca be eabled simultaeously durig ormal operatio, ad hece tri-state bus should ot be used. 3
4 8.2.3 Ope-Drai Bus Driver C i out = C i i*c out VDD R DBUS ACTL BCTL A B The driver is a NOR gate followed by a iverter with the pull-up resistor removed. A pull-up resistor is provided exterally to hold the bus at 1 whe o driver is pullig it low. Whe o driver is eabled, DBUS = 1. If multiple drivers are eabled, the the bus will be pulled low if ay eabled iputs is low, hece DBUS is the AND of the eabled iputs. ACTL BCTL DBUS 0 0 A ad B 0 1 A 1 0 B Ope-Collector Bus Driver 4
5 out C i out = C i i*c VDD R DBUS ACTL BCTL DBUS A B TTL versio of the ope-drai OR-gate is the ope-collector NAND-gate. It is formed from the basic TTL gate by removig the pull-up from the output. The DBUS is the OR of the eabled iputs. ACTL BCTL DBUS DBUS B B 1 0 A A 1 1 A ad B A + B 5
6 8.3 Resolvig Multi-Sigal Drivers Simulators origially used a two-state value system, represetig logic 1 ad logic 0. This is declared as type BIT: TYPE BIT IS ( 0, 1 ); For a sigle source system this is adequate. Whe two or more souces are drivig a sigal, if oe source is drivig a value of 1 ad the other drivig a 0, the result deped o the techologies used, it may be desig error i some ad ukow i others. With two-state system, this state ca ot be represeted. To represet coditios of ukow state ad floatig state, a miimum of four-value system is required. This uresolved 4 logic state system (Autologic II, old stadard) is declared as: TYPE qsim_state IS ( X, --Forcig Ukow 0, --Forcig 0 1, --Forcig 1 Z --High Impedace ); To use this stadard logic system, VHDL code must iclude the followig lies at the begiig. LIBRARY MGC_PORTABLE; USE MGC_PORTABLE.QSIM_LOGIC.ALL; USE MGC_PORTABLE.QSIM_RELATIONS.ALL; For more complex circuit simulatio, the simulator must be able to represet sigals that do ot swig to the power rails of 1 (VDD), ad 0 (GND) such as TTL logic level where H meas >=2.5 ad L <= 0.8V. The ew IEEE STANDARD LOGIC 1164 (Autologic II, curret stadard) is a 9 value system. The uresolved 9 logic state system is declared as follows: TYPE std_ulogic IS ( U, --Uiitialized X, --Forcig Ukow 0, --Forcig 0 1, --Forcig 1 Z, --High Impedace W, --Weak Ukow L, --Weak 0 H, --Weak Do t care ); To use this stadard logic system, VHDL code must iclude the followig lies at the begiig. LIBRARY IEEE, ARITHMETIC; USE IEEE.STD_LOGIC_1164.ALL; USE ARITHMETIC.STD_LOGIC_ARITH.ALL; Resolvig a Sigal Value Whe Drive by Multiple Assigmets Every sigal assigmet statemet assigs a projected waveform to a driver. It is possible (ad probable i hardware desigs) that your model cotais more tha oe sigal assigmet statemet (each with its ow driver) that attempts to assig differet values to the same sigal at the same time. Whe this happes, your 6
7 model must provide a resolutio fuctio that specifies how to resolve the assigmet. Each sigal that requires a resolutio fuctio makes referece to the appropriate fuctio i the sigal declaratio. Example: ENTITY mult_driver IS PORT(a,b,c,d:IN qsim_state;z:out qsim_state); END mult_driver; ARCHITECTURE wired_ad OF mult_driver IS FUNCTION adig(drivers:qsim_state_vector)return qsim_state IS VARIABLE temp:qsim_state:='1'; FOR i IN drivers'range LOOP END LOOP; RETURN temp; END adig; temp:=temp AND drivers(i); SIGNAL lie_ad: adig qsim_state; lie_ad <= a; lie_ad <= b; lie_ad <= c; lie_ad <= d; z<= lie_ad; END wired_ad; --see the AND table Qsim AND Table AND 0 1 X Z X X X 0 X X X Z 0 X X X Std_ulogic AND TABLE AND U X 0 1 Z W L H - U U U 0 U U U 0 U U X U X 0 X X X 0 X X U X 0 1 X X 0 1 X Z U X 0 X X X 0 X X W U X 0 X X X 0 X X L H U X 0 1 X X 0 1 X - U X 0 X X X 0 X X 7
8 If the bus is wired or type replace the fuctio to orig: FUNCTION orig(drivers:qsim_state_vector)return qsim_state IS VARIABLE temp:qsim_state:='0'; FOR i IN drivers'range LOOP END LOOP RETURN temp; END orig;; temp:=temp OR drivers(i); SIGNAL lie_or: orig qsim_state; --see the OR table Qsim OR Table OR 0 1 X Z X X X X 1 X X Z X 1 X X Std_ulogic OR Table OR U X 0 1 Z W L H - U U U U 1 U U U 1 U X U X X 1 X X X 1 X 0 U X 0 1 X X 0 1 X Z U X X 1 X X X 1 X W U X X 1 X X X 1 X L U X 0 1 X X 0 1 X H U X X 1 X X X 1 X If the bus is either wired_ad or wired_or, such as wirig several sigals ito a commo ode. A ew two operad fuctio called wire is defied: TYPE qsim_2d IS ARRAY(qsim_state,qsim_state) OF qsim_state FUNCTION wire (a,b:qsim_state) RETURN qsim_state IS CONSTANT wire_table:qsim_2d:=( (`0','X','X','0'), (`X','1','X','1'), (`X','X','X','X'), (`0','1','X','Z')); RETURN wire_table(a,b); END wire; Qsim WIRE Table WIRE 0 1 X Z 0 0 X X 0 1 X 1 X 1 X X X X X Z 0 1 X Z 8
9 Std_ulogic WIRE Table U X 0 1 Z W L H - U U U U U U U U U U X U X X X X X X X X 0 U X 0 X X 1 U X X X Z U X 0 1 Z W L H X W U X 0 1 W W W W X L U X 0 1 L W L W X H U X 0 1 H W W H X - U X X X X X X X X NOTE: this is the same as resolutio_table i IEEE package Iterpretatio of wire: 1. IF the two iputs are equal, the wire value will be the same as the iputs. 2. wire(a,'z')=a, wire(`z',b)=b: Value `Z' o either of the iputs is absorbed by a stroger value (`0','1', or`x'). 3. wire(a,b)=x,if a<>b ad a<>'z' ad b<>'z': coflictig o `Z' values o the iputs result i `X' value. FUNCTION wirig(drivers:qsim_state_vector) RETURN qsim_state IS VARIABLE temp: qsim_state:='z'; FOR i IN drivers'range LOOP temp:=wire(temp,drivers(i)); END LOOP; RETURN temp; END wirig; SIGNAL bus_wire:wirig qsim_state; The correspodig resolvig fuctio of wirig i the 9-state logic system is give below: FUNCTION resolved (s ; std_ulogic_vector) RETURN std_ulogic IS VARIABLE result : std_ulogic := Z ; --weakest state default --the test for a sigle driver is essetial otherwise the --loop would retur X for a sigle driver of - ad that --would coflict with the value of a sigle driver uresolved sigal. IF (s LENGTH = 1) THEN RETURN s(s LOW); ELSE FOR i IN s RANGE LOOP result := resolutio_table(result, s(i)); END LOOP; END IF; RETURN result; END resolved; SUBTYPE std_logic IS resolved std_ulogic; TYPE std_logic_vector IS ARRAY (NATURAL RANGE <>) OF std_logic; 9
10 The above resolutio fuctio are best put i a desig package iorder that they be available to all the desig etities. I additio, subtypes ad types ca be declared to hadle lie or bus cotetio that will facilitate sigal declaratio that requires resolutio fuctio. PACKAGE desig_package IS FUNCTION adig(drivers:qsim_state_vector)return qsim_state; SUBTYPE aded_qsim_state IS adig qsim_state; -- for resolvig lie drivers TYPE aded_qsim_state_vector IS ARRAY(NATURAL RANGE<>) OF aded_qsim_state; -- for resolvig bus drivers FUNCTION orig(drivers:qsim_state_vector)return qsim_state; SUBTYPE ored_qsim_state IS orig qsim_state; TYPE ored_qsim_state_vector IS ARRAY(NATURAL RANGE<>) OF ored_qsim_state; FUNCTION wirig(drivers:qsim_state_vector)return qsim_state; SUBTYPE wired_qsim_state IS wirig qsim_state; TYPE wired_qsim_state_vector IS ARRAY(NATURAL RANGE<>) OF wired_qsim_state ; END desig_package; PACKAGE BODY desig_package IS FUNCTION adig(drivers:qsim_state_vector)return qsim_state IS VARIABLE temp:qsim_state:='1'; FOR i IN drivers'range LOOP temp:=temp AND drivers(i); END LOOP; RETURN temp; END adig; FUNCTION orig(drivers:qsim_state_vector)return qsim_state IS VARIABLE temp:qsim_state:='0'; FOR i IN drivers'range LOOP temp:=temp OR drivers(i); END LOOP RETURN temp; END orig; TYPE qsim_2d IS ARRAY(qsim_state,qsim_state) OF qsim_state FUNCTION wire (a,b:qsim_state) RETURN qsim_state IS CONSTANT wire_table:qsim_2d:=( (`0','X','X','0'), (`X','1','X','1'), (`X','X','X','X ), (`0','1','X','Z')); RETURN wire_table(a,b); END wire; FUNCTION wirig(drivers:qsim_state_vector) RETURN qsim_state IS VARIABLE temp: qsim_state:='z'; FOR i IN drivers'range LOOP temp:=wire(temp,drivers(i)); END LOOP; 10
11 RETURN temp; END wirig; END desig_package; Depedig o the type of bus, they are declared accordigly: SIGNAL bus_ad : aded_qsim_state --for wired_ad bus SIGNAL bus_or : ored_qsim_state --for wired_or bus SIGNAL bus_wire: wired_qsim_state --for wired bus WIRED_AND BUS - OPEN COLLECTOR GATES The fuctio of resolutio fuctios ad resolved sigals is very useful for modelig various bus forms. A bussig structure formed by coectig the outputs of ope collector gates is very commo. The VHDL descriptio of a ope collector two-iput NAND gate is give as follows: ENTITY ad2 IS GENERIC(tplh:TIME:=10 s;tphl:time:=15 s); PORT(x,y:IN qsim_state;z:out qsim_state); END ad2; ARCHITECTURE ope_collector OF ad2 IS z<='0' AFTER tphl WHEN (x AND y)='1' ELSE `Z AFTER tplh WHEN (x AND y)='0' ELSE `X' AFTER tphl; END ope_collector; The output of a ope_collector gate must be coected to a pull-up,resistor to the power supply, several such outputs ca be coected to a commo pull-up resistor. I geeral, the fuctio of a pull-up resistor is to produce a `1' if oe of its drivers is `0', ad to produce a `0' if at least oe driver is `0'. For qsim_state type this is idetical to type aded_qsim_state. Therefore, a lie or bus coected to a pull-up resistor to a power supply is declared or modeled as follows: SIGNAL pull_up: aded_qsim_state; Associatig this sigal with a output port of a ope collector gate is equivalet to coectig that output to a pull-up resistor i hardware VHDL Implemetatio of 7403 ENTITY s7403 IS PORT(a,b:IN qsim_state_vector(1 TO 4);c:OUT qsim_state_vector(1 TO 4)); END s7403; ARCHITECTURE struct OF s7403 IS COMPONENT ad2 PORT(a,b:IN qsim_state;c:out qsim_state); END COMPONENT; FOR ALL:ad2 USE ENTITY WORK.ad2(ope_collector); g1: :ad2 PORT MAP(a(1),b(1),c(1)); g2: :ad2 PORT MAP(a(2),b(2),c(2)); g3: :ad2 PORT MAP(a(3),b(3),c(3)); g4: :ad2 PORT MAP(a(4),b(4),c(4)); END struct; 11
12 X_NOR Implemetatio usig s7403 ENTITY xor IS PORT(x,y:IN qsim_state;z:out qsim_state); END xor; ARCHITECTURE struct OF xor IS COMPONENT s7403 PORT(a,b:IN qsim_state_vector(1 TO 4);c:OUT qsim_state_vector(1 TO 4)); END COMPONENT; FOR ALL s7403 USE ENTITY WORK.s7403(struct); SIGNAL r1, r2, r3:aded_qsim_state:='z'; U1:s7403(x,y,r1, x, --a(1), a(2), a(3), a(4) x,y,y,r2, --b(1), b(2), b(3), b(4) r1, r2, r3, r3); --c(1), c(2), c(3), c(4) END struct; NOTE: r1, r2 are wired_ad bus with oe driver. r3 is a wired_ad bus with two drivers. 12
13 +5V x y g1 a(1) c(1) b(1) r1 x y g3 a(3) c(3) b(3) x y +5V r3 z =( x y ) ( x y ) = x y + x y a(2) c(2) b(2) g2 r2 x y a(4) c(4) b(4) g4 x y +5V WIRED BUS - MOS Multiplexer ENTITY mux_8_1 IS PORT(i,s :IN qsim_state_vector(7 DOWNTO 0); out:out qsim_state); END mux_8_1; ARCHITECTURE mult_guard OF mux_8_1 IS SIGNAL temp : wired_qsim_state BUS; b7: BLOCK(s(7)='1') temp<=guarded i(7);end BLOCK b6: BLOCK(s(6)='1') temp<=guarded i(6);end BLOCK b5: BLOCK(s(5)='1') temp<=guarded i(5);end BLOCK b4: BLOCK(s(4)='1') temp<=guarded i(4);end BLOCK b3: BLOCK(s(3)='1') temp<=guarded i(3);end BLOCK b2: BLOCK(s(2)='1') temp<=guarded i(2);end BLOCK b1: BLOCK(s(1)='1') temp<=guarded i(1);end BLOCK b0: BLOCK(s(0)='1') temp<=guarded i(0);end BLOCK out <= temp; END mult_guard; A iterestig situatio arises whe all the drivers are discoected from it, ad that is all eight implied GUARD sigals are FALSE. I this case, because of the BUS keyword is used i the declaratio of temp, the wirig resolutio fuctio is called with a NULL iput parameter. The defiitio of the wirig fuctio specifies that the iitial value of the accumulate variable (`Z') is retured as the fuctio value if the etire loop statemet i the statemet part of this fuctio is skipped due to a NULL rage. 13
14 9.3.4 Tri-State Buffers 14
15 The block statemet ca be used to defie tri-state logic. To sythesize tri-state devices, Autologic VHDL utilizes the otios of discoect, guarded assigmets, ad resolved bus sigals. Whe the guard expressio of a bus sigal is ot true, the driver is discoected from the target sigal. This meas that other sigals ca drive the target, which requires a resolutio fuctio to resolve the value of the target. The drivig sigal must be of the STD_LOGIC type. The resolved sigal must be of sigal kid bus. The followig illustrates the Autologic VHDL implemetatio of a sigle tri-state buffer: 1 LIBRARY IEEE; 2 USE IEEE.STD_LOGIC_1164.ALL; 3 4 ENTITY triout IS 5 PORT( oe : IN BIT; i : IN STD_LOGIC; 6 o : OUT STD_LOGIC BUS) 7 END triout; 8 9 ARCHITECTURE arch_triout IS 10 tri_out: BLOCK (oe = 1 ) o <= GUARDED i; 13 END BLOCK; 14 END arch_triout; The followig illustrates the CADENCE VHDL implemetatio of a sigle tri-state buffer: LIBRARY IEEE; USE IEEE.STD_LOGIC_1164.ALL; ENTITY triout IS PORT( oe : IN bit; i : IN STD_LOGIC; o : OUT STD_LOGIC BUS); END triout; 15
16 ARCHITECTURE arch_triout of triout IS process(oe,i) begi if oe='1' the o<= i ; else o<= 'Z' ; ed if; ed process; END arch_triout; The followig is the Autologic VHDL implemetatio of a bak of four tri-state bufferes: 1 LIBRARY IEEE; 2 USE IEEE.STD_LOGIC_1164.ALL; 3 4 ENTITY tri_buf4 IS 5 PORT (oe : IN STD_LOGIC; 6 i : IN STD_LOGIC_VECTOR(3 DOWNTO 0); 7 o : OUT STD_LOGIC_VECTOR(3 DOWNTO 0) BUS); 8 END tri_buf4; 9 10 ARCHITECTURE arch_tri_buf4 OF tri_buf4 IS tri_out: BLOCK (oe = 1 ) 13 o <= GUARDED i; 14 END BLOCK tri_out; END arch_tri_buf4; The followig is the CADENCE VHDL implemetatio of a bak of four tri-state bufferes: LIBRARY IEEE; USE IEEE.STD_LOGIC_1164.ALL; ENTITY tri_buf4 IS PORT( oe : IN bit; i : IN STD_LOGIC_VECTOR(3 DOWNTO 0); o : OUT STD_LOGIC_VECTOR(3 DOWNTO 0) BUS); END tri_buf4; ARCHITECTURE arch_tri_buf4 of tri_buf4 IS process(oe,i) begi if oe='1' the o<= i ; else o<= "ZZZZ" ; ed if; ed process; END arch_tri_buf4; 16
17 If the target sigal o was ot defied as of kid BUS, a bak of four trasparet latches is implemeted rather tha a bak of four tri-state buffers. 17
18 8.3.5 BUS AND REGISTER SIGNALS The methods for guardig sigals is to specify REGISTER or BUS as the sigal kid i a sigal declaratio. Registers ad buses are automatically guarded sigals. Sigals of the kid register, retai the last output value whe all drivers are discoected. Sigals of the kid bus, re-evaluate the output value whe all drivers are discoected. Evets ad trasactios o the BUS ad REGISTER kid of sigals are exactly the same as log as at least oe driver is tured o. If a evet turs off the last active driver of a guarded sigal, the resolutio fuctio is called for BUS sigals with a NULL parameter; however, it will ot be called if the kid is REGISTER. After all the drivers are tured off, the latter kid of sigals retai their lasr drive value. Example: ENTITY Buses IS GENERIC(Delay:TIME:=0 s); PORT(ct, wr, rd:in STD_LOGIC; dbus:out STD_LOGIC BUS); END Buses; ARCHITECTURE mult_driv OF Buses IS SIGNAL It_bus: STD_LOGIC BUS; b5: BLOCK(ct='1' ) It_bus <= GUARDED reg AFTER Delay s; END BLOCK; b6: BLOCK(wr='1') It_bus <= GUARDED data AFTER Delay s; END BLOCK; b10: BLOCK(rd='1') It_bus <= GUARDED mem AFTER Delay s; END BLOCK dbus<= It_bus; END mult_driv; 18
19 ct reg data wr it_bus mem rd DISCONNECTION SPECIFICATION (NOT supported by Autologic) I the guarded sigal assigmet s<=guarded data AFTER 5 s; If data chages value while the guard expressio is TRUE, the ew value of data will be assiged to s after 5 s. That is, the 5 s delay applies oly whe a driver is coected, or beig coected, ad does ot apply whe a driver is discoected from a guarded sigal. A discoectio specificatio statemet ca be used to specify the discoectio delay for a guarded sigal withi a guarded sigal assigmet. Such a statemet cotais the ame of the sigal, its type, ad a time expressio that specifies the discoectio delay value. To delay the discoectio of the It_bus drivers, the followig statemet should be added to the declarative part of this architecture: DISCONNECT It_bus: STD_LOGIC AFTER 3 s; With the iclusio of this statemet, if a It_bus driver is tured off because its guard expressio becomes FALSE, the effect of this driver remais o It_bus for 3 s after it has bee tured off. The overall effect of this is that the output chages to `Z' 3 s after the last source has bee tured off. Format: DISCONNECT sigal_ame {,sigal_ame}:sigal_ame_type AFTER time_expressio; DISCONNECT OTHERS : sigal_ame_type AFTER time_expressio; DISCONNECT ALL: sigal_ame_type AFTER time_expressio; 19
20 The ALL keyword used for the sigal list implies that the discoectio specificatio applies to all sigals of the type specified. If OTHERS is used i place of the sigal list, the discoectio specificatio applies to sigals of the specified type for which discoectio has ot bee specified i the statemets above this statemet. Example : SIGNAL t: STD_LOGIC BUS; -- guarded sigal declaratio DISCONNECT t: STD_LOGIC AFTER 10 s; discoectio specificatio There is a discoectio specificatio for every guarded sigal, whether you explicitly defie oe or you elect to use the implicit default. The default specificatio is: DISCONNECT guarded_sig_ame:guarded_sig_type AFTER 0 s; 20
Behavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationK-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns
K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge
More informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationCS 11 C track: lecture 1
CS 11 C track: lecture 1 Prelimiaries Need a CMS cluster accout http://acctreq.cms.caltech.edu/cgi-bi/request.cgi Need to kow UNIX IMSS tutorial liked from track home page Track home page: http://courses.cms.caltech.edu/courses/cs11/material
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationLecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 3 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationDIO-6464L-PE. Specification. Features. Digital I/O Board with Opto-Isolation for PCI Express DIO-6464L-PE 1. Ver.1.11
Digital I/O with OptoIsolatio PCI Express DIO6464LPE This product is a PCI Express buscompliat iterface board used to provide a digital sigal I/O fuctio o a PC. This product ca iput ad digital sigals at
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationChapter 4 The Datapath
The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that
More information1. SWITCHING FUNDAMENTALS
. SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig
More informationL6: FSMs and Synchronization
L6: FSMs ad Sychroizatio Ackowledgemets: Materials i this lecture are courtesy of the followig sources ad are used with permissio. Rex Mi J. Rabaey, A. Chadrakasa, B. Nikolic. igital Itegrated Circuits:
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationChapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationChapter 8. Strings and Vectors. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 8 Strigs ad Vectors Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Copyright 2015 Pearso Educatio, Ltd..
More informationEnd Semester Examination CSE, III Yr. (I Sem), 30002: Computer Organization
Ed Semester Examiatio 2013-14 CSE, III Yr. (I Sem), 30002: Computer Orgaizatio Istructios: GROUP -A 1. Write the questio paper group (A, B, C, D), o frot page top of aswer book, as per what is metioed
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationtop() Applications of Stacks
CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationModule Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two
Give submodule mux32two: 2-to- MUX module mux32two (iput [3:] i,i, iput sel, output [3:] out); Module Istatiatio Fiite Machies esig methodology for sequetial logic -- idetify distict s -- create trasitio
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationICS Regent. Communications Modules. Module Operation. RS-232, RS-422 and RS-485 (T3150A) PD-6002
ICS Reget Commuicatios Modules RS-232, RS-422 ad RS-485 (T3150A) Issue 1, March, 06 Commuicatios modules provide a serial commuicatios iterface betwee the cotroller ad exteral equipmet. Commuicatios modules
More informationOut the box. dataloggers. easy to configure easy data streaming easy choice. connect, simply configure and go
Out the box dataloggers easy data collectio easily prove easy to cofigure easy data streamig easy choice coect, simply cofigure ad go The stadard Rebel Compact (CT) is a small robust data logger ideal
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationChapter 5: Processor Design Advanced Topics. Microprogramming: Basic Idea
5-1 Chapter 5 Processor Desig Advaced Topics Chapter 5: Processor Desig Advaced Topics Topics 5.3 Microprogrammig Cotrol store ad microbrachig Horizotal ad vertical microprogrammig 5- Chapter 5 Processor
More information% Sun Logo for. X3T10/95-229, Revision 0. April 18, 1998
Su Microsystems, Ic. 2550 Garcia Aveue Moutai View, CA 94045 415 960-1300 X3T10/95-229, Revisio 0 April 18, 1998 % Su Logo for Joh Lohmeyer Chairperso, X3T10 Symbios Logic Ic. 1635 Aeroplaza Drive Colorado
More informationData Structures Week #5. Trees (Ağaçlar)
Data Structures Week #5 Trees Ağaçlar) Trees Ağaçlar) Toros Gökarı Avrupa Gökarı October 28, 2014 Boraha Tümer, Ph.D. 2 Trees Ağaçlar) October 28, 2014 Boraha Tümer, Ph.D. 3 Outlie Trees Deiitios Implemetatio
More informationLecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationThreads and Concurrency in Java: Part 1
Cocurrecy Threads ad Cocurrecy i Java: Part 1 What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.
More informationDigital System Design
July, 22 9:55 vra235_ch Sheet umber Page umber 65 black chapter Digital System Desig a b c d e f g h 8 7 6 5 4 3 2. Bd3 g6+, Ke8 d8 65 July, 22 9:55 vra235_ch Sheet umber 2 Page umber 66 black 66 CHAPTER
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationThreads and Concurrency in Java: Part 1
Threads ad Cocurrecy i Java: Part 1 1 Cocurrecy What every computer egieer eeds to kow about cocurrecy: Cocurrecy is to utraied programmers as matches are to small childre. It is all too easy to get bured.
More information% Sun Logo for Frame. X3T10/95-229, Revision 2. September 28, 1995
Su Microsystems, Ic. 2550 Garcia Aveue Moutai View, CA 94045 415 960-1300 X3T10/95-229, Revisio 2 September 28, 1995 % Su Logo for Frame Joh Lohmeyer Chairperso, X3T10 Symbios Logic Ic. 1635 Aeroplaza
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationBluespec-3: Modules & Interfaces. Bluespec: State and Rules organized into modules
Bluespec-3: Modules & Iterfaces Arvid Computer Sciece & Artificial Itelligece Lab Massachusetts Istitute of Techology Based o material prepared by Bluespec Ic, Jauary 2005 February 28, 2005 L09-1 Bluespec:
More informationClasses and Objects. Again: Distance between points within the first quadrant. José Valente de Oliveira 4-1
Classes ad Objects jvo@ualg.pt José Valete de Oliveira 4-1 Agai: Distace betwee poits withi the first quadrat Sample iput Sample output 1 1 3 4 2 jvo@ualg.pt José Valete de Oliveira 4-2 1 The simplest
More informationPrinceton Instruments Reference Manual
Priceto Istrumets Referece Maual Improvisio, Viscout Cetre II, Uiversity of Warwick Sciece Park, Millbur Hill Road, Covetry. CV4 7HS Tel: 0044 (0) 24 7669 2229 Fax: 0044 (0) 24 7669 0091 e-mail: admi@improvisio.com
More informationCOP4020 Programming Languages. Functional Programming Prof. Robert van Engelen
COP4020 Programmig Laguages Fuctioal Programmig Prof. Robert va Egele Overview What is fuctioal programmig? Historical origis of fuctioal programmig Fuctioal programmig today Cocepts of fuctioal programmig
More informationCOP4020 Programming Languages. Subroutines and Parameter Passing Prof. Robert van Engelen
COP4020 Programmig Laguages Subrouties ad Parameter Passig Prof. Robert va Egele Overview Parameter passig modes Subroutie closures as parameters Special-purpose parameters Fuctio returs COP4020 Fall 2016
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationn Learn how resiliency strategies reduce risk n Discover automation strategies to reduce risk
Chapter Objectives Lear how resiliecy strategies reduce risk Discover automatio strategies to reduce risk Chapter #16: Architecture ad Desig Resiliecy ad Automatio Strategies 2 Automatio/Scriptig Resiliet
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationOverview. Chapter 18 Vectors and Arrays. Reminder. vector. Bjarne Stroustrup
Chapter 18 Vectors ad Arrays Bjare Stroustrup Vector revisited How are they implemeted? Poiters ad free store Destructors Iitializatio Copy ad move Arrays Array ad poiter problems Chagig size Templates
More informationOut the box. dataloggers. easy to configure easy data streaming easy choice. connect, simply configure and go
Out the box dataloggers easy data collectio easily prove easy to cofigure easy data streamig easy choice coect, simply cofigure ad go Rebel Data Loggers - A complete solutio The Rebel rage offers a complete
More informationChapter 6. I/O Streams as an Introduction to Objects and Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 6 I/O Streams as a Itroductio to Objects ad Classes Overview 6.1 Streams ad Basic File I/O 6.2 Tools for Stream I/O 6.3 Character I/O Slide 6-3 6.1 Streams ad Basic File I/O I/O Streams I/O refers
More information10/23/18. File class in Java. Scanner reminder. Files. Opening a file for reading. Scanner reminder. File Input and Output
File class i Java File Iput ad Output TOPICS File Iput Exceptio Hadlig File Output Programmers refer to iput/output as "I/O". The File class represets files as objects. The class is defied i the java.io
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationThe CCITT Communication Protocol for Videophone Teleconferencing Equipment
The CCITT Commuicatio Protocol for Videophoe Telecoferecig Equipmet Ralf Hiz Daimler-Bez AG Istitut ffir Iformatiostechik Tcl. 0731 / 505-21 32 Fax. 0731 / 505-41 04 Wilhelm-R.uge-Str. 11 7900 Ulm Abstract
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationBaan Tools User Management
Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationFrom last week. Lecture 5. Outline. Principles of programming languages
Priciples of programmig laguages From last week Lecture 5 http://few.vu.l/~silvis/ppl/2007 Natalia Silvis-Cividjia e-mail: silvis@few.vu.l ML has o assigmet. Explai how to access a old bidig? Is & for
More informationChapter 2. C++ Basics. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 2 C++ Basics Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 2.1 Variables ad Assigmets 2.2 Iput ad Output 2.3 Data Types ad Expressios 2.4 Simple Flow of Cotrol 2.5 Program
More informationn Industrial inspection n Laser gauging n Low light applications n Spectroscopy Figure 1. IL-C Sensor Block Diagram Pixel Reset Drain
L I N E S C A N C A M E R A S DALSA CL-C6 Cameras Tall pixels (38: aspect ratio), tremedous dyamic rage, great full-well capacity ad a sigle output make the CL-C6 a outstadig performer i spectroscopic
More information6.175: Constructive Computer Architecture. Oct 7,
6.175: Costructive Computer Architecture Tutorial 2 Advaced BSV Qua Nguye (Now uses the correct dates o PPT slides) T02-1 Admiistrivia Today is add date! Please test vlsifarm machies Remaiig labs schedule
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationDefinitions. Error. A wrong decision made during software development
Debuggig Defiitios Error A wrog decisio made durig software developmet Defiitios 2 Error A wrog decisio made durig software developmet Defect bug sometimes meas this The term Fault is also used Property
More informationGraphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)
Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total
More informationDescription of Single Cycle Computer (SCC)
Descriptio of Sigle Cycle Computer (SCC) Refereces: Chapter 9 of M. Morris Mao ad Charles Kime, Logic ad Computer Desig Fudametals, Pearso Pretice Hall, 4 th Editio, 28. Overview Part Datapaths Itroductio
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More informationCMSC Computer Architecture Lecture 5: Pipelining. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 5: Pipeliig Prof. Yajig Li Uiversity of Chicago Admiistrative Stuff Lab1 Due toight Lab2: out later today; due 2 weeks from ow Review sessio this Friday Turig award
More informationTELETERM M2 Series Programmable RTU s
Model C6xC ad C6xC Teleterm MR Radio RTU s DATASHEET Cofigurable Iputs ad Outputs 868MHz or 900MHz radio port 0/00 Etheret port o C6Cx ISaGRAF 6 Programmable microsd Card Loggig Low power operatio Two
More informationDALSA CL-C8 Cameras. Operation. Table 1. CL-C8 Camera Configurations. Power Supplies. Sensor. Optical Interface
L N E S C A N C A M E R A S DALSA CL-C8 Cameras The CL-C8 provides DALSA quality ad performace i a large format camera. 6000 horizotal pixels ad a variety of high-speed output optios make the CL-C8 ideal
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationDEFINITION OF CELL BEHAVIOUR. Actions and Behaviour. CELL = a CELL CELL = b CELL
Actios ad Behaviour Let us start to itroduce some modellig laguage features which will allow us to model the behaviour of a cell compoet. Suppose the cell compoet holds a sigle piece of iformatio which
More informationCustom single-purpose processors: Hardware. 4.1 Introduction. 4.2 Combinational logic design 4-1
Chapter 4: Custom sigle-purpose processors: Hardware 4- Chapter 4 Custom sigle-purpose processors: Hardware 4. Itroductio As metioed i the previous chapter, a sigle-purpose processor is a digital sstem
More information6053/6055 Modbus Plus Communications Interface
This maual was dowloaded o www.sdsdrives.com +44 (0)117 938 1800 - ifo@sdsdrives.com 6053/6055 Modbus Plus Commuicatios Iterface Techical Maual HA468032U001 Issue 3 Compatible with Versio 1.2 (owards)
More informationCAEN Tools for Discovery
Applicatio Note AN2086 Sychroizatio of CAEN Digitizers i Multiple Board Acquisitio Systems Viareggio 9 May 2013 Itroductio High speed digitizers fid applicatios i several fields ragig from the idustry
More informationCS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June
CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationCIS 121. Introduction to Trees
CIS 121 Itroductio to Trees 1 Tree ADT Tree defiitio q A tree is a set of odes which may be empty q If ot empty, the there is a distiguished ode r, called root ad zero or more o-empty subtrees T 1, T 2,
More informationChapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings
Operatig Systems: Iterals ad Desig Priciples Chapter 4 Threads Nith Editio By William Stalligs Processes ad Threads Resource Owership Process icludes a virtual address space to hold the process image The
More informationPackage RcppRoll. December 22, 2014
Type Package Package RcppRoll December 22, 2014 Title Fast rollig fuctios through Rcpp ad RcppArmadillo Versio 0.1.0 Date 2013-01-10 Author Kevi Ushey Maitaier Kevi Ushey RcppRoll
More informationUsing the Keyboard. Using the Wireless Keyboard. > Using the Keyboard
1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries
More informationAbstract. Chapter 4 Computation. Overview 8/13/18. Bjarne Stroustrup Note:
Chapter 4 Computatio Bjare Stroustrup www.stroustrup.com/programmig Abstract Today, I ll preset the basics of computatio. I particular, we ll discuss expressios, how to iterate over a series of values
More informationRecursion. Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Review: Method Frames
Uit 4, Part 3 Recursio Computer Sciece S-111 Harvard Uiversity David G. Sulliva, Ph.D. Review: Method Frames Whe you make a method call, the Java rutime sets aside a block of memory kow as the frame of
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationn The C++ template facility provides the ability to define n A generic facility allows code to be written once then
UCLA PIC 10 B Problem Solvig usig C++ Programmig Ivo Diov, Asst. Prof. i Mathematics, Neurology, Statistics Istructor: Teachig Assistat: Suzae Nezzar, Mathematics Chapter 13 Templates for More Abstractio
More information