Synthesis of Hazard-Free Multilevel Logic Under Multiple-Input Changes from Binary Decision Diagrams

Size: px
Start display at page:

Download "Synthesis of Hazard-Free Multilevel Logic Under Multiple-Input Changes from Binary Decision Diagrams"

Transcription

1 Synthesis o Hzrd-Free Multilevel Logi Under Multiple-Input Chnges rom Binry Deision Digrms Bill Lin, Memer, IEEE, Srinivs Devds, Memer, IEEE Astrt We desrie new method or diretly synthesizing hzrdree multilevel logi implementtion rom given logi speiition. The method is sed on ree/ordered Binry Deision Digrms (BDD s), nd is nturlly pplile to multiple-output logi untions. Given n inompletely-speiied (multiple-output) Boolen untion, the method produes multilevel logi network tht is hzrd-ree or speiied set o multiple-input hnges. We ssume n ritrry (unounded) gte nd wire dely model under pure dely (PD) ssumption, we permit multipleinput hnges, nd we onsider oth stti nd dynmi hzrds under the undmentl-mode ssumption. Our rmework is thus generl nd powerul. While it is not lwys possile to generte hzrd-ree implementtions using our tehnique, we show tht in some ses hzrd-ree multilevel implementtions n e generted when hzrd-ree two-level representtions nnot e ound. This prolem is generlly regrded s diiult prolem nd it hs importnt pplitions in the ield o synhronous design. The method hs een utomted nd pplied to numer o exmples. The results we hve otined re very promising. A I. INTRODUCTION SYNCHRONOUS design styles re eoming inresingly populr euse they oer the potentil eneits o improved system perormne, voidne o loking prolems, low-power opertion, nd modulr design [8], [7], [8], [4], [26], [9], [2], [28], [2], [2], [5], [6], [27], []. However, the design o orret synhronous iruitry is diiult tsk sine n synhronous iruit n mluntion (i.e. produe unexpeted ehvior) during exeution i it is not ree o hzrds, whih orrespond to undesired glithes in iruit. This is in ontrst with synhronous design styles where the prolem is voided y the use o glol loking sheme tht oordintes nd synhronizes ll olletive tivities. In this pper, we ous on prtiulr lss o hzrds nmely hzrds in omintionl logi. Hzrd-ree omintionl logi is ritil to the orretness o most synhronous designs. Our gol in this work is to develop method tht n synthesize omintionl logi tht voids ll omintionl hzrds under speiied set o multiple-input hnges. This is generl omintionl synthesis prolem whih rises in mny synhronous sequentil pplitions. For exmple, the prolem rises in the urrent synthesis trjetories or synhronous inite stte mhines [2], [28]. In this work, we ssume tht gtes nd wires n hve ritrry delys, whih mens we do not require ounded dely ssumptions or orret opertion or the use o dely elements to ix or ilter out glithes. We lso ssume pure dely (PD) model, whih mens we do not ssume Mnusript reeived Deemer 8, 993; Ferury 7, 995. This pper ws reommended y Assoite Editor K. Keutzer. B. Lin is with IMEC, B-3 Leuven, Belgium. S. Devds is with the Deprtment o EECS, MIT, Cmridge, MA 239 USA. IEEE Log Numer the presene o slow inertil delys to insure orretness. The two-level minimiztion version o the prolem hs een ddressed y numer o reserhers in the pst [25], [6], [], [5], [3], [4], []. More reently, Nowik [22] hs developed n ext two-level minimizer tht omines numer o previous ides on this prolem. A limittion o the two-level implementtion pproh is tht it is not lwys possile to ind two-level over tht n insure reedom rom ll stti nd dynmi hzrds even though hzrd-ree multilevel implementtion my exist. In this pper, we desrie new rmework sed on Binry Deision Digrms (BDD s) or synthesizing hzrd-ree multilevel logi implementtion diretly rom logi desription. A Binry deision digrm is direted yli grph representtion o Boolen untion. BDD s hve gined widespred use in the res o orml veriition nd logi synthesis due to the nonil nd esily mnipulle nture o lss o BDD s [7]. Our rmework is sed on the use o oth ree s well s ordered BDD s nd is nturlly pplile to multiple-output logi untions. We permit multiple-input hnges, nd we onsider oth stti nd dynmi hzrds, whih mens the resulting rmework is generl nd powerul. In prtiulr, we show tht multiplexor logi network derived rom redued ree or ordered BDD y repling eh node in the BDD y twoinput multiplexor is ree o ll stti logi hzrds. For dynmi logi hzrds, we hve developed the Trigger Signl Ordering Requirement (or TSO-Requirement or short) on the BDD vrile ordering tht, i stisied, will led to multiplexor logi network tht is lso ree o ll dynmi logi hzrds or the given set o llowle input trnsitions. The resulting multiplexor logi network is proved to e ully hzrd-ree under ritrry gte nd wire delys. While it is not lwys possile to generte hzrd-ree implementtions using our tehnique, even i n implementtion theoretilly exists, in mny ses we re le to generte hzrd-ree multilevel implementtions when hzrd-ree two-level implementtions nnot e ound. We hve lso developed se replement strtegies tht n reple multiplexor y untionl equivlent sum-o-produts representtion whih preserves the hzrd-ree properties. We provide hrteriztion on when suh replements re possile. The prt o the network tht n e sely repled y AND- nd OR- gtes n e urther optimized using nonhzrd-inresing logi trnsormtions, suh s the ones disussedin[3]. Our omintionl logi synthesis method n e pplied diretly to the synthesis o hzrd-ree logi or synhronous stte mhines tht operte under the undmentl mode s-

2 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST sumption [2], [28]. Further, it n e generlized to the extended urst-mode stte mhine se [29]. We hve utomted our method nd hve pplied it to numer o exmples. The results we hve otined re very promising. A. Bsi Deinitions II. BACKGROUND To simpliy the disussion, we will onsider single-output untions only with inry input nd output vriles. Extension to multiple-output untions is strightorwrd. Let ; g n e Boolen spe. Eh A 2 ; g n,orresponding to point in the Boolen spe, is reerred to s minterm. It will lso e reerred to s n input stte or simply stte. A Boolen untion,, on vriles, x ;x 2 ;:::;x n,isdeined s mpping: : ; g n!;;æg. TheON-set o untion is the set o minterms or whih the untion hs vlue. The OFF-set is the set o minterms or whih the untion hs vlue. TheDC-set (don t-re set) is the set o minterms or whih the untion hs the vlue æ. A ue o Boolen untion is written s = ë ; æææ; n ë.for ç i ç n, i is i vrile x i ppers omplemented in, i is i vrile x i ppers unomplemented in, nd i is, i x i does not pper in. Thus, ue is set o minterms. We will write 2 d, i ue is suh tht or eh position in tht hs the orresponding position in ue d hs or,, nd or eh position in tht hs the orresponding position in d hs or,. The intersetion o two ues nd d is empty i there is position i where i = nd d i = or vie vers. I the intersetion is not empty, then it n e omputed s new ue e = ë d, wheree i =i either i =or d i =, e i =i either i =or d i =,nde i =, otherwise. A trnsition ue is ue with strt point nd n end point. Given input sttes A nd B, the trnsition ue ëa; Bë rom A to B hs strt point A nd end point B nd ontins ll minterms tht n e rehed during trnsition rom A to B. It n e represented y the smllest ue tht ontins oth A nd B. The open trnsition ue ëa; Bè rom A to B is deined s ëa; Bë, B. A multiple-input hnge or input trnsition rom input stte A to B is desried y trnsition ue ëa; Bë. We will use the nottion A è B to denote the the input trnsition rom A to B. Input vriles re ssumed to hnge simultneously. Equivlently, sine inputs my e skewed ritrrily y wire delys, inputs n e ssumed to hnge monotonilly in ny order nd t ny time. One multiple-input hnge ours, no urther input hnges my our until the iruit hs stilized. An input trnsition rom stte A to B or Boolen untion is sttitrnsitioni èaè = èbè;itis dynmi trnsition i èaè 6= èbè. In the se o n inompletely speiied untion, we ssume tht is ully deined or every speiied stti nd dynmi trnsition; tht is, or every X 2 ëa; Bë, èxè 2 ; g. B. Modeling Delys We ssume gtes nd wires in omintionl iruit n hve ritrry inite delys. Eh gte is modelled s n instntneous Boolen opertor with dely element tthed to its output wire. This dely element desries the totl gte dely. Eh wire is modelled s onnetion with n tthed dely element. This dely element desries the totl wire dely. The delys my hve ritrry ut inite vlues. Sine dely elements re tthed only to wires, this model hs een lled the unounded wire dely model. We ssume pure dely model, whih mens pulse o ny length n propgte. A dely ssignment is n ssignment o ixed inite dely vlues to every gte nd wire in iruit. C. Funtion Hzrds A untion whih does not hnge monotonilly during n inputtrnsition is sid to hveuntion hzrd in the trnsition. Deinition (Stti untion hzrd) A Boolen untion ontins stti untion hzrd or input trnsition rom A to C i:. èaè =ècè, nd 2. there exists some stte B 2 ëa; Cë suhtht èaè 6= èbè. Deinition 2 (Dynmi untion hzrd) A Boolen untion ontins dynmi untion hzrd or input trnsition rom A to D i:. èaè 6= èdè, nd 2. there exists pir o sttes B nd C (A 6= B; C 6= D) suh tht () B 2 ëa; Dë nd C 2 ëb; Dë nd () èbè =èdènd èaè =ècè. I trnsition hs untion hzrd, no implementtion o the untion n void glith on the trnsition, ssuming ritrry gte nd wire delys [], [5]. Thereore, we onsider only trnsitions whih re ree o untion hzrds (see [], [4], [3]). D. Logi Hzrds I is ree o untion hzrds or trnsition rom input A to B, it my still hve hzrds due to possile delys in the tul logi reliztion. Deinition 3 (Stti logi hzrds) A omintionl iruit or untion ontins stti logi hzrd or the input trnsition rom A to B i:. èaè =èbè 2. For some dely ssignment, the iruit s output hnges momentrily during the trnsition intervl. This mens tht we hve one or more!! (or!! ) trnsitions while the speiied ehvior is stti (or stti ). Deinition 4 (Dynmi logi hzrds) A omintionl iruit or untion ontins dynmi logi hzrd or the input trnsition rom A to B i:. èaè 6= èbè

3 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST For some dely ssignment, the iruit s output is not monotoni during the trnsition intervl. This mens tht we hve!!! (or!!! ) trnsitions while the speiied ehvior is single! trnsition (or! trnsition). III. BINARY DECISION DIAGRAMS AND DERIVED MULTIPLEXOR NETWORKS A. Binry Deision Digrms In this setion, we will restte rom [7] the deinitions or ree Binry Deision Digrms nd redued ordered Binry Deision Digrms. We will then indite how multiplexor-sed multilevel logi network n e derived rom them. Given Boolen untion, the untion resulting when some rgument x i o the untion is repled y onstnt 2 ; g is lled otor o the untion with respet to x i =, nd this is denoted s j xi=. Tht is, or ny rguments x ;:::;x n, j xi=èx ;:::;x n è=èx ;:::;x i, ;;x i+ ;:::;x n è hve indexèvè é indexèlowèvèè; ndihighèvè is lso nonterminl, then we must hve indexèvè é indexèhighèvèè. A redued ree Binry Deision Digrm (or simply ree BDD) is BDD where we require tht we enounter eh vrile t most one in ny pth in the BDD nd tht the BDD is redued, ut do not require strit vrile ordering restritions on BDD s. Tht is, dierent pths my hve dierent vrile ordering s long s eh vrile is enountered t most one long ny pth. B. Deriving Multilevel Multiplexor Logi Network A multilevel logi network n e derived diretly rom BDD y repling eh BDD vertex with two-input MUX- ELEMENT. An exmple is shown in Figure. A BDD nd its orresponding derived multiplexor multilevel network re shown in Figure () nd (), respetively. The multiplexor network n e simpliied y mens o onstnt propgtion. Tht is, the MUX-ELEMENTs n e repled y simpler gtes i one or more o its inputs is onstnt. This propgtion n e rried out topologilly rom inputs to outputs. The simpliied network is shown in Figure (). Using this nottion, the Shnnon expnsion o untion with respet to vrile x i is given y: = x i æ j xi= + x i æ j xi= Deinition 5 (BDD) A Binry Deision Digrm is rooted, direted yli grph with vertex set V ontining two types o verties. A non-terminl vertex v hs s ttriutes n rgument index indexèvè 2 ;:::;ng nd two hildren lowèvè; highèvè 2 V. A terminl vertex v hs s ttriute vlue vlueèvè 2;g. The orrespondene etween BDD s nd Boolen untions is deined s ollows: Deinition 6 A Binry Deision Digrm G hving root vertex v denotes untion v deined reursively s:. I v is terminl vertex: () I vlueèvè =,then v =. () I vlueèvè =,then v =. 2. I v is non-terminl vertex with indexèvè = i, then v is the untion: x i is lled the deision vrile or vertex v. We require the ollowing dditionl properties in Binry Deision Digrms:. When trversing ny pth rom terminl vertex to the root vertex we n enounter eh deision vrile t most one. 2. A redued BDD is one in whih lowèvè 6= highèvè or ny vertex v nd no two sugrphs in the BDD re identil. From Deinition 5, nonil orm lled redued ordered Binry Deision Digrm [7] (or simply ordered BDD) n e derived i the ollowing restritions re imposed: or ny nonterminl vertex v,ilowèvè is lso non-terminl, then we must () () () Fig.. () A BDD. () The derived multiplexor multilevel network. () Simpliition o multiplexors y onstnt propgtion. IV. STATIC HAZARD-FREE SYNTHESIS FROM BDD S The hzrd-ree synthesis prolem n e stted s ollows. Given: A (possily inompletely speiied) Boolen untion,ndset,t o speiied untion-hzrd-ree (oth stti nd dynmi) input trnsitions o. Find: A multilevel logi implementtion tht is ree o logi v èx ;:::;x n è=x i æ lowèvè èx ;:::;x n è+x i æ highèvè èx ;:::;x n è hzrds or every input trnsition t 2 T. In this pper, we propose synthesis proedures rom BDD s tht n produe hzrd-ree multilevel logi implementtions. Let us irst onsider simple proedure tht trnsorm n inompletely speiied untion to multiplexor network. I the untion is inompletely speiied, then some preproessing is required s ollows: in the se o n inompletely speiied untion, the don t-re minterms ontined inside some speiied trnsition t 2 T must e ssigned properlyso tht no untionl hzrds n our. The other don t re minterms n e used or optimiztion, or exmple using tehniques desried in [9], [24] (. the restrit nd the generlized otor opertors). So or ll prtil purposes, we only need to onsider

4 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST ompletely speiied untions. One this preproessing step is perormed, the synthesis proedure is s ollows:. Construt BDD G or the Boolen untion. The BDD here is ment to e either n ordered or ree redued BDD, where eh vrile n pper t most one long ny pth. 2. Generte multilevel iruit C y repling eh BDD node with two-input MUX-ELEMENT. For the hzrd nlysis in this setion, we will irst ssume tht the MUX-ELEMENT is n tomi gte with no internl hzrds, nd tht the MUX-ELEMENT nd the wires onneting them n hve ritrry delys. An implementtion o hzrdree multiplexor is shown in Figure 2. The only onstrint on the lyout o the gte is tht the dierene in the delys o the two pths rom the ontrol input tht pss through the uer nd the inverter should e smller thn the inertil dely orresponding to trnsistor turning on or o. Fig. 2. A trnsistor-level implementtion o hzrd-ree multiplexor. The logil untion implemented y the gte is = æ +æ. This untion is ree o ll dynmi hzrds, ut hs potentil stti logi hzrd on the! trnsition on with nd onstnt t. However, i the pth lning riterion stted ove is met, then the implementtion o the MUX-ELEMENT will not hve stti hzrd. We will irst nlyze stti hzrd properties o suh networks ssuming the MUX-ELEMENT s si hzrd-ree element. We will deer to Setion VI the disussion regrding the replement o MUX-ELEMENTs with si gtes, the onstnt propgtion issue, nd possile simpliition nd resynthesis steps. Theorem (Stti logi hzrd-reeness) Let C e iruit derived rom BDD G y repling eh node in G with hzrd-ree multiplexor. C is ree o ll possile stti hzrds under ny multiple-input hnge tht does not orrespond to untion hzrd. Proo: Without loss o generlity we will ssume single speiied stti trnsition A è B. The iruit C implements the Boolen untion whih is ree o untion hzrds or the speiied input trnsition A è B. Further the iruit C hs een derived using the synthesis proedure outlined. Assume tht the multiplexor driving the output o C hs s its ontrol vrile. The dt inputs to the multiplexor orresponds to untions nd, the Shnnon otors o with respet to nd. Assume tht is to mke stti! trnsition, i.e. èaè =nd èbè =. We will irst onsider the se when the input is t onstnt. Clerly, i is, will e ree o stti hzrds i remins t onstnt nd is ree o hzrds. We know tht èaè =nd èbè =. Further we know tht 8m 2 ëa; Bë, èmè =. Otherwise, it implies tht there is untion hzrd ssoited with. Sine n only mke stti trnsition in A è B, lerly will e ree o stti hzrds i is ree o stti hzrds. One n reursively pply the nlysis ove to to show tht it is ree o stti hzrds. We will inlly reh the se se where the ontrol vrile to the muliplexor is x nd oth the dt inputs re onstnts. I oth dt inputs re the sme, then this multiplexor will not exist in the BDD or the iruit C y the redution rules o BDDs. Otherwise, this multiplexor redues to either the literl untion x or its negtion x. Then the input x is ssumed to remin t onstnt in the se o x nd t onstnt in the se o x. Otherwise, there is untion hzrd ssoited with. In the se when the input is t onstnt, then will e ree o stti hzrds i is ree o hzrds. This ollows rom similr rguments s ove. Next onsider the se when the input mkes! trnsition or! trnsition orresponding to A è B. Clerly will e ree o stti hzrds i oth nd re ree o hzrds. We lim tht oth èaè = èbè = nd èaè = èbè =. Further we lim tht 8m 2 ëa; Bë, èmè = èmè=. Thereore, oth nd n only mke stti trnsition in A è B. Thus, it is suiient to show tht they re ree o stti hzrds. Agin, this rgument n e reursively pplied to nd with the sme se se s ove. Sine oth nd remin t onstnt nd re hzrd ree, only the ontrol vrile n hnge t the multiplexor ssoited t the output o. By the ssumption tht the multiplexor is n tomi gte nd is internlly hzrd-ree, then is lso ree o stti hzrds or the stti trnsition ëa; Bë. The proo or the se when mkes stti! trnsition ollows similrly. Theorem sttes tht the derived iruit is ree o stti hzrds or ny input trnsition tht does not use untion hzrd. So we now sy tht multiplexor implementtion rom either ree or n ordered BDD is ree o ll untion hzrds (y deinition) nd ree o ll stti logi hzrds. An importnt orollry is s ollows. Corollry The stti hzrd-reeness o C is independent o the vrile ordering hosen or the BDD G. Further, the BDD G n e ree BDD with dierent orderings long dierent pths. Proo: Follows rom Theorem. This mens tht there re no restritions on the vrile ordering or stti hzrds. This is however not lwys the se or dynmi logi hzrds, s will e desried next. V. DYNAMIC HAZARD-FREE SYNTHESIS FROM BDD S While multiplexor implementtion derived rom redued BDD is gurnteed to e ree o stti logi hzrds, it is not neessrily ree o dynmi logi hzrds. In this setion, we will irst hrterize the prolem. Then we will present method tht will ensure the non-existene o dynmi hzrds s well.

5 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST A. The Prolem Let us onsider n exmple shown in Figure 3. Let us onsider the dynmi input trnsition æ æ è ; where èè = nd èè = : We will use " æ " to indite tht the orresponding signl is exited to hnge. In this se, the signls nd re exited to mke the trnsitions + nd +. The orresponding trnsition ue is ë; ë =,,: Now suppose we implement n ordered BDD with the vrile ordering éé. The orresponding BDD is shown in Figure 4. T Fig. 3. Dynmi-hzrd exmple. T2 T3 = T T2 Fig. 4. BDD implementtion with ordering éé. Let us onsider multiplexor implementtion trnslted rom this BDD. This multiplexor implementtion n exhiit dynmi hzrd s ollows:. Initilly, =, =, =. This implies T =, T2=, T3 =,ndf =, wheretheti s re the output o the multiplexors nd F is the output o the iruit. 2. In the trnsition è, oth n + nd + n our onurrently. Rell tht under the unounded gte/wire dely ssumption, either + n our irst or + n our irst, ut we must onsider oth trnsition orderings. Let us ssume + ours irst nd mkes! trnsition. 3. Then T 2 mkes! trnsition, ut T is slow to hnge. F mkes! trnsition. 4. Then let + hppen, mking! trnsition, ut T is still slow to hnge to, mening it is still t vlue. This will use F to hnge! k to. 5. Finlly, T hnges rom!. This uses F to hnge! k to. Thus, the trnsition sequene!!! hs ourred on F, dynmi hzrd hs een mniested. However, when + ours irst, the dynmi trnsition tkes ple without ny dynmi logi hzrds. This is euse when + ours irst, nothing hnges. Then when + ours, T will hnge, whih will use F to hnge, ut F only hnges one. Now onsider insted n lterntive BDD implementtion using vrile orderings ééor éé, shown in Figure 5 () nd (), respetively. T (A) < < T2 T (B) < < Fig. 5. BDD implementtion with orderings () éénd () éé. Let us irst onsider multiplexor implementtion trnslted rom the BDD shown in Figure 5 (). This multiplexor implementtion is ree o dynmi hzrds under the trnsition è. The nlysis is s ollows.. Initilly, =, =, =. This implies T =, T2=, nd F =. 2. I + hppens irst, then F will hnge!. Then when + ours, nothing else hnges. Hene there is no dynmi hzrd. 3. I + hppens irst, nothing hppens. Then when + ours, F hnges rom!. Agin no dynmi hzrd ours. Let us now onsider multiplexor implementtion trnslted rom the BDD shown in Figure 5 (). This multiplexor implementtion is ree o dynmi hzrds under the trnsition è. The nlysis is s ollows.. Initilly, =, =, =. This implies T =, T2=, nd F =. 2. I + hppens irst, then F will hnge!. Then when + ours, nothing else hnges. Hene no dynmi hzrd ours. 3. I + hppens irst, nothing hppens. Then when + ours, F hnges rom!. Agin no dynmi hzrd ours. From this inorml introdution, we will show tht the vrile ordering in t plys very importnt role in gurnteeing reedom rom dynmi hzrds. Rell tht we hve lredy stted tht BDD implementtions re ree o stti hzrds. The removl o dynmi hzrds is ddressed next. B. Conditions or Dynmi Hzrd-Freeness In this setion, we will onsider the requirements on the BDD synthesis proedure in order to produe multiplexor implementtion ree o dynmi logi hzrds. We will irst onsider this requirement with respet to n ordered BDD implementtion. We will deer to Setion V-E the disussion regrding the employment o ree or unordered BDD s to stisy the sme requirement. The key to the nlysis is the onept o trigger signls. T2

6 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST Deinition 7 (Context signl) Given n input trnsition A è B, signl q is sid to e ontext signl i it hnges its vlue ross A nd B. I it remins t onstnt vlue in A nd B, then it is sid to e non-ontext signl. By the deinition o input trnsition (. Setion II-A), ontext signl n only monotonilly hnge one during A è B trnsition. Deinition 8 (Exited signl) Given stte X 2 ëa; Bë in the input trnsition A è B, ontext signl q is sid to e exited in X i nd only i its vlue in X is equl to its vlue in A. Deinition 9 (Quiesent signl) Given stte X 2 ëa; Bë in the input trnsition A è B, ontext signl q is sid to e quiesent signl in X i its vlue in X is equl to its vlue in B. In the exmple shown in Figure 3, signls nd re ontext signls in the trnsition è use oth re enled to hnge vlues, wheres is non-ontext signl in this trnsition. Signls nd re exited in stte euse oth signls n hnge. In the stte, only is exited ; the signl is quiesent in stte. Deinition (Trigger stte, signl, trnsition) A stte X 2 ëa; Bë in dynmi input trnsition A è B is sid to e trigger stte or A è B i nd only i there is n exited signl q (q+ or q,) suh tht the stte Y 2 ëa; Bë rehed y hnging q hs dierent output vlue rom X: i.e., èxè 6= èy è. The signl q is lled trigger signl o X in A è B, nd the orresponding trnsition, either q+ or q,, is lled trigger trnsition o X in A è B. In given trigger stte, n exited signl tht will not use the output to hnge is reerred to s non-trigger signl. Its orresponding trnsition is reerred to s non-trigger trnsition. Reerring gin to Figure 3, sttes nd sttes re trigger sttes sine èè nd èè re oth equl to, ut there exists signl trnsition rom either stte tht will use the output to hnge to. In the se o, oth nd re exited to hnge. Chnging will use the output to hnge to. In this se, is trigger signl nd + is trigger trnsition. Chnging irst will not use the output to hnge (it requires hnging lso). In this se, is non-trigger signl nd + is non-trigger trnsition. Inormlly, the si ide here is to onstrut BDD suh tht trigger signls re ordered eore non-trigger signls. Tht is, or every trigger stte or given dynmi input trnsition A è B, the BDD vrile ordering must e suh tht the trigger signls pper in the vrile ordering eore the non-trigger signls. This is ormlized in the ollowing requirement. Deinition (Trigger signl ordering (TSO-) requirement) Given untion, n ordered BDD G or is sid to stisy the Trigger Signl Ordering (TSO-) Requirement or dynmi input trnsition A è B in T i nd only i the ollowing two onditions hold:. For every trigger stte X 2 ëa; Bë, the trigger signl vriles in X pper in the vrile ordering eore the nontrigger signl vriles. 2. For every trigger stte X 2 ëa; Bë with multiple trigger signls, the trigger signl vriles in X ll pper eore eh o the quiesent signl vriles, or ll pper ter eh o the quiesent signl vriles. The BDD G is sid to stisy the TSO-requirement glolly i nd only i its vrile ordering stisies the TSO-requirement or every speiied dynmi input trnsition. The seond ondition ensures tht there is no quiesent signl in etween ny trigger signls during ny speiied trnsition. I strit vrile ordering n e ound tht n stisy the TSO-requirement glolly, then the derived multiplexor network is lso ree o dynmi hzrds. Theorem 2 (Dynmi logi hzrd-reedom) Let C e iruit derived rom BDD G y repling eh node in G with hzrd-ree multiplexor. C is ree o dynmi hzrds or ll speiied dynmi trnsitions, i the TSO-requirement is stisied glolly. Proo: Without loss o generlity we will ssume single speiied dynmi trnsition A è B. The iruit C implements the Boolen untion whih is ree o untion hzrds or the speiied input trnsition A è B. Further the iruit C hs een derived using the synthesis proedure outlined. Assume tht the multiplexor driving the output o C hs s its ontrol vrile. The dt inputs to the multiplexor orrespond to untions nd, the Shnnon otors o with respet to nd. Assume tht is to mke! trnsition, i.e. èaè = nd èbè =.. We will irst onsider the se when the input is t onstnt. Clerly, i is, will e ree o dynmi hzrds i is ree o dynmi hzrds. 2. I is onstnt, will e ree o dynmi hzrds i is ree o dynmi hzrds. 3. Next onsider the se when the input mkes! trnsition orresponding to A è B. () Consider the se when èaè = nd èbè =. We lim tht èaè = èbè =. Suppose èaè =. Then, lerly, èaè 6=. Thereore, èaè =. Suppose èbè =. There exists ue m 2 ëa; Bë suh tht èmè =. Clerly the ue m does not ontin the literl or sine the otor is not dependent on. There re two possiilities. In the irst se èmè =. I there is suh ue, then we hve untion hzrd on, on the pth in the trnsition ue ëa; Bë orresponding to A è æ m è æ m è B, euse èaè =, èæmè=, èæmè=,nd èbè =. The seond se orresponds to èmè =. Consider the pth in the trnsition ue A è æ m è æ m è B. We lim tht is non-trigger signl in stte A. I is trigger signl in stte A, then when goes! so does. This mens tht èaè =. Oviously sine èbè = nd is mking! trnsition, èbè =. Cse elow orresponds to èaè = èbè=. Thereore, in stte A the signl is non-trigger signl. I only

7 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST single signl, ll it s, hnges rom A to æm,thensis lerly triggersignl in A. We lerly hve violtion o Condition o the TSO-requirement with non-trigger signl eing eore the trigger signl s in the ordering. Multiple signls ould hnge rom A to æ m. Without loss o generlity onsider the se where two signls s nd s 2 hnge rom A to æm. We hve two pths orresponding to s hnging irst nd s 2 hnging irst. Denote these pths A è æ m è æm nd A è æm 2 è æm. I èæm è=(èæm 2 è=) then s (s 2 ) is trigger signl in stte A. Sine is nontrigger signl in stte A we hve violted Condition o the TSO-requirement. Thereore, we require è æ m è = è æ m 2 è =. I is non-trigger signl in either stte æ m or stte æ m 2,thenwe gin hve violtion o Condition o the TSO-requirement, sine s 2 nd s re, respetively, trigger signls in sttes æ m nd æ m 2. Thereore, is trigger signl in oth sttes æ m nd æ m 2. Now, in stte æ m, we hve two trigger signls, nmely nd s 2 nd quiesent signl s. Similrly, in stte æ m 2,wehve two trigger signls, nmely nd s nd quiesent signl s 2. The orderings és és 2 or és 2 és will oth use violtion o Condition 2 o the TSO-requirement. (A quiesent signl ppers in etween two trigger signls.) In ll ses, the ordering requirement imposed in the onstrution o C hs een violted. Thereore èaè = èbè =. Sine is itsel iruit derived rom BDD, y Theorem, is ree o stti hzrds nd will sty t stedy throughout A è B. nnot hve untion hzrds sine tht would imply dynmi untion hzrd in on A è B. () Consider the se when èaè = èbè =. Sine itsel is iruit otined rom BDD, it is ree o stti hzrds y Theorem. Further, i hs untion hzrd on A è B, then would hve untion hzrd. Thereore is untion hzrd-ree on A è B. I is onstnt t, then y the ove rgument would e ree o stti hzrds s well. This mens would e ree o dynmi nd stti hzrds. I mkes! trnsition on A è B then will e dynmi hzrdree i is dynmi hzrd-ree. I either mkes! trnsition or i mkes! trnsition then ollows nd stys t. Thereore in ll ses, i either or is ree o dynmi hzrds in its! trnsition then will e ree o dynmi hzrds. 4. A similr rgument n e mde or the! trnsition on in A è B to show tht is dynmi hzrd-ree i or is dynmi hzrd-ree. For eh o the our possiilities orresponding to in A è B, we re gurnteed tht i t most one o or is ree o dynmi hzrds then so is. We lso know tht in eh se the prtiulr or will e ree o untion hzrds on A è B. Further the trigger signl ordering requirement is glol imposition on C, nd the hngein is used y the prtiulr or orresponding to eh se. Thereore, one n pply the rguments ove t ny level in C. We will inlly reh the primry inputs whih re dynmi hzrd-ree y deinition. Thereore, is dynmi hzrd-ree. The proo or the se when mkes! trnsition ollows similrly. As we hve shown lredy tht BDD implementtion is ree o stti logi hzrds nd is ree o untion hzrds y the prolem deinition, then C derivedusing theoveproedureisully hzrd-ree or ll hzrds under the speiied input trnsitions. Theorem 3 (Complete hzrd-reedom) C is ree o stti nd dynmi hzrds, oth untion nd logil, or ll speiied input trnsitions. Proo: Funtion hzrd-reedom is immedite rom the prolem deinition; stti logi hzrd-reedom is gurnteed y Theorem ; nd dynmi logi hzrd-reedom is gurnteed y Theorem 2. Corollry 2 (Hzrd-reedom under single-input hnges) A BDD-sed iruit C under ny ordering is ree o hzrds under ll single-input hnges. Proo: Funtion hzrd-reedom is immedite rom the prolem deinition; stti logi hzrd-reedom is gurnteed y Theorem ; nd dynmi logi hzrd-reedom under singleinput hnges is gurnteed y Theorem 2 sine no ordering onstrints n exist or single-input hnges. Corollry 3 (Hzrd-reedom under multiple-input dynmi trnsitions) A Ciruit C derived rom BDD G is hzrd-ree to ll multiple-input dynmi trnsitions A è B s long s either 8X 2 èa; Bë, èxè is onstnt or 8X 2 ëa; Bè, èxè is onstnt. Proo: Rell tht èa; Bë orresponds to ëa; Bë, A nd ëa; Bè orresponds to ëa; Bë, B. For oth ses, i.e., 8X 2 èa; Bë èxè is onstnt or 8X 2 ëa; Bè èxè is onstnt, or eh trigger stte we hve only two possiilities: () ll the exited signls in the trigger stte re trigger signls or (2) the single exited signl in trigger stte is trigger signl. Hene, in either se, there re no ordering onstrints on G imposed y Condition o the TSO requirement. In se (), the trigger stte must e A. Hene, there is no quiesent signl. In se (2), there is only single trigger signl nd ll other signls re quiesent. Hene, in either se, there re no ordering onstrints on G imposed y Condition 2 o the TSO requirement. Thereore, dynmi logi hzrd-reedom is gurnteed y Theorem 2. Note tht this orollry shows tht there will no ordering onstrints generted on urst-mode trnsitions. C. Finding Vrile Order We now give systemti proedure or inding vrile ordering, i one exists, tht stisies the TSO-requirement:. Let, = èv;eè e direted grph where the eh vertex v 2 V represents unique vrile, nd eh edge x è y 2 E mens tht signl x must pper eore the signl y in the vrile order (i.e., indexèxè é indexèyè). I there is pth x è, p y in,, then it lso mens x must pper eore y in the vrile order. 2. Initilize, with V s the set o vriles nd E = ;.

8 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST For eh dynmiinputtrnsition A è B, dd the ollowing onstrints to stisy ondition o the TSO-requirement (. Deinition ): () For eh trigger stte X 2 ëa; Bë (. Deinition ), determine the set o trigger signls S T nd the set o non-trigger signls S NT. () For eh x 2 S T nd y 2 S NT, dd the direted edge x è y to E. 4. Chek i the grph, is still yli. I yes, proeed; otherwise, ort euse no solution exists. 5. For eh dynmiinputtrnsition A è B, dd the ollowing onstrints to stisy ondition 2 o the TSO-requirement: () For eh trigger stte X 2 ëa; Bë, determine the set o trigger signls S T nd the set o quiesent signls S Q in tht stte. () For eh y 2 S Q, hek i there lredy exists pth p x i è, y rom y to some x i 2 S T in, nd i there lredy exists pth y è, p x j rom some x j 2 S T to y in,. i. I no suh pth exists, then either or ll x k 2 S T,ddthe direted edges x k è y; 8y to E, oror ll x k 2 S T,ddthe direted edges y è x k ; 8y to E. p ii. I there re only pths x i è, y rom some y to some x i 2 S T in,, thenor ll x k 2 S T, dd the direted edges x k è y; 8y to E. p iii. I there re only pths y è, x j rom some x j 2 S T to some y in,, thenor ll x k 2 S T, dd the direted edges y è x k ; 8y to E. iv. Otherwise, ktrk to the most reently mde deision t step (i) nd hnge the set o direted edges dded to E. I ktrking is not possile, then ort euse no solution exists. 6. Find BDD vrile ordering, suh tht 8x è y 2 E : indexèxè é indexèyè. I there hoies selet one ritrrily. 7. Construt the BDD with the hosen vrile ordering. Derive multiplexor network C. Theorem 4 (Strit vrile ordering) A strit vrile ordering n e derived i nd only i n yli grph n e derived. Proo: Neessity: I, ontins yle etween x nd y, it mens we require oth indexèxè é indexèyè nd indexèyè é indexèxè. This is not possile with strit BDD vrile ordering. Suiieny: I, does not ontin yle etween x nd y, it mens either we hve only x è, p y, whih n e stisied y indexèxè é indexèyè, or we hve only y è, p x, whih n e stisied y indexèyè é indexèxè. In essene, the resulting direted yli grph (DAG), represents prtil order. Any strit BDD vrile ordering tht stisies this prtil order n e used. One n e hosen to minimize the resulting BDD size. When n yli grph nnot e ound, then it mens no strit BDD vrile ordering exists. In this se, we n mke use o ree BDD s. This disussion will e deerred to Setion V-E. We now illustrte the ides with n exmple. D. An Exmple To illustrte the ides, we hve n exmple rom Nowik [2] tht ws used to illustrte his two-level minimizer. The Krnugh mp o the exmple is shown in Figure 6. For this exmple, this is set o our speiied input trnsitions T = t ;t 2 ;t 3 ;t 4 g. These trnsitions re: t æ æ è - stti input hnges trnsition +;d,g t 2 æ è - stti input hnges trnsition d+g t 3 æ æ è - dynmi input hnges trnsition,;d+g t 4 æææ è - dynmi input hnges trnsition +;,;d,g d t3 t4 Fig. 6. Another dynmi hzrd exmple. The input trnsitions re indited in Figure 6. The strting point o eh trnsition is desried y dot, nd its trnsition ue is desried y dotted irle. From Theorem, the BDD implementtion is ree o stti hzrds, so trnsitions t nd t 2 will not use prolem. For dynmi trnsitions t 3 nd t 4, we need to nlyze the vrile ordering requirements to gurntee tht the BDD implementtion is dynmi hzrd-ree or these two speiied trnsitions. Indeed, the vrile ordering ééédwill ensure the stistion o the TSO-requirements or dynmi trnsitions t 3 nd t 4. Thereore, the resulting BDD implementtion is lso ree o dynmi hzrds. The BDD is shown in Figure 7. d d Fig. 7. Dynmi hzrd ree BDD implementtion with ordering ééé d. It hs een shown tht it is not lwys possile to produe hzrd-ree two-level SOP over. For exmple, i we dd the t t5 t2

9 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST ollowing speiied trnsition to the ove exmple (shown in Figure 6), then it n e shown tht no hzrd-ree two-level SOP over exists. The reson why no SOP solution exists is the ollowing: in order to eliminte stti logi hzrds or the stti trnsition t 5 : æ è, the SOP solution must ontin t lest one ue, lled required-ue, tht ontins the trnsition ue,. However, this required-ue onlits with requirements or eliminting dynmi logi hzrds or the dynmi trnsitions t 4 :æææ è. Speiilly, the trnsition ue t5 =, intersets the trnsition ue o t4 = ë; ë,ut it does not ontin the strt stte, whih is dynmi hzrd violtion. See [], [4], [22] or more detils. t 5 æ è - stti input hnges trnsition +g However, with the BDD pproh, the ove BDD implementtion is lso ree o hzrds or this trnsition (sine it is stti trnsition), s well s the other speiied trnsitions. E. Synthesis rom Free BDD s Although in the exmple shown in Setion V-D we n ind vrile ordering tht stisied ll ordering requirements, it is not lwys possile to ind suh strit vrile ordering in the generl se. It is possile to hve yli ordering onstrints tht nnot e stisied using strit vrile ordering. For exmple, it ould e tht in one speiied dynmi input trnsition, x is required to pper eore y; ut in nother speiied dynmi input trnsition, y is required to pper eore x. In this se, we hve yli onstrint. Cyli onstrints n requently e resolved y using ree BDD s where dierent vrile orderings my e used long dierent pths. (Note tht ree BDD still hs the onstrint o vrile ppering t most one long ny pth.) Rell tht eh pth in redued BDD orresponds to ue in disjoint over. In this sense, pth overs seto sttes ontined in the ue. Intuitively, we n derive lol ordering requirements or eh speiied dynmi input trnsition A è B seprtely.thenwederivereebddwherethe ordering onstrints re respeted or eh dynmi input trnsition A è B. The ugmented proedure is s ollows.. For eh speiied dynmi trnsition T i 2 G, otin, Ti èv;eè s desried erlier. 2. Attempt to onstrut glol ordering tht stisies, Ti èv;eè or ll T i 2 G. I this is possile go to Step 7. I this is not possile, identiy onlit tuples x; y; T j ;T k g, where or trnsition T j x ppers eore y, nd or trnsition T k y ppers eore x. (Note tht there my e multiple onlits or the sme pir o vriles x nd y resulting in multiple onlit tuples.) 3. In the trnsition ue ëa i ;B i ëor eh T i ind the set o vriles S i tht re onstnt t or. Cll this ssignment o vlues to S i the ue i. 4. Choose onlit tuple. Given onlit tuple tht reltes T j to T k, hek i j ë k = ç. I so, we ind vrile z in the j nd k ues tht hs dierent vlues nd urther does not pper s y in ny edge x è, p y in, Ti èv;eè. I we nnot ind suh vrile, we nnot resolve the onlit using ree BDD s with the given set o, Ti èv;eè s nd we exit the proedure. 5. We hoose z =, nd group the speiied trnsitions or whih z = in set G. G will ontin T j. Similrly, we group the speiied trnsitions or whih z =in set G. G will ontin T k.izhnges in T i then the T i n e grouped in either set. 6. Go to Step, reurring with G = G z= nd G = G z=. 7. Generte the ordering or G, ororg z= nd G z=. Add z to the top o oth these orderings with the pproprite vlue. Exit the proedure. I the proedure ompletes suessully, we will otin set o orderings o the input vriles eh tgged with n input omintion. For exmple, we my otin or the untion è; ; ; d; eè, the orderings: =;;;d;e =; =;d;;e =; =;e;;d This implies tht in the ree BDD, is the vrile losest to the output. The = input o the root multiplexor is onneted to n ordered BDD with ordering ; ; d; e. The =input is onneted to multiplexor with s its ontrol vrile. The = input is onneted to n ordered BDD with ordering d; ; e nd the =input is onneted to n ordered BDD with ordering e; ; d. To otin iruit C orresponding to the ove ordering, otor the given untion with respet to =nd =. Crete n ordered BDD under the speiied ordering o ; ; d; e or. Cotor with respet to =nd =to otin æ nd æ. Crete ordered BDD s under the speiied ordering or the otors. Theorem 5 (Dynmi logi hzrd-reedom in ree BDD) C is ree o dynmi hzrds or ll speiied dynmi trnsitions. Proo: For ny given input trnsition T i, C does not violte the ordering requirement. Thereore, y Theorem 2 C is dynmi hzrd-ree or T i. VI. REPLACEMENT STRATEGIES AND RESYNTHESIS A. Replement Ciruits It is worthwhile to reple the multiplexors with primitive gtes so non-hzrd-inresing logi trnsormtions (e.g., [3]) n e pplied on the network to urther redue the re or improve the perormne. Eh MUX-ELEMENT = æ + æ in the synthesized iruit C will hve the ollowing onditions t its inputs y Theorem 2.. I the ontrol input is onstnt t, nd n oth hnge! or!. 2. I the ontrol input is onstnt t, nd n oth hnge! or!. 3. I mkes trnsition, we hve t most one o or mking trnsition.

10 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST 995 We onsider the hrteristis o three primitive gte replement iruits or the MUX-ELEMENT. A: = æ + æ This iruit hs stti logi hzrd on the! trnsition on with nd onstnt t. It is ree o ll dynmi hzrds. B: =è+ èæ +æ This is ree o ll stti hzrds ut hs dynmi hzrds or the se where =, nd nd mke opposite polrity trnsitions. C: = æ +è+ èæ This is ree o ll stti hzrds ut hs dynmi hzrds or the se where =, nd nd mke opposite polrity trnsitions. Our replement strtegy is s ollows: æ I the MUX-ELEMENT hs the onditions ) nd/or 2) t its inputs, ut not 3), we use replement iruit A. æ I the MUX-ELEMENT hs the onditions ) nd/or 3) t its inputs, ut not 2), we use replement iruit B. æ I the MUX-ELEMENT hs the onditions 2) nd/or 3) t its inputs, ut not ), we use replement iruit C. æ I the MUX-ELEMENT hs the onditions ), 2) nd 3) t its inputs, we do not reple it. In the mjority o the ses, the multiplexor iruit n e trnsormed into one onsisting entirely o primitive gtes. The trnsormtion depends on the input onditions t eh multiplexor in the network. Note tht i we re suessul in repling ll multiplexors with the primitive gte implementtion A, then we n onvert the network into disjoint two-level over tht lso stisies the hzrd reedom requirements. However, the two-level network my e onsiderly lrger thn the multiplexor-sed network. B. Constnt Propgtion Sine some o the MUX-ELEMENTs re onneted to onstnt nd vlues, they n e simpliied. This simpliition does not hnge the hzrd hrteristis o the iruit. Ater replement, the primitive gte iruits n e simpliied i they hve onstnt inputs. For exmple the primitive gte iruit simpliies to i is onneted to logil. =è+ èæ +æ = æ C. Hndling Cyli Constrints Using Replement In some ses, when yli ordering onstrints exist tht nnot e stisied even using ree BDD implementtion it my e possile to simpliy ertin multiplexors in the iruit to produe hzrd-ree reliztion. Assume tht the TSO ordering requirement produes yli ordering grph. We disrd miniml numer o onstrints so s to produe n yli ordering grph. In prtiulr, we disrd onstrints generted y Condition 2 o the TSO-requirement. Then, we generte BDD nd multiplexor-sed network using n ordering tht stisies the yli set o onstrints. O A disjoint over is one in whih eh ue in the over does not interset ny other ue. ourse, given tht we hve violted the TSO ordering requirement, the resulting network is not neessrily hzrd-ree. (It is possile tht the resulting network otined under the smller set o onstrints is hzrd-ree euse the TSO-requirement is suiient, nd not neessry, ondition or hzrd reedom.) In some ses, it is possile to simpliy multiplexors to mke the network hzrd-ree. In prtiulr, we hek or the ollowing ses:. A dynmi hzrd is used t multiplexor euse its ontrol input, nd dt inputs nd ll mke! trnsitions. We hek i the logil untions nd re suh tht = è =. I so, we reple the multiplexor = æ + æ with = æ +. This elimintes the dynmi hzrd, sine when goes! the output goes!, nd oth nd hve to go! or the output to go!. 2. A dynmi hzrd is used t multiplexor euse its ontrol input mkes! trnsition, nd dt inputs nd mke! trnsitions. We hek i =è =.Iso, we reple the multiplexor with = + æ. Agin, this elimintes the dynmi hzrd. 3. Sme s Cse exept tht, nd mke! trnsitions. 4. Sme s Cse 2 exept tht mkes! trnsition, nd nd mke! trnsitions. VII. EXPERIMENTAL RESULTS We hve implemented the tehniques desried in this pper nd hve tested them on numer o exmples. The sotwre hs een implemented using the BDD pkge in SIS [23]. We present set o results using enhmrks rom the synhronous design enhmrk set. The results in Tle I orrespond to diret omprison with the two-level hzrd-ree synthesis proedure o [22]. Hzrd-ree two-level nd BDD-sed iruits were synthesized using the speiied set o stti nd dynmi trnsitions or the enhmrk exmples given in [22]. For the BDD-sed iruits, hzrd-ree MUX-ELEMENT requiring our literls ws ssumed. The two-level iruits ontin some very lrge nin gtes, however, we hve reported the literl ounts prior to deomposition (whih would inrese literl ount). Note tht hzrd noninresing trnsormtions n e pplied to oth the BDD-sed nd the two-level iruits improving their re hrteristis. The literl ounts or the BDD-sed reliztions ompre vorly to the two-level reliztions in most exmples. More sustntil improvements over two-level solutions n e otined using the BDD-sed method in sequentil synthesis trjetory suh s tht desried in [29]. The BDD solution hs less restritions on stte ssignment nd stte minimiztion, so etter results n e otined. For instne, ewer stte vriles re required in mny ses, resulting in ewer inputs nd outputs in the hzrd-ree omintionl logi. The interested reder is reerred to [29] or more omprehensive set o results. Our BDD-sed reliztions under ny ordering re gurnteed to e hzrd-ree or ll stti trnsitions y Theorem. However, this is not trueo the two-levelreliztionso Tle I. In order to mke two-level iruit hzrd-ree or stti trn-

11 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 8, AUGUST 995 TABLE I COMPARISON BETWEEN TWO-LEVEL AND MULTILEVEL REALIZATIONS WHEN HAZARD-FREEDOM IS REQUIRED UNDER A SPECIFIED SET OF MULTIPLE-INPUT STATIC AND DYNAMIC TRANSITIONS. Speiition Totl Sttes / Primry literls Trnsitions In Out 2-level BDD q ring-ounter inry-ounter inry-ounter-o pe-send-i he-trl tsend tsend-m isend-m s stetson-p stetson-p iu-io2dm ioelltrl ssi-trg-send ssi-init-send ssi-init-rv-syn sitions, ll the prime implints o the logi untion hve to e inluded in the reliztion. This n result in sustntilly greter numer o literls. By Corollry 2, BDD-sed reliztions (under ny ordering) re hzrd-ree under ll single-input dynmi trnsitions. In order to ensure hzrd-reedom under ll single-input dynmi trnsitions signiint numer o dditionl prime implints hve to e dded to the two-level iruits o Tle I. VIII. CONCLUSIONS In this pper, we hve desried new synthesis method sed on ordered nd ree Binry Deision Digrms or synthesizing hzrd-ree multilevel logi implementtions. Methods or produing hzrd-ree logi implementions hve importnt pplitions in the ield o synhronous design. We hve given utomted synthesis proedures tht n produe iruits tht re ree o oth stti nd dynmi hzrds or given set o multiple-input hnges. The iruits produed using our method remin hzrd-ree under ny ritrry gte or wire delys. Our method is sed on pure dely model ssumption, whih mens we do not need to rely on potentilly slow inertil delys to ilter out unexpeted spurious trnsitions. The method hs een implemented nd its eetiveness hs een shown on numer o exmples. We elieve our rmework is quite generl nd powerul. As indited in Setion VII, it hs een used to hndle the synthesis prolems rising in extended urst-mode synhronous iruits [29]. ACKNOWLEDGEMENTS The uthors would like to thnk Steve Nowik o Columi University nd Peter Vnekergen o Synopsys or numer o very helpul disussions onerning the hzrd-ree synthesis prolem nd or the enhmrk exmples. Thnks to Kenneth Yun nd Alex Kondrtyev or providing detiled nd onstrutive omments, nd helping with the proo o Theorem 5.. Thnks to Ken Yun nd Dve Dill or pointing out the ppliility o BDD-sed networks to extended urst-mode FSMs. REFERENCES [] V. Akell nd G. Goplkrishnn. Shilp: high-level synthesis system or sel-timed iruits. In ICCAD-992. [2] P.A. Beerel nd T. Meng. Automti gte-level synthesis o speedindependent iruits. In ICCAD-992. [3] J. Beister. A uniied pproh to omintionl hzrds. IEEE Trnstions on Computers, C-23(6), 974. [4] J.G. Bredeson. Synthesis o multiple input-hnge hzrd-ree omintionl swithing iruits without eedk. Int. J. Eletronis, 39(6):65 624, 975. [5] J.G. Bredeson nd P.T. Hulin. Elimintion o stti nd dynmi hzrds or multiple input hnges in omintionl swithing iruits. Inormtion nd Control, 2:4 224, 972. [6] E. Brunvnd nd R. F. Sproull. Trnslting onurrent progrms into dely-insensitive iruits. In ICCAD-989. [7] R. E. Brynt. Grph-sed lgorithms or oolen untion mnipultion. IEEE Trnstions on Computers, C-35(8):677 69, August 986. [8] T.-A. Chu. Synthesis o sel-timed VLSI iruits rom grph-theoreti speiitions. Tehnil Report MIT-LCS-TR-393, Msshusetts Institute o Tehnology, 987. [9] O. Coudert nd J.C. Mdre. A uniied rmework or the orml veriition o sequentil iruits. In ICCAD-9, pges 26 29, Novemer 99. [] E.B. Eihelerger. Hzrd detetion in omintionl nd sequentil swithing iruits. IBM J. Res. Develop., 9(2):9 99, 965. [] J. Frkowik. Methoden der nlyse und synthese von hsrdrmen shltnetzen mit minimlen kosten I. Elektronishe Inormtionsverreitung und Kyernetik, (2/3):49 87, 974. [2] A. Kondrtyev, M. Kishinevsky, B. Lin, P. Vnekergen, nd A. Ykovlev. On the onditions or gte-level speed-independene o synhronous iruits. In TAU-993. [3] D.S. Kung. Hzrd-non-inresing gte-level optimiztion lgorithms. In ICCAD-992. [4] L. Lvgno, K. Keutzer, nd A. Sngiovnni-Vinentelli. Algorithms or synthesis o hzrd-ree synhronous iruits. In DAC-9. [5] Alin J. Mrtin. Compiling ommuniting proesses into delyinsensitive VLSI iruits. Distriuted Computing, : , 986. [6] E.J. MCluskey. Introdution to the Theory o Swithing Ciruits. MGrw-Hill, 965. [7] Teres H.-Y. Meng, Roert W. Brodersen, nd Dvid G. Messershmitt. Automti synthesis o synhronous iruits rom high-level speiitions. IEEE Trnstions on CAD, 8():85 25, Novemer 989. [8] C.W. Moon, P.R. Stephn, nd R.K. Bryton. Synthesis o hzrd-ree synhronous iruits rom grphil speiitions. In ICCAD-99. [9] C. Myers nd T. Meng. Synthesis o timed synhronous iruits. In ICCD-992. [2] S. Nowik, 993. Privte ommunition. [2] S.M. Nowik nd D.L. Dill. Automti synthesis o lolly-loked synhronous stte mhines. In ICCAD-99. [22] S.M. Nowik nd D.L. Dill. Ext two-level minimiztion o hzrd-ree logi with multiple-input hnges. In ICCAD-992. [23] E. M. Sentovih, K. J. Singh, C. Moon, H. Svoj, R. K. Bryton, nd A. Sngiovnni-Vinentelli. Sequentil Ciruit Design Using Synthesis nd Optimiztion. In Proeedings o the Int l Conerene on Computer Design: VLSI in Computers nd Proessors, pges , Otoer 992. [24] H. J. Touti, H. Svoj, B. Lin, R. K. Bryton, nd A. Sngiovnni- Vinentelli. Impliit stte enumertion o inite stte mhines using BDD s. In ICCAD-9, pges 3 33, Novemer 99. [25] S.H. Unger. Asynhronous Sequentil Swithing Ciruits. New York: Wiley-Intersiene, 969. [26] P. Vnekergen, B. Lin, G. Goossens, nd H. De Mn. A generlized stte ssignment theory or trnsormtions on signl trnsition grphs. In ICCAD-992. [27] M.L. Yu nd P.A. Surhmnym. A pth-oriented pproh or reduing hzrds in synhronous designs. In DAC-992. [28] K. Y. Yun nd D. L. Dill. Uniying Asynhronous/Synhronous Stte Mhine Synthesis. In ICCAD-93, pges , Novemer 993. [29] K. Y. Yun, B. Lin, D. L. Dill, nd S. Devds. Perormne-Driven Synthesis o Asynhronous Controllers. In ICCAD-94, Novemer 994.

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

More information

Unit 4. Combinational Circuits

Unit 4. Combinational Circuits Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

MAT 403 NOTES 4. f + f =

MAT 403 NOTES 4. f + f = MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

Lecture 6. CMOS Static & Dynamic Logic Gates. Static CMOS Circuit. PMOS Transistors in Series/Parallel Connection

Lecture 6. CMOS Static & Dynamic Logic Gates. Static CMOS Circuit. PMOS Transistors in Series/Parallel Connection NMOS Trnsistors in Series/Prllel onnetion Leture 6 MOS Stti & ynmi Logi Gtes Trnsistors n e thought s swith ontrolled y its gte signl NMOS swith loses when swith ontrol input is high Peter heung eprtment

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 22 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09 Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

Generalization of 2-Corner Frequency Source Models Used in SMSIM

Generalization of 2-Corner Frequency Source Models Used in SMSIM Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-2700: Digital Logic Design Fall Notes - Unit 1

ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-2700: Digital Logic Design Fall Notes - Unit 1 INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl systems. It dels with the cse where vriles ssume only one o two vlues: TRUE (usully represented

More information

y1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2

y1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2 BOOLEAN METHODS Giovnni De Miheli Stnford University Boolen methods Exploit Boolen properties. { Don't re onditions. Minimiztion of the lol funtions. Slower lgorithms, etter qulity results. Externl don't

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-378: Computer Hardware Design Winter Notes - Unit 1

ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-378: Computer Hardware Design Winter Notes - Unit 1 ELETRIL ND OMPUTER ENGINEERING DEPRTMENT, OKLND UNIVERSIT EE-78: omputer Hrdwre Design Winter 016 INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

A Differential Approach to Inference in Bayesian Networks

A Differential Approach to Inference in Bayesian Networks Dierentil pproh to Inerene in Byesin Networks esented y Ynn Shen shenyn@mi.pitt.edu Outline Introdution Oeriew o lgorithms or inerene in Byesin networks (BN) oposed new pproh How to represent BN s multi-rite

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES CHARLIE COLLIER UNIVERSITY OF BATH These notes hve been typeset by Chrlie Collier nd re bsed on the leture notes by Adrin Hill nd Thoms Cottrell. These

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

TIME AND STATE IN DISTRIBUTED SYSTEMS

TIME AND STATE IN DISTRIBUTED SYSTEMS Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

Chapter Gauss Quadrature Rule of Integration

Chapter Gauss Quadrature Rule of Integration Chpter 7. Guss Qudrture Rule o Integrtion Ater reding this hpter, you should e le to:. derive the Guss qudrture method or integrtion nd e le to use it to solve prolems, nd. use Guss qudrture method to

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Test Generation from Timed Input Output Automata

Test Generation from Timed Input Output Automata Chpter 8 Test Genertion from Timed Input Output Automt The purpose of this hpter is to introdue tehniques for the genertion of test dt from models of softwre sed on vrints of timed utomt. The tests generted

More information

Behavior Composition in the Presence of Failure

Behavior Composition in the Presence of Failure Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000 orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of

More information

= state, a = reading and q j

= state, a = reading and q j 4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Boolean Algebra cont. The digital abstraction

Boolean Algebra cont. The digital abstraction Boolen Alger ont The igitl strtion Theorem: Asorption Lw For every pir o elements B. + =. ( + ) = Proo: () Ientity Distriutivity Commuttivity Theorem: For ny B + = Ientity () ulity. Theorem: Assoitive

More information

Decentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management

Decentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL. XX, NO. X, XXX 2009 1 Deentrlized Dignosis or Nonilures o Disrete Event Systems Using Inerene-Bsed Amiguity Mngement

More information

Hardware Verification 2IMF20

Hardware Verification 2IMF20 Hrdwre Verifition 2IMF20 Julien Shmltz Leture 02: Boolen Funtions, ST, CEC Course ontent - Forml tools Temporl Logis (LTL, CTL) Domin Properties System Verilog ssertions demi & Industrils Proessors Networks

More information

expression simply by forming an OR of the ANDs of all input variables for which the output is

expression simply by forming an OR of the ANDs of all input variables for which the output is 2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

Exercise 3 Logic Control

Exercise 3 Logic Control Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities Appendi Prtil dishrges. Reltionship Between Mesured nd Atul Dishrge Quntities A dishrging smple my e simply represented y the euilent iruit in Figure. The pplied lternting oltge V is inresed until the

More information

m2 m3 m1 (a) (b) (c) n2 n3

m2 m3 m1 (a) (b) (c) n2 n3 Outline LOGIC SYNTHESIS AND TWO-LEVEL LOGIC OPTIMIZATION Giovnni De Miheli Stnford University Overview of logi synthesis. Comintionl-logi design: { Bkground. { Two-level forms. Ext minimiztion. Covering

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

6.1 Definition of the Riemann Integral

6.1 Definition of the Riemann Integral 6 The Riemnn Integrl 6. Deinition o the Riemnn Integrl Deinition 6.. Given n intervl [, b] with < b, prtition P o [, b] is inite set o points {x, x,..., x n } [, b], lled grid points, suh tht x =, x n

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities Int. J. Contemp. Mth. Sienes, Vol. 3, 008, no. 3, 557-567 Co-ordinted s-convex Funtion in the First Sense with Some Hdmrd-Type Inequlities Mohmmd Alomri nd Mslin Drus Shool o Mthemtil Sienes Fulty o Siene

More information

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner

More information

ANALYSIS AND MODELLING OF RAINFALL EVENTS

ANALYSIS AND MODELLING OF RAINFALL EVENTS Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Solutions - Homework 1 (Due date: September 9:30 am) Presentation and clarity are very important!

Solutions - Homework 1 (Due date: September 9:30 am) Presentation and clarity are very important! ECE-238L: Computer Logi Design Fll 23 Solutions - Homework (Due dte: Septemer 2th @ 9:3 m) Presenttion nd lrity re very importnt! PROBLEM (5 PTS) ) Simpliy the ollowing untions using ONLY Boolen Alger

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

University of Sioux Falls. MAT204/205 Calculus I/II

University of Sioux Falls. MAT204/205 Calculus I/II University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

More information

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting. ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

Foundations of Computer Science Comp109

Foundations of Computer Science Comp109 Reding Foundtions o Computer Siene Comp09 University o Liverpool Boris Konev konev@liverpool..uk http://www.s.liv..uk/~konev/comp09 Prt. Funtion Comp09 Foundtions o Computer Siene Disrete Mthemtis nd Its

More information

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh Computtionl Biology Leture 8: Genome rerrngements, finding miml mthes Sd Mneimneh We hve seen how to rerrnge genome to otin nother one sed on reversls nd the knowledge of the preserved loks or genes. Now

More information

s the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p

s the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p Skeptil Rtionl Extensions Artur Mikitiuk nd Miros lw Truszzynski University of Kentuky, Deprtment of Computer Siene, Lexington, KY 40506{0046, frtur mirekg@s.engr.uky.edu Astrt. In this pper we propose

More information

2.4 Theoretical Foundations

2.4 Theoretical Foundations 2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2 EE08A Leture 2: Comintionl Logi Design EE 08A Leture 2 () 2005-2008 W. J. Dlly n P. Levis Announements Prof. Levis will hve no offie hours on Friy, Jn 8. Ls n setions hve een ssigne - see the we pge Register

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Automatic Synthesis of New Behaviors from a Library of Available Behaviors

Automatic Synthesis of New Behaviors from a Library of Available Behaviors Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u

More information

The Riemann and the Generalised Riemann Integral

The Riemann and the Generalised Riemann Integral The Riemnn nd the Generlised Riemnn Integrl Clvin 17 July 14 Contents 1 The Riemnn Integrl 1.1 Riemnn Integrl............................................ 1. Properties o Riemnn Integrble Funtions.............................

More information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

TOPIC: LINEAR ALGEBRA MATRICES

TOPIC: LINEAR ALGEBRA MATRICES Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

The Word Problem in Quandles

The Word Problem in Quandles The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given

More information

Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.

Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches. Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,

More information

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

Exercise sheet 6: Solutions

Exercise sheet 6: Solutions Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd

More information

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

Implication Graphs and Logic Testing

Implication Graphs and Logic Testing Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,

More information

Algebra in a Category

Algebra in a Category Algebr in Ctegory Dniel Muret Otober 5, 2006 In the topos Sets we build lgebri strutures out o sets nd opertions (morphisms between sets) where the opertions re required to stisy vrious xioms. One we hve

More information

Fault Modeling. EE5375 ADD II Prof. MacDonald

Fault Modeling. EE5375 ADD II Prof. MacDonald Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology

More information

Behavior Composition in the Presence of Failure

Behavior Composition in the Presence of Failure Behior Composition in the Presene of Filure Sestin Srdin RMIT Uniersity, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Uni. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re t

More information

Hyers-Ulam stability of Pielou logistic difference equation

Hyers-Ulam stability of Pielou logistic difference equation vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo

More information