Comparison between nmos Pass Transistor logic style vs. CMOS Complementary Cells*
|
|
- Todd Marsh
- 5 years ago
- Views:
Transcription
1 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 Los Angeles, CA 989, USA Hngzhou, Zhejing 328, Chin Astrt This pper ompres three different logi styles for implementing ritrry Boolen funtions of upto three inputs in terms of their lyout re, dely nd power dissiption. The three styles re nmos pss trnsistor sed design, NAND gte sed design, nd CMOS omplementry logi design. Results of the omprison show tht pss trnsistor sed design is superior to NAND sed design, ut loses to CMOS omplementry logi design. I. Introdution Dely nd power dissiption hve emerged s the mjor onerns of designers. The gte dely depends on the pitive lod of the gte. The dominnt term in power dissiption of CMOS iruits is the power required to hrge or dishrge the pitne in the iruit. Thus y reduing pitne we n derese the iruit dely nd power dissiption. Cpitne is in turn funtion of logi ells eing used in the design. There is urrently inresed interest in nmos pss trnsistor sed ells euse they pper to redue the pitne ompred to their stti CMOS ounterprts. There re indeed reent reports [] sed on full dder iruit omprison whih show tht nmos pss trnsistor logi to e more effiient thn CMOS omplementry logi. However some key questions remin unnswered. One of these questions is how the nmos pss trnsistor sed ell ompres to the NAND-sed ell or the CMOS omplementry ell (lso referred to ustom CMOS in the sequel) in terms of its performne hrteristis. In this pper we use the pss trnsistor sed ell Y in [] to onstrut si three input ell: NMUX2 ( multipleer followed y n inverter). Net we implement nd ompre 2 PNN-omplete three-input funtions whih over ll possile oolen funtions of less thn three-inputs y doing the physil lyout using the NMUX2 ell, using the three input NAND gte, nd finlly using CMOS omplementry logi gte. Our results show tht using the ustom CMOS ells yields the est performne hrteristis in terms of re, delynd power dissiption. The NMUX2-sed design rnks seond wheres the NAND3 sed design is distnt third. This onlusion should however e viewed in light of * This work ws supported in prt y DARPA under ontrt #F C-627. the ft tht the urrent tehnology mpping methods (e.g.,[7]) perform est when mpping is done to CMOS ells However there is room for improvement y using BDD sed tehniques to diretly synthesize pss trnsistor sed logi. For emples see [5, 6]. This pper is orgnized s follows. In the net setion we propose si three-input pss trnsistor ell NMUX nd ompre it with three-input NAND gte. In setion III we provide omprehensive omprison etween the three different logi styles: NMUX sed logi design, NAND gte sed logi design nd CMOS omplementry logi sed design. Setion IV desries our onlusions. II. Pss Trnsistor NMUX ell vs. CMOS NAND Gte A ell lirry is proposed in [], whih inludes four CMOS inverters with different driving pilities nd three psstrnsistor sed ells, Y, Y2, Y3 s shown in Fig.(). The output inverters mrked y lrge dot in these ells re omposed of five or three MOS trnsistors s shown in Fig.(). It is seen tht feedk inverter nd pull up pmos trnsistor, oth onsisting of minimum-size MOSFET s re inluded in the left onfigurtion to void DC lekge urrent in the CMOS inverter. If the onfigurtion with five trnsistors is used, the timing of the feed k signl is stle no mtter how lrge the lod pitne is. However, when the design proess is suh tht the designer n ensure tht the lod pitne of ell remins within n llowle rnge, the right onfigurtion in Fig.() with three trnsistors my e used. We hose ell Y in Fig.() nd onventionl CMOS ell of similr size for omprison. If we use onventionl NAND gtes in the design, emintion of rel designs indites tht the verge fnin ount of NAND gte is out 2.7 [2]. Thus, we hose the three-input NAND gte shown in Fig.2() for the purpose of omprison. Sine the ndidte reliztion using pss trnsistor sed ells should hve the sme numer of trnsistors s tht of three input NAND ells, we ompose ell Y with the three trnsistor inverter in Fig.() nd use stndrd inverter to generte the omplement ontrol signl C s shown in Fig.2(). Thus, oth ells in Fig.2 hve three-input terminls nd nerly the sme numer of trnsistors. (Cell in Fig.2() hs one etr minimum size pull up pmos trnsistor). The ell in Fig.2() n e nmed NMUX
2 V DD V DD Y Y 2 Y 3 Fig.() Pss Trnsistor Bsed Cell () output inverter V DD + Fig.2() Three input NAND gte () Three input pss-trnsistor sed NMUX ell Fig.3() Pss-trnsistor sed three input NAND gte euse it is multipleer (MUX gte) followed y n inverter (NOT gte). Comprison etween two si ells (whih hve equl numer of input terminls) my inlude the following: () logi struture with MUX. Silion re. 2. numer of ells required to relize ny funtion of k vriles 3. signl propgtion dely through the ell
3 4. power dissiption of eh ell for typil input vetor sequene. Criteri () nd (2) determine hip re wheres riteri (3) nd (4) ffet the iruit timing nd power dissiption. Tle. Comprison etween CMOS NAND nd Pss Trnsistor Bsed NAND Three-input Fig.2(): Fig.3(): Psstrnsistor-sed NAND gte Conventionl Tr. Count 6 () 3 (2.7) Are 329µm 2 () 579µm 2 (.75) Dely 295ps () 465ps (.58) Power.9µW/MHz ().96µW/MHz (.5) In [], Y 2 ell nd two inverters re used to form pss-trnsistor sed three-input NAND gte, s shown in Fig.3(). If we use the MUX legend to epress the iruit, we otin its orresponding logi struture s shown in Fig.3(). Comprison etween the pss-trnsistor sed three-input NAND gte nd the onventionl CMOS NAND gte is given in Tle. The re, dely nd power re evluted sed on.6 µm tehnology. The gte width of the output inverters in Y 2 ell is shown in Fig.(). The lod pitne is set to ff for the purpose of dely lultion. This tle shows tht the pss-trnsistor sed NAND hs more trnsistors (2.7 times), lrger re (.75 times), nd higher dely (.58 times). However, its power dissiption is etter thn epeted (only.5 times worse). In ft, we should ompre the three-input CMOS NAND gte of Fig.2() with the three-input pss-trnsistor sed NMUX ell of Fig.2(). This is euse these two gtes re the uilding loks of the iruits designed using NAND-sed logi nd pss trnsistor sed logi. It should e ler tht the re nd propgtion dely of the ells in Fig.2() nd 2() re nerly the sme, however, the ltter ells should hve lower power dissiption. This is euse Fig.3() nd Fig.2() hve omprle power dissiption, ut Fig.2() lerly hs lower power dissiption thn Fig.3(). In the following disussion, however, we will e onservtive nd ssume tht oth ells in Fig.2() nd Fig.2() hve omprle re, dely nd power dissiption. Fig.3 nd Tle show tht if we use the onventionl CMOS NAND gte nd pss-trnsistor sed NMUX ell to relize, the CMOS NAND gte is muh etter. However, this emple nnot e used to prove tht the CMOS NAND gte is etter in designing other iruits. For emple, onsider the three-input psstrnsistor sed NMUX ell shown in Fig.2(). If we use the three-input NAND gte nd inverter to relize the sme funtion we will need t lest three NAND gtes nd two inverters [2]. Consequently, the NAND nd NMUX ells hve to e ompred y implementing lrge numer of funtions nd verging results over these funtions s shown net nd in Tle 5. Consider ll funtions of n input. Beuse of the rpid inrese in the numer of funtions s n rises, we onfine our investigtion herewith to n 3. This hs the further merit tht detiled sttistis re lredy ville on the reliztion of n 3 funtions using three-input NAND gtes (nd three-input NOR gtes) [2]. Here we report nd ompre the sttistis for the threeinput pss-trnsistor sed ell to the NAND results. For onveniene, the 256 funtions of n 3 vriles re lssified into 8 representtive Permute(P)- omplete funtions; the 256 funtions re otined from these 8 funtions y input permuttions. Furthermore, we use the deiml numer funtion identifition system of [3] to tke the output vetor of the funtion truth tle nd re-epress it in deiml nottion. For emple, the ove funtion + hs n output vetor of (where the output vlue of minterms through re red from right to left), whih in deiml nottion eomes funtion 39. An emple of P- omplete trnsformtion would e the trnsformtion of the ove funtion + into funtion + y permuting nd. The 8 P-omplete funtions n e further lssified into 22 PN (Permute-Negte) equivlent funtions [3] Every funtion of given PN lss n e trnsformed into nother funtion in the sme lss y input permuttion nd/or input negtion. There re 22 PNomplete funtions for n 3 funtions. As n emple funtion + n e trnsformed into + y negting inputs nd The 22 PN-omplete funtions, n e further lssified into 4 representtive Permute-Negte-Negte (PNN) omplete funtions. Every funtion of given lss n e trnsformed to other funtions in the sme lss y input-negtion, input permuttion nd output negtion. For emple the ove funtion + n e trnsformed into funtion + + y negting inputs nd nd y negting the output. The numer of funtions in eh lss is shown in Tle 4. (The trivil lsses where the funtions re either onstnt or single vrile funtions re shown with *.) Minimum reliztions y using inverters nd NMUX gtes for the 2 non-trivil PNN-omplete funtions (one from eh lss) re tulted in Tle 2. Dt orresponding to NAND reliztion (tken from [2]) re lso listed in the tle for omprison). For eh iruit we report the numer of inverters nd NMUXs used (n inv, n nmu ), the numer of input onnetions (n ) for ll devies used, nd the numer of devie sde levels (n l ). We lso report the orresponding numers given in [2] when the inverter nd three-input NAND gte re used insted. From Tle 2, it n e seen tht if we use the NMUX2 nd inverter in design, we will sve n verge of 38% ells nd 73% inverters. There will lso e 55% redution in the numer of onnetions nd 28% redution in the numer of sde levels. Oviously, re, dely nd power dissiption of these iruits will signifintly e improved sine oth 3-input pss-trnsistor sed ell nd CMOS NAND gte hve pproimtely the sme re, dely, nd power dissiption.
4 We tke the full dder s prtil design emple to ompre oth ells. The sum nd the rry-out outputs re funtions (5) nd (232) respetively: S = ( ) +, Cout = ( ) +. The orresponding design with NMUX2 is shown in Fig.4(), where only three ells nd two inverters re used. However, the S output lone needs si 3-input NAND gtes, s shown in Fig.4(). III. Pss Trnsistor Bsed NMUX ell vs. CMOS Complementry Logi ell Although pss trnsistor sed design yields etter results ompred to NAND gte sed design, the omprison is not tht useful s logi design is lmost never done y using NAND gtes elusively. A relisti omprison would e etween logi design done using stndrd ell lirry (CMOS omplementry ells) nd pss trnsistor sed design. Thus we hve tken one funtion from eh of the 2 PNN non-trivil lsses nd implemented it using Y ells nd ustom CMOS ells. Here, we ssume tht the stndrd ell lirry ontins t lest one funtion of eh PNN-omplete lss. We use.6um tehnology for lying out ll the 2 funtions. We use the MAGIC lyout editor nd use the HP-CMOS4B proess prmeters for etrtion. The HP-CMOS4B Level-39 FET models were used for HSPICE [4] simultions. The lod pitne for eh of the iruits ws set to ff for iruit dely hrteriztion. Worst se dely mesurements were mde for eh funtion implemented using Y-ells, NAND gtes nd ustom CMOS ells y nlyzing the ell struture nd finding the slowest input to output pth hnge. We used the sme input vetors to lulte the power dissiption for eh design. A softwre progrm ws used to lulte the energy used y eh iruit for time period of ns during whih time the output swithed etly twie etween different voltge levels. The progrm lultes disrete version of the V.I.dt integrl when given the supply urrent t intervls of ns for ns. The results re shown in Tle 5. IV. DISCUSSION The tulted results shown ove indite tht lyout using CMOS omplementry ells (olumn 3) yields the est performne hrteristis in terms of dely, power dissiption nd re. This hrteriztion ws done to set referene point whih pss trnsistor logi would hve to improve upon to e vile for use in the future. If the ells were only mpped to NAND ells, then the Y-ell pss trnsistor implementtion would e superior for the 2 PNN - omplete funtions. This is however not ommon prtie. The purpose of this pper ws to investigte the viility of Y-ell pss trnsistor logi to synthesize iruits s opposed to 3-input NAND gtes nd ustom CMOS ells. From the ove tle, it n e seen tht the Y-ell implementtion yields lower res for given dely when ompred to NAND gte implementtion. However Y-ell sed implementtions ompred with ustom lyout implementtions tend to e inferior. It n e seen tht the Y-ell implementtion yields iruits of smller res thn the NAND gte implementtion in out of the 2 ses, ut when ompred to ustom lyout, they re lrger in 2 out of 2 ses. As for energy onsumption under the sme input vetor sequene, the Y-ell implementtion yields etter results in only 5 ses when ompred to NAND ells nd ompred to ustom CMOS ells Thus in terms of power dissiption the results re somewht unertin. In summry, the Y-ell implementtion seems to yield etter results for dely nd re mesurements when ompred with NAND gte sed implementtion ut is inferior to CMOS omplementry ells. Our onlusion is however sed on the premise tht the sme synthesis nd mpping tehnology is used for oth stndrd ell sed design nd pss trnsistor sed designs. If the synthesis nd mpping sripts re hnged it is possile tht pss trnsistor logi style would e etter hoie thn stndrd ell logi. Our pper does neither support nor rejet this possiility. Furthermore we ssumed tht the ASIC lirry is PNN omplete with respet to ll 2 nd three input funtions. REFERENCES [] K.Yno, Y. Sski, K.Rikino nd K. Seki, Top-down pss-trnsistor logi design, IEEE J. Solid-stte Ciruits, Vol.SC-3, pp , 996. [2] L.Hellermn, A tlogue of three-vrile OR-Invert nd AND-Invert logi iruits, IEEE Trns. Eletron Computers, Vol.E-2, pp98-223, 963. [3] G. J. Klir, Introdution to the Methodology of Swithing Ciruits, D. Vn Nostrnd Compny, 972. [4] HSPICE refrene mnuls y Met Softwre. [5] P. Buh, A. Nryn, A. R.Newton, A. Sngiovnni- Vinentelli, On synthesizing pss-trnsistor networks, Interntionl Workshop on Logi Synthesis, 997. [6] V.Berto, S.Minto, P.Verpletse, L.Benini, G. De iheli, Deision digrms nd pss trnsistor logi synthesis, Interntionl Workshop on Logi Synthesis,997. [7] K.Keutzer, Tehnology mpping nd lol optimiztion, Pro. of the 24 th Design Automtion Conferene, pp , 987.
5 Funtion Funtionl epression NMUX nd inverter NAND nd inverter (deiml) n inv n nmu n n l n inv n nnd n n l (27) ( ) (26) () + ( ) (63) (5) ( ) (52) (47) (232) ( ) (22) (2) (5) ( ) (53) Tle 2:Fourteen representtive funtion for n<4 + = Tle 3: NMUX vs. NAND sttistis for n = 2,3 funtions Type of iruit ell 3-input NMUX 3-input NAND Numer of input terminls per ell 3 () 3 () Totl numer of devies required for ell funtions 593 (.53) 5 () Averge inverter ount per funtion.5 (.36).4 () Averge ell ount per funtion.8 (.58) 3.9 () Averge input onnetion ount per funtion 5.3 (.44).4 () Averge sde level ount per funtion 2.5 (.7) 3.8 () S C out S Fig.4() Full Adder y using NMUX2 () Sum reliztions y using three input NAND gte Tle 4: Clssifition of n<4 funtions into 4 PNN lsses Clss I II III IV V VI VII VIII IX X XI XII XIII XIV Funtion in (Deiml) Numer of funtions * *
6 Tle 5: Detiled Comprison FUNCTION (Deiml) AREA(um 2 ) DELAY(ns) ENERGY(pJ) TWO && THREE INPUT NAND GATE CMOS COMPLEMENTARY LOGIC PASS TRANSISTOR LOGIC 27: AREA DELAY
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 informationSMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS
Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering
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 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 informationPhotovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink
hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,
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 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 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 informationA METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES
A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED OLTAGE WAESHAPES M.H.J. Bollen, L.D. Zhng Dept. Eletri Power Engineering Chlmers University of Tehnology, Gothenurg, Sweden Astrt:
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 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 informationFault tree conversion to binary decision diagrams
Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.
More informationDistance vector protocol
istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers
More informationA Fast Delay Analysis Algorithm for The Hybrid Structured Clock Network
A Fst Dely Anlysis Algorithm for The Hyrid Strutured Clok Network Yi Zou 1, Yii Ci 1,Qing Zhou 1,Xinlong Hong 1, Sheldon X.-D. Tn 2 1 Deprtment of Computer Siene nd Tehnology, Tsinghu University, Beijing,
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 informationCS 130 : Computer Systems - II. Shankar Balachandran Dept. of Computer Science & Engineering IIT Madras
CS 3 : Computer Systems - II Shnkr Blchndrn (shnkr@cse.iitm.c.in) Dept. of Computer Science & Engineering IIT Mdrs Recp Differentite Between s nd s Truth Tbles b AND b OR NOT September 4, 27 Introduction
More information[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116
[Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth
More informationDuality in linear interval equations
Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny
More informationIntroduction to Algebra
INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh
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 informationLecture 12 : Topological Spaces
Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X
More informationDistance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions
Distne Computtion etween Non-onvex Polyhedr t Short Rnge Bsed on Disrete Voronoi Regions Ktsuki Kwhi nd Hiroms Suzuki Deprtment of Preision Mhinery Engineering, The University of Tokyo 7-3-1 Hongo, Bunkyo-ku,
More informationGENG2140 Modelling and Computer Analysis for Engineers
GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points
More informationInter-domain Routing
COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit
More informationParadigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms
Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History
More informationCOMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.
COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those
More informationOutline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP
ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression
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 informationSingle-Layer Trunk Routing Using 45-Degree Lines within Critical Areas for PCB Routing
SASIMI 2010 Proeedings (R3-8) Single-Lyer Trunk Routing Using 45-Degree Lines within Critil Ares for PCB Routing Kyosuke SHINODA Yukihide KOHIRA Atsushi TAKAHASHI Tokyo Institute of Tehnology Dept. of
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 information4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.
428 T FOU 4.3 Blned Trees T BT GOIT IN T VIOU setion work well for wide vriety of pplitions, ut they hve poor worst-se performne. s we hve noted, files lredy in order, files in reverse order, files with
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 informationAdditional Measurement Algorithms in the Overhauser Magnetometer POS-1
Additionl Mesurement Algorithms in the Overhuser Mgnetometer POS-1 O.V. Denisov, A.Y. Denisov, V.A. Spunov (QM Lortory of Url Stte Tehnil University, Mir 19, Ekterinurg, 620002, Russi) J.L. Rsson (Royl
More informationAdvanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.
Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,
More informationMarek A. Perkowski, Malgorzata Chrzanowska-Jeske, and Yang Xu, Portland State University. Portland, OR Abstract
LATTICE DIAGRAMS USING REEDMULLER LOGIC Mrek A. Perkowski, Mlgorzt ChrznowskJeske, nd Yng Xu, Deprtment of Eletril Engineering Portlnd Stte University Portlnd, OR 9727 Astrt Universl Akers Arrys (UAA)
More informationLecture 7: Integration Techniques
Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.
More information1. Be able to do System Level Designs by: 2. Become proficient in a hardware-description language (HDL)
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
More informationCOSC 6374 Parallel Computation. Dense Matrix Operations
COSC 6374 Prllel Computtion Dense Mtrix Opertions Edgr Griel Fll Edgr Griel Prllel Computtion Edgr Griel erminology Dense Mtrix: ll elements of the mtrix ontin relevnt vlues ypilly stored s 2-D rry, (e.g.
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More information10.2 Graph Terminology and Special Types of Graphs
10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the
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 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 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 informationSmart Output Field Installation for M-Series and L-Series Converter
Smrt Output Field Instlltion for M-Series nd L-Series Converter Instlltion Proedure -- See setion 5.0, Instlltion Proedure 1. Open the Housing nd Prepre for Instlltion 2. Plug the Rion Cle into the Min
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 informationCOMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE
24 th Interntionl Conferene on Eletriity Distriution Glsgow, 12-15 June 2017 Pper 0615 COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE Mihel SANKUR Dniel ARNOLD Lun SCHECTOR
More informationCalculus Differentiation
//007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte
More informationSOFTWARE-BUG LOCALIZATION WITH GRAPH MINING
Chpter 17 SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING Frnk Eihinger Institute for Progrm Strutures nd Dt Orgniztion (IPD) Universit-t Krlsruhe (TH), Germny eihinger@ipd.uk.de Klemens B-ohm Institute for
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 informationMinimal Memory Abstractions
Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures
More informationStack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures
Other Issues Stck Mnipultion support for procedures (Refer to section 3.6), stcks, frmes, recursion mnipulting strings nd pointers linkers, loders, memory lyout Interrupts, exceptions, system clls nd conventions
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 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 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 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 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 informationLesson 4.4. Euler Circuits and Paths. Explore This
Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different
More informationTiling Triangular Meshes
Tiling Tringulr Meshes Ming-Yee Iu EPFL I&C 1 Introdution Astrt When modelling lrge grphis senes, rtists re not epeted to model minute nd repetitive fetures suh s grss or snd with individul piees of geometry
More informationCourse Administration
/4/7 Spring 7 EE 363: Computer Orgniztion Arithmetic for Computers Numer Representtion & ALU Avinsh Kodi Deprtment of Electricl Engineering & Computer Science Ohio University, Athens, Ohio 457 E-mil: kodi@ohio.edu
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 informationFinal Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book
inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.
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 informationMixed-Signal Testability Analysis for Data-Converter IPs
Mixed-Signl Testility Anlysis for Dt-Converter IPs Arldo vn de Krts nd Hns G. Kerkhoff Testle Design nd Testing of Nnosystems Group MESA+ Institute for Nnotehnology 7500AE Enshede, the Netherlnds Emil:
More informationBalanced Trees. 2-3 trees red-black trees B-trees. 2-3 trees red-black trees B-trees smaller than. 2-node. 3-node E J S X A C.
ymol tle review Blned Trees implementtion gurntee verge se serh insert delete serh hit insert delete ordered itertion? opertions on keys sequentil serh (linked list) N N N N/2 N N/2 no equls() 2-3 trees
More informationChapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.
Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml
More informationComputer Arithmetic Logical, Integer Addition & Subtraction Chapter
Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for
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 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 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 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 informationLesson6: Modeling the Web as a graph Unit5: Linear Algebra for graphs
Lesson6: Modeling the We s grph Unit5: Liner Alger for grphs Rene Pikhrdt Introdution to We Siene Prt 2 Emerging We Properties Rene Pikhrdt Institute CC-BY-SA-3. for We Siene nd Tehnologies Modeling the
More informationWidth and Bounding Box of Imprecise Points
Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,
More information6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.
6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationEECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining
EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more
More informationcisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:
cisc1110 fll 2010 lecture VI.2 cll y vlue function prmeters more on functions more on cll y vlue nd cll y reference pssing strings to functions returning strings from functions vrile scope glol vriles
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 informationAgilent Mass Hunter Software
Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss
More informationVSxF-2/-3/-4 SMALL LINEAR VALVES PN16 FOR MODULATING AND ON/OFF-CONTROL SPECIFICATIONS
VSxF2/3/4 SMLL LINER VLVES PN16 FOR MODULTING ND ON/OFFCONTROL VSxF2 VSxF3 VSxF4 GENERL These smll liner vlves re used in omintion with smll eletri liner vlve tutors nd thermoeletri tutors for the ontrol
More informationCan Pythagoras Swim?
Overview Ativity ID: 8939 Mth Conepts Mterils Students will investigte reltionships etween sides of right tringles to understnd the Pythgoren theorem nd then use it to solve prolems. Students will simplify
More informationJournal of Combinatorial Theory, Series A
Journl of Comintoril Theory, Series A 0 (0) Contents lists ville t SiVerse SieneDiret Journl of Comintoril Theory, Series A www.elsevier.om/lote/jt Spheril tiling y ongruent pentgons Hongho Go, Nn Shi,
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 informationLecture 13: Graphs I: Breadth First Search
Leture 13 Grphs I: BFS 6.006 Fll 2011 Leture 13: Grphs I: Bredth First Serh Leture Overview Applitions of Grph Serh Grph Representtions Bredth-First Serh Rell: Grph G = (V, E) V = set of verties (ritrry
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 informationChapter 4 Fuzzy Graph and Relation
Chpter 4 Fuzzy Grph nd Reltion Grph nd Fuzzy Grph! Grph n G = (V, E) n V : Set of verties(node or element) n E : Set of edges An edge is pir (x, y) of verties in V.! Fuzzy Grph ~ n ( ~ G = V, E) n V :
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
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 informationCS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal
CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front
More informationHere is an example where angles with a common arm and vertex overlap. Name all the obtuse angles adjacent to
djcent tht do not overlp shre n rm from the sme vertex point re clled djcent ngles. me the djcent cute ngles in this digrm rm is shred y + + me vertex point for + + + is djcent to + djcent simply mens
More informationTriple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding
Triple/Qudruple Ptterning Lyout Deomposition vi Novel Liner Progrmming nd Itertive Rounding Yio Lin, Xioqing Xu, Bei Yu, Ross Bldik nd Dvid Z. Pn ECE Dept., University of Texs t Austin, Austin, TX USA
More informationV = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)
Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from
More informationSelecting the Most Highly Correlated Pairs within a Large Vocabulary
Seleting the Most Highl Correlted Pirs within Lrge Voulr Koji Umemur Deprtment of Computer Siene Toohshi Universit of Tehnolog umemur@tutistutjp Astrt Ourene ptterns of words in douments n e epressed s
More informationIMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING
Rsh Al-Tmimi et l, Interntionl Journl of Computer Siene nd Mobile Computing, Vol.4 Issue.1, Jnury- 015, pg. 11-119 Avilble Online t www.ijsm.om Interntionl Journl of Computer Siene nd Mobile Computing
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
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 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 informationRobust Boolean Reasoning for Equivalence Checking and Functional Property Verification
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL., NO. Y, MONTH Roust Boolen Resoning for Equivlene Cheking nd Funtionl Property Verifition Andres Kuehlmnn, Senior Memer,
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall
Department of Eletrial and Computer Engineering University of Wisonsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2014-2015 Assignment #2 Date Tuesday, September 25, 2014 Due
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 informationCompilers Spring 2013 PRACTICE Midterm Exam
Compilers Spring 2013 PRACTICE Midterm Exm This is full length prctice midterm exm. If you wnt to tke it t exm pce, give yourself 7 minutes to tke the entire test. Just like the rel exm, ech question hs
More information