Digital Design IE1204/5
|
|
- Audra Hubbard
- 5 years ago
- Views:
Transcription
1 Digitl Design IE4/5 Eerises Compiled y Willim Sndqvist willim@kth.se ICT/ES Eletroni Systems
2
3 Numer systems nd odes. Enter the orresponding inry numers for the following deiml numers se. 9 7 d 53. Convert the following inry numer to deiml...3 Convert the following inry numers se to the orresponding otl numers se8 nd hedeiml numers se6. d e..4 Convert the following hedeiml numers se6 to the orresponding otl numers se8. 94D 6 9E.7A 6.5 Convert the otl se8 numer to the orresponding hedeiml numer se6..6 Write the hedeiml se6 numer BAC 6 in deiml form se..7 Wht hrterizes Gry odes, nd how n they e onstruted?.8 Write the following signed numers with two's omplement nottion, 6, 5, 4, 3,,, d Write the following signed numers with one's omplement nottion, 6, 5, 4, 3,,, d - Digitl rithmeti. Add y hnd the following pir of inry numers... d... Add or sutrt ddition with the orresponding negtive numers the following pir of numers. The numers shll e represented s inry 4-it numers Nile in two's omplement form d Multiply y hnd following pirs of unsigned inry numers... d...4 Divide y hnd following pirs of unsigned inry numers.. / / 3
4 .5 IEEE-754 stndrd for storge of 3-it flot. Assume tht 3-it flot is stored in register: 4C8 6 Wht rel deiml numer is this?.6 Floting point formt's priniples eomes more trnsprent if one of pedgogil resons "sles down" to 4- it register size Nile. However, 4-it formt would e prtilly unusle. 3 Assume the following four it floting point formt: [ 3 ]. The sign is epressed with the it 3, the mntiss is represented y one it, nd the eponent hs two its epressed s eess -. Count up the numer tht n e represented with full preision. Mrk them on the numer line. How ig is the lrgest quntiztion error? Cn the numer e represented? If not, suggest hnge in the formt so tht n e represented..7 To emine the ddition nd multiplition of floting point, we ssume now for pedgogil resons 6 it formt. This is still to few its to e prtilly usle. [ ] Whih of the following numers n e represented in this formt?,5,85 -,375 4,5 7.5 Add the numers nd. Wht is needed to void loss of preision? Multiply the previous numers with eh other. 4
5 Sets nd Cues Venn-digrm representtion Constnt Constnt Vrile Vrile 3. y y y Prove the distriutive lw with the help of Venn digrm. y z y z 3. Prove De Morgn's lw using the Venn digrm. y y 3.3 Drw Venn digrm for three vriles nd mrk where the truth tle ll mintermer re pled. Minimize the funtion using the Venn digrm. f Cue representtion 3.4 Represent the following funtion of three vriles s 3-dimensionl ue with Gry-oded orners. f,, m,,3, 4,6 Use the ue to simplify the funtion. 5
6 Boolen lger nd gtes Boolen lger 4. Use the lws of Boolen lger to simplify the following logi epressions: d f d f f d f e f f f f d g d h f f i 4. Prove lgerilly tht the following reltions re vlid d Simplify the following three epressions s muh s possile. y z y y y y y 4.4 Simplify the following epression s fr s possile. 6
7 Gtes 4.5 Speify the output / for the following si types of gtes when the inputs re s given in the figure. Speify the input / for the following si types of gtes when the output signls re s given in the figure. & & 4.6 Simpify f, whih re relized y the gte iruit, s muh s possile, nd speify the funtion nme. 4.7 Drw timing digrm of signls A, B, C, D, f. The inputs,, nd hs the frequeny rtio 4: : to "sweep" through the truth tle omintions in the "right" order. Write the truth tle for the funtion f. 7
8 4.8 Speify the logil epressions for A, B, C nd D. 4.9 Simplify the omple epressions elow s muh s possile. 4. Show tht 4. The figure shows the interntionl stndrd gte symols. Ameri's dominne in the semiondutor re implies tht one must lso e fmilir with the Amerinn symols. Nme the gtes nd drw the orresponding Amerin gte symols. 4. A omintoril network with si inputs 5, 4, 3,,, nd three outputs u, u, u, is desried with tet s follows: u if nd only if either oth nd is or 4 nd 5 re different u if nd only if nd re the sme nd 5 re the inverse of u if nd only if is nd some of... 5 is Desrie the network with Boolen lger nd opertions AND OR NOT XOR insted. 8
9 Truth tle, SoP nd PoS -form, Complete logi 5. The figure shows simple "ode lok" with hnge-over ontts. The lmp will light for ertin omintion of simultneously pressed ontts,. Whih omintion? Speify the logil funtion for light up the lmp. Vriles nmes stnds in the figure k. f 5. A logi funtion hs the following Stte Tle: f Speify the funtion of PoS-norml form produt of sums: f,, Speify the funtion of SoP-norml form sum of produts: f,, 5.3 A miniml funtion is speified on the SoP form sum of produts. Type the sme funtion s SoP norml form, nd s PoS norml form. f, y, z y yz z 5.4 A funtion is denoted s miture of produts nd sums. Type the sme funtion s SoP norml, nd s PoS norml. yz y z yz f, y, z y y 9
10 Equivlene AND-OR / NAND-NAND nd OR-AND / NOR-NOR 5.5 Drw this AND/OR network s NAND/NAND network. 5.6 Drw this OR /AND networks s NOR/NOR network. 5.7 Write the truth tle for iruit with four inputs tht define the even prity; ie iruit output is "" when n even numer of inputs re simultneously "". Implement this funtion with s few NOR gtes s possile.
11 The Krnugh mp 6. Mke the est possile groups in the Krnugh mp. Enter the minimized funtion t the SoP form. f d 6. Mke the est possile groups in the Krnugh mp. Enter the minimized funtion t the SoP form. f d 6.3 Ple this funtion in the Krnugh mp. f d Try to find etter groups. Enter the minimized funtion t the SoP form. f 6.4 The top of the figure to the right is NOR-NOR network. Anlyse this network nd insert the truth tle in the Krnugh mp. Mke groups in yhe Krnugh mp nd relize the funtion with NAND gtes t the ottom of the figure. Vriles nd re ville in oth norml nd inverted form.
12 PLD iruits often hve n XOR gte t the output so tht one is to e le to invert the funtion. One n then hoose to group together s or s fter wht is the most dvntgeous. 6.5 A funtion with four vriles re defined with minterms in the SoP form. Use Krnugh mp to minimize the funtion. Also minimize the funtion s inverse. f 3,,, m,, 4, 8,, f? f? 6.6 A funtion with four vriles re defined with minterms in the PoS form. Use Krnugh mp to minimize the funtion. Also minimize the funtion s inverse. f,,, M,, 4, 5,,, 4, 5 f? f 3? 6.7 A funtion with four vriles re defined with mintermer the SoP form. Use Krnugh mp to minimize the funtion. Also minimize the funtion inverse. f 3,,, m,, 3, 4, 6, 7, 8, 9,,, 3, 4 f? f? 6.8 Sometimes the prolem is suh tht ertin input omintions re "impossile" nd therefore n not our. Suh minterms or mterms re denotet with d "do not re" nd ould e used s ones or zeros depending on wht works est to get s ig s possile groups. f 3,,, m3, 5, 7, d6, 5 f? f? 6.9 f 3,,, m, 4, 5 d, 3, 6, 7,8,9,,3 f? f?
13 6. A funtion with five vriles is defined s f 4, 3,,, m9,,, 3, 4, 5, 6, 8, 4, 5, 6, 7 see the ompleted truth tle. Use Krnugh mp method for minimizing the funtion. Also minimize the funtion s inverse. f,,,, f? f 4 3? 4 3 f f
14 MOS-trnsistors nd digitl iruits 7. Identify trnsistors ehvior, nd write the truth tle for YA. Whih logi funtion is it? 7. Identify trnsistors ehvior, nd write the truth tle for YA,B. Whih logi funtion is it? 4
15 7.3 Identify trnsistors ehvior, nd write the truth tle for YA,B. Whih logi funtion is it? 7.4 Study the iruit nd desrie the funtion. Wht role does the signl EN hve? Wht reltionship holds etween Y nd A? YA. How mny "sttes" n the output hve? 7.5 The figure shows one hlf of CMOS iruit. Drw the other hlf, whih ontins the PMOS trnsistors. Enter the logil funtion YA,B,C. 5
16 Comintionl iruits 8.. Derive the Boolen epressions to minimized SoP form of omintoril network tht onverts three-it inry oded numer X,, to inry oded si it numer U u 5, u 4, u 3, u, u, u whih is equl to the squre of the input U X. Use Krnugh mps. 8. A monitoring system for wter tnk onsists of four level sensors 3,,,. The signls from these forms inry four-it numer X. A logi iruit Tnk Level Logi trnsodes X to three it numer U u, u, u whih presents the level s inry numer etween nd 4. Construt the logi network. Derive the Boolen epressions on minimized the SoP form. Tke dvntge tht mny of input signl omintions n never our! The input vriles re ville in oth inverted nd not inverted form from the level sensors. Use AND_OR to NAND_NAND equivlene to produe logi network using only NAND gtes. 8.3 A pier t n irport hs five onneting Gtes rmp. The Gtes re numered...5. At eh Gte there re sensor with the output signl r i if n irrft is onneted to the Gte, otherwise. A omintoril iruit, P, helps ir trffi ontroller to diret rriving irrft to ville Gtes. The iruit P hs input signls r, r, r 3, r 4, r 5 nd output signls y 4, y, y. The omintion of the oututs y 4, y, y should in inry give the numer of the Gte with the mimum sequene numer tht is vnt. If no Gte is free the numer y 4, y, y,, is used. Minimize eh output seprtely. 6
17 8.4 The deiml digits to 9 n e enoded in the so-lled 74 ode. It is lned inry position ode with weights 7, 4,, nd, where two omintions of weighted its n provide the sme vlue, the ode word with the minimum numer of ones is seleted. 74-ode hs the property tht it enodes the digits to 9 with miniml numer of ones, totl of 4 st. Design iruit tht trnsltes from the 74 Code to the more onventionl BCD ode ode 84. Use PLD iruit of the AND-OR type. Both the AND plne nd the OR plne n e progrmmed individully. Drw ross in the figure elow to show the progrmmed onnetions to e mde. The Gtes inputs re drwn in "simplified" wy. 8.5 A 7-segment enoder deodes inry 4-it numer to the orresponding segment imge for the numers... 9 or hedeiml... F. Set up the truth tle, nd enter minimized logil iruit for one of the segments for emple segment "G". 8.6 Show how 4- multipleer n e used s funtion genertor nd s suh generte the OR funtion. 7
18 8.7 A mjority gte dopt t output the sme vlue s the mjority of the inputs. The gte n for emple e used in fult-tolernt logi, or for imge proessing iruits. Derive the gte's truth tle nd minimize the funtion with Krnugh mps. Relize the funtion with AND-OR gtes. Relize the mjority gte with 8: MUX. Use Shnnon deomposition nd relize the mjority gte with : MUX nd gtes. d Relize the mjority gte with only : MUXes. 8.8 Derive the Full Adder truth tle. Show how full dder is implemented in n FPGA hip. Logi elements in FPGA is le to sde C OUT nd C IN etween stges. Show the ontents of the SRAM ells the LUT, Lookup Tle. 8
19 8.9 Show how one four-input XOR gte XOR re relized in FPGA iruit. Show the ontents of the SRAM ells the LUT, Lookup Tle. 9
20 8. The Boolen funtion Y of four vriles 3 is defined y it s truth tle. Use the Krnugh mp to onstrut miniml iruit for the funtion use s don t re. Choose ny gtes.. Relize the funtion Y with 4: multipleer nd ny gtes. Use nd s the multipleer selet 3 signls. Y Y A four it numer 3 is to e multiplied y the onstnt 6. The numer is fed into five it dder whih is onfigured for the opertion 6. Drw how the dder hs to e onfigured. Eept the four its in, onstnts with the vlues nd re lso ville. Whih is the gretest inry numer s s 6 s 5 s 4 s 3 s s s tht n pper on the output when the iruit is onfigured for this opertion? Answer with inry numer.
21 8. A four it unsigned integer 3 is onneted to n 4-it dder s in the figure. The result is 5-it numer y y 4 y 3 y y y. Drw the figure to the right how the sme results n e otined without using the dder. There re lso its with the vlues nd if needed.
22 Sequentil iruits, lthes nd loked flip-flops 9. Complete the timing digrm for the output signls Q nd Q. The distne etween the pulses is muh longer thn the gte dely. Wht is loking input signl for the NOR gtes 9. You proly know the lth to the right. The usul nmes re repled with d. Fill in the hrteristi tle. & & d d 9.3 Drw in the timing digrm the output Q, for the D-flip-flop. D CP D C Q Q D CP Q 9.4 Drw Q in this timing digrm. 9.5 JK flip-flop ws n older type of "universl flip-flop". Show how it n e used s T flip-flop nd D flip-flop.
23 Flip-Flop Timing Prmeters. The fip-flop is loded with dt t the positive edge of the lokpulse, ut dt must e stle t s efore the lok edge nd even the time t h fter. The dt n e found t output fter the time t pd. t pd n e different for respetive trnsitions. If these times re not respeted the flip-flop funtioning eomes unertin. 9.6 Wht is the mimum lok frequeny tht n e used to the iruit in the figure without risking mlfuntion? Suppose t s ns t h 5 ns t pd 3 ns 9.7 The figure shows three different stte mhines. Speify the stte mhine A, B or C tht n operte t the highest lok speed. Highlight the ritil pth the pth tht limits lok frequeny in this figure nd lulte the period time for the lok signl Clk 9.8 For the flip-flops: setup time t su 4 ns, dely time for the flip-flop outputs t pdq 3 ns. The XOR-gte hs dely time t pdxor 5 ns. How long does it needs to e etween the lok pulses T CP >?, for the ounter funtion to e sfe? Wht vlue must the hold time hve t h for this iruit to work? t h <? ns. 3
24 Sequentil iruits. Determine the stte digrm nd stte tle for the sequene iruit. Whih of the models Mely or Moore fits the iruit?. Determine the stte digrm nd stte tle for the sequene iruit. Whih of the models Mely or Moore fits the iruit?.3 Determine the stte digrm nd stte tle for the sequene iruit. Whih of the models Mely or Moore fits the iruit? 4
25 .4 Is there ny stopping ondition, loss ondition or isolted sttes in the stte digrm? Stopping ondition: Loss ondition: Isolted sttes:.5 To the right is stte digrm for Moore mhine. it will detet doule tp. A monkey identlly get hold of the push-utton input signl, nd then presses ording to the timing digrm elow. The Moore-mhine hs flip-flops tht re triggered y the positive edge of the lok. Suppose tht the initil stte is Z. Fill in the sttes the mhine enters.. Z: CP i Z Z Z Z Z Z Z Z Z Z.6 Construt Moore mhine whih requires tht the input signl is equl to one i during three suessive lok pulse intervl, for the output to e one u. As soon s the input signl eomes zero i during lok pulse intervl, the iruit output should return to zero u. See the stte digrm. Choose Gry ode for stte enoding. Z, Z, Z, Z3. Use D-flip-flops nd AND-OR gtes. This is sfety iruit to prevent "flse lrms 5
26 .7 Construt sequentil iruit tht detets when the input signl hs trnsition nd then hs the output u in the following lok-pulse intervl, nd then eing for the rest of the sequene. The iruit should e le to "reset" with n synhronous reset pulse NR tive low, so tht it monitors the input signl gin. Drw stte digrm of Moore mhine type for the sequene network. Derive the Boolen epressions for the net stte nd the output for three different stte enoding:: Binryode Gryode 3 One hot ode Show how the reset signl is onneted to NR D-flip-flops PRE nd CLR inputs..8 Design ounter tht ounts {,, 3, 4, 5, 6, }. The ounting sequene,, q q q, is to e shown with 7- segment disply, s roll of the die. Stte the epressions for the net stte. Complete the epressions with vrile EN whih will freeze the stte when EN unpressed utton. The ounter shold ount for EN pressed utton. Complete the epressions with vrile S6 whih fores the outer to stte 6 when S6 hidden utton pressed. This is the het-utton. S6 tkes preedene over EN..9 A stepper motor is digitl omponent tht is driven y pulses. Stepper motors re usully onneted to ounter ounting Gry ode. The figures ounter lso hs mode-input, m m. m m Reset fied position m m ount up w m m ount down w m m Preset nother fied position Sometimes you write oolen onditions insted of just the numers t the rrows. In the figure, oth the ondition nd numers re used. Derive the minimized epressions of the ounter net stte deoder. 6
27 . This stte digrm pplies to synhronous sequentil iruit. Derive stte tle. Minimize the numer of sttes. Derive the minimized stte tle Drw the minimized stte digrm.. This stte digrm pplies to synhronous sequentil iruit. Derive stte tle. Minimize the numer of sttes. Derive the minimized stte tle Drw the minimized stte digrm.. An engineering student uilds r thief lrm tht is synhronous Moore mhine. The lrm gets its "seurity" of eing seret nd unique. To strt the r you hve to mneuver the r's ontrols in the following order: Turn the ignition key ignition on Set the turn signl to the right right on 3 Turn off the ignition key ignition off 4 Set the turn signl to neutrl right off 5 Turn the ignition key ignition on If, t ny point in the list, you do the "wrong" thing you end up stuked in the n ALARM stte. If you do everything right the r strts get stuked in the IGNITION oil on stte. Sequene iruit lso hs "hidden" utton tht goes to the D-flip-flops reset, whih mens tht the lrm n e swithed ON / OFF. Drw the stte digrm for the lrm. 7
28 Asynhronous sequentil iruits. If the signls psses different mount of gte delys efore they re omined t the utput, then momentry unwnted devitions from the truth tle n our, so-lled "glithes". Show in Krnugh mp how to void them.. To the left in the figure, n SR lth hs two gtes with feed-k. To the right, the iruit is redrwn s omptile "Moore" mhine. There is no lok signl, nd no rel stte register. All gte delys tht re present in the network is thought pled in the symol etween Q nd Q getting similr funtion to the flipflops in synhronous sequentil iruit. Anlyze the SR-iruit in the sme wy s Moore mhine..3 Show tht there is n unstle network - n osilltor - if n odd numer of inverters re onneted in irle. Assume tht the gte dely t pd is 5 ns nd tht three gtes re onneted s in figure. Wht vlue will the osilltion frequeny get?.4 Anlyze following iruit: Drw stte digrm. Consider the iruit s n synhronous sequentil iruit whih hs the lok pulse s one of the synhronous inputs. Wht funtion does the iruit perform?.5 Construt n synhronous stte mhine tht funtions s doule edge triggered D flipflop DETFF, wih mens tht the flip-flop will hnge vlue t oth the positive nd the negtive edge of the lok. Derive the FSM. Construt the flow tle nd minimize it. Assign sttes, trnsfer to Krnugh mps nd derive the Boolen epressions. d Drw the shemti for the iruit. 8
29 .6 Anlyze the following iruit. Derive the Boolen epressions for the stte vriles Y nd Y. Derive the eittions tle. Whih funtion dshed re in the inner loops. Derive the flow tle, ssign symoli sttes nd drw FSM. d Identify the funtion. Whih flip-flop does this orrespond to?.7 Dt trnsfer etween different hips in eletroni equipments n e done with the so lled IC us. It onsists of two lines SDA nd SCL. The figure ove shows priniple digrm when numer of its re trnsmitted. During trnsmissom Dt D my only e hnged when SCL. Positive nd negtive SDA-edge when SCL re used s unique strt nd stop signls for dt trnsmission. During trnsmission no suh edges n our. Before the stop pulse, the reeiver n "knowledge" the reeption - in the figure we disregrds this. In order to study the IC dt trnsfer wnts to onstrut Moore-equivlent synhronous sequentil iruits whih provide output usy during the time from the strt signl until the stop signl. When no dt ommunition ours is usy. Derive primitive flowtle Minimize the flowtele Choose ode for stte signment derive the eittion tle motivte tht the design is free of ritil re Derive the minimized Boolen epressions motivte freedom of hzrd 9
30 Address deoding of memories nd I/O iruits. A dynmi RAM-memory onsists of numer of 56Mit memory hips orgnised s 3 M 8. How mny hips re needed for 56M 64? How mny hips re needed for 5M 7? Wht n e the reson for the "strnge" it width "7"?. 3:8-deoder ROM 5k 8 SRAM 5k 8 A ertin 6 it proessor n ddress 4 its. Memory Spe is divided etween ROM, SRAM nd IO iruits. Address deoding is done using 3:8-deoder. How lrge is the RAM in the figure? Wht is the ddress rnge epressed in hedeiml numers? How do you hnge the ddress rnge to 98 AFFFFF? How do you hnge the ddress rnge to 48 5FFFFF? 3
31 d Typilly proessor reds its first instrution from ddress then there must e red t tht ddress. Assume tht the ROM is M 6 itr nd tht the ddress rnge is... nd eyond. ROM Chip is 5k 8. How mny hips re needed? How should the deoder e onneted? How shll the memoryhips e onneted? Speify ddress spe of deoder outputs in hedeiml. numers. e Whih ddress spe eomes ville for SRAM nd IO iruits?.3 Peripherls, I/O, re often onneted to CPU s if they were memory hips though with only few "memory ells". Eg. rel time lok hip - keeps trk of the time nd dte. It is ontrolled/red from the 8 uilt-in 8-it registers. Connet one eight registers memory-mpped peripherl devie I/O to CPU. The CPU hs 6-it dt us we only use 8 its, nd 4 it ddress us. Use 3:8-deoder nd if needed gtes. The peripherl devie must e onneted so tht the ddresses re 7. Compre with the previous tsk. Wht is inomplete deoding? 3
32 Solutions Numer systems nd odes. Enter the orresponding inry numer se to the following deiml numers se d Convert the following inry numer to deiml ,5.3 Convert the following inry numers se to the orresponding otl se 8 nd hedeiml se 6. D B d DE e Convert the following hedeiml numers se 6 to the orresponding otl se 8. 94D E.7A Convert the otl se 8 numer to the orresponding hedeiml numer s D 6.6 Write the hedeiml se 6 numer BAC 6 in deiml form s. BAC Wht hrterizes Gry odes, nd how n they e designed? Gry odes hve the distne "one" etween odewords. There is never more thn one it t time tht hnges in the trnsitions from one odeword to the net. If one wnts to onstrut n N-it Gry ode n do this from the ode for the N- its. First, follow the N- it ode with "" s the it N, then ontinue to the net hlf of the N- ode gin ut with ode words in reverse order, with "" s it N. This is "mirrored inry ode." This is how do you do 3-it Gry ode from -it Gry ode: is -it Gry ode. is the ode with "" dded s it 3. is the -it ode in reverse order. is thereversed ode with "" dded s it 3. All together the 3-it Gry ode eomes: This is not the only possile 3-it Gry ode, nother possile ode for the three it re. In generl it is the "refleted inry ode" you men when you tlk out Gry ode..8 Type the following signed numers with inry two's omplement nottion, 6, 5, 4, 3,,,
33 d is to ig positive numer! Type the following signed numers with inry one's omplement nottion, 6, 5, 4, 3,,, d - 7 Digitl rithmeti. Add y hnd the following pir of inry numers... d... Add or sutrt ddition with orresponding negtive numers the following numers. The numers shll e represented s inry 4-it numers Nile in two's omplement form d Multiply y hnd following pirs of unsigned inry numers... d.. 33
34 .4 Divide y hnd following pirs of unsigned inry numers. / / If the division is integer division the nswer of is the integer..5 Assume tht 3-it flot is stored in register: 4C8 6 wht rel deiml numer is this? 3-it floting point numers re stored normlized s. One sign it, 8 its for the -eponent epressed s n eess-7, 3 its for signifind. Sine ll numers re strting with "" this is not needed to e stored, it is impliitly understood. Eess-7 mens tht numer 7 is dded to ll eponents, they re therefore lwys stored s positive numers. This hs the dvntge tht floting point numers n e sized s if they were integers!.6 The mimum quntiztion error ours etween 4 nd 6 or etween -6 nd -4. The error is 6-4/. Any representtion of the numer does not eist, you n hoose to use the smllest positive nd smllest negtive numers s nd -. This is done in the IEEE stndrd. 34
35 .7 Flot ddition Fot multiplktion this is simpler thn ddition! 35
36 Sets nd Cues Venn-digrm representtion 3. Proof of the distriutive lw with the help of Venn digrms. y z y z y z y z 3. Proof of De Morgn's lw using the Venn digrm. y y y y 3.3 The minterms plement in three vriles Venn digrm. 36
37 Venn digrm method lerly shows the oolen reltionships, ut re diffiult to use for more thn three vriles. It is imprtil to onvert to omputer lgorithm. 3.4 Represent the following funtion of three vriles, s 3-dimensionl ue with Gry-oded orner. f,, m,,3, 4,6 Use the ue to to simplify the funtion.. The ui representtion is hrd to visulize for more thn three dimensions, ut the minimiztion method n e esily defined for ny numer of vriles nd dimensions, nd then form the sis for omputer lgorithms. 37
38 38 Boolen lger nd gtes 4. d d d d f f } { onsensus f d f e f f onsensus f } { g d y y d d d d d d d d f } { h demorgn f } { i demorgn f } { 4. Prove lgerilly tht the following reltionships re vlid. 3 3 LHS: LHS: LHS: d 3 3 LHS: Simplify the following three epressions s muh s possile. z y yz remove onsensus yz z y yz z y z y } { y y y y y y y y y 4.4 Simplify the following epressions s muh s possile.
39 simplify f, relized y the figure gtes, s fr s possile, nd give the nme of the funtion. It will e n XNOR funtion Indite the logil epressions for A, B, C nd D. e e D e e C e e B e e A 4.9 Simplify the omple epressions elow s muh s possile. funtion XOR
40 4. Show tht This time we re proving the reltionship with so-lled "perfet indution." It involves diretly inserting ll four omintions of the two vriles in the vrious epressions. If the epressions hs the sme truth tle so they're equivlent. When the vriles re few, this non lgeri method old e used. LHS : RHS : LHS RHS 4. The figure shows the interntionl stndrd gte symols. Nme the gtes nd drw the orresponding Amerin gte symols. AND OR NOT NAND NOR XOR XNOR 4. From tet to Boolen epression. u 4 5 u 5 u u
41 The truth tle, SoP nd PoS form, omplete logi 5. Contts lwys depited in the unffeted position. To get the light to shine you should simultneously press the numers "4" nd "8" ie ontt d nd h. Plese note tht you must not press down ny other ontts! The logil funtion the light eomes: f d e f g h i k Code lok is deoder, tht deodes single minterm in the truth tle. 5. f f Funtion on SoP-norml form: f Funtion on PoS-norml form: f 5.3 f, y, z y yz z yz yz yz yz yz yz f, y, z m, f, y, z 5.4 f, y, z y yz y z y y z z yz y y z,,,, M,7 y z y z m,, 3, 4, 5, 6 yz y y yz y z yz y z yz yz y yz y yz y yz yz yz y z z yz y z z yz yz yz yz yz yz yz yz yz yz yz yz yz yz yz yz f, y, z m,,,, m, 4, 5, 6, 7 f, y, z M,,3 y z y z y z yz y 5.5 & & 5.6 4
42 5.7 Prity iruit for even prity, the numer of ones must e even,, or 4 for t the output. d J Hlf of the rows in the truth tle re. This funtion is not possile to minimize, ut ll 8 minterms need to e inluded in the SP form! J d d d d d d d d Anyone who lredy knows the Krnugh mp n diretly see tht no "groupings" re possile. With NOR gtes the PoS form is etter suitle. J d d d d d d d d 4
43 Krnugh mp d f d d d f d d f d f d 6.5 Truth tle nd Krnugh mp. The minimized funtion is otined y grouping of the 's in the Krnugh mp. The funtion inverse is otined if :s re grouped together "wrongly s if they were 's. f,,, m,, 4, 8,, f? f 3 3 f ? 43
44 f f { : s s: s } 6.6 Truth tle nd Krnugh mp. The minimized funtion is otined y grouping of the 's in the Krnugh mp. The funtion inverse is otined if :s re grouped together "wrongly s if they were 's. f,,, M,, 4, 5,,, 4, 5 f? f 3? 3 f f f { : s s : s }
45 6.7 Truth tle nd Krnugh mp. The minimized funtion is otined y grouping of the 's in the Krnugh mp. The funtion inverse is otined if :s re grouped together "wrongly s if they were 's. f 3,,, m,, 3, 4, 6, 7, 8, 9,,, 3, 4 f? f? 3 f f 3 3 f { : s s : s }
46 6.8 f 3,,, m3, 5, 7, d6, 5 f? f? f 3 f f 3,,, m, 4, 5 d, 3, 6, 7,8,9,,3 f? f? f f 3 f or 46
47 6. Krnugh mp for five vriles. The left digrm is for 4 nd the right for 4. If the sme grouping n e mde in oth digrms then the vrile 4 or 4 is omitted, otherwise it hs to e inluded. f 4, 3,,, f? f? f f
48 MOS-trnsistors nd digitl iruits 7. This is CMOS-inverter. 7. Y A. This is CMOS-NAND-gte. Y A B. 7.3 This is CMOS-OR-gte. Y A B. 48
49 7.4 The iruit is n inverter with THREE-stte output. When EN eomes the irled portion "plugged in" nd Y A the reltionship etween Y nd A is then inverted,. When EN eomes the irled portion "unplugged. Output eomes disonneted nd in third stte, eept nd there is stte "disonneted". Sine the output Y now is disonneted it is no longer ffeted y the input A. THREE-stte outputs re used to mke it possile to onnet mny outputs to single line us. Severl iruits outputs n utilize ommon input line, provided tht only one of the iruits re tive EN t time the others hs EN nd re disonneted. 7.5 CMOS-iruits osists of two suiruits tht eh other's inverses. The Pull-up-net, PUN, trnsfers to the output while the pull-down network trnsfers. If one nlyzes the Pull-down network, one therefore get the funtion Y inverted. Y AC B Y AC B AC B A C B A C B Pull-up-net shll hve A nd C in prllell nd then in series with B. The use of PMOS-trnsistors inverts the vriles A, B nd C. A C B 49
50 Comintoril iruits 8. X U X u 5 u 4 u 3 u u u In the truth tle we n see tht u llwys is equl to. u output n therefore e diretly onneted V ground so it will hve the output onstnt. We n lso see tht u llwys is equl to. u output n therefore e diretly onneted to the input. The other epressions re otined y using their Krnugh mps. 8. X 3 U u u u In the truth tle we n see tht u nd 3 re equl why u diretly n e onneted to 3. u 3. The other epressions re otined y using their Krnugh mps. 5
51 Gte iruits: 8.3 Truth tle r 5 r 4 r 3 r r y 4 y y
52 y 8 y 4 y y y y y y Two of the AND-gtes n e ommon to the y 8,y nd y 8,y,y -iruits
53 8.6 A 4- multipleer used s funtion genertor for the OR-funtion. 8.7 M M 7 M M g h g h 53
54 8.8 In order to mke full dder we need to use the the upper MUX to the sum funtion, nd the ottom MUX, whih is onneted to C OUT, is used for the Crry-funtion. In sted of we hoose C IN. In order for the upper MUX to e onneted to the logi element output the output mu must e ontrolled with insted of with 3. A B C IN C OUT
55 8. Alterntively, the XOR gte is lso used to MUX input nd. 8. The gretest numer will e s m Sine the lultor is not llowed t the em, this time we n hoose to trnsform 9 to inry numer in the sme wy s in lso other onversion method re ok: 55
56 8. 56
57 Sequentil iruits, lthes nd loked flip-flops 9. The figure shows SR-lth, ut t the end of the input-sequene the foridden input omintion S, R will our. The outputs Utgångrn will not e eh others inverses for this omintion. For NOR-gtes is loking input signl, therefore Q s long s S is left t JK-flip-flop n e used s T-flip-flop or s D-flip-flop. When flip-flops re onneted to eh other there re usully the inverted outputs ville, you will then not require the inverter to mke the JK flip flop to D flipflop. 57
58 9.6 T t pd t f T t s pd t s 3 [ ns] MHz The lok period is determined y the longest pth, the one with the XOR-gte. T CP > t pdq t su t pdxor 345 ns. Hold time is the time the dt input must e stle fter the lok edge. The flip-flop tht hs its D-input diretly onneted to the Q will get it s D-input hnged first, diretly fter t pdq 3 ns. t h < 3 ns. 58
59 59 Sequentil iruits. From the iruit digrm one n e derive the following epressions: q q q q q q q No output deoder eists the flip-flop stte is diretly used s output. Moore model is to e used.. From the iruit digrm one n e derive the following epressions: q q q q q q q q q q q q U Sine U depends diretly of must Mely model e used.
60 .3 From the iruit digrm one n e derive the following epressions: U q q q q q q q q q q q Sine U only depends on the stte nd is is independent of must Moore model e used..4 Stopping ondition: Z3 Loss ondition: Z7 Isolted sttes: Z.5 Z: CP i Z Z Z Z4 Z6 Z Z Z Z Z3.6 From stte digrm to oded stte tle. 6
61 .7 Stte enoding Binry: Stte enoding Gry: 6
62 Stte enoding One hot: This is how to do reset to with CLR inputs for the Bin/Gry stte enoding, nd to with PRE/CLR inputs for the one hot stte enoding. 6
63 .8 Si stte requires three flip-flops. There re 8 sttes in totl, two sttes whih re not inluded in the sequene. To e on the sfe side we speify wht should hppen with these sttes, so tht the ounter will not get stuk t Z or Z7. Equtions with EN EN net stte sme : Equtions with S6 S6 net stte is : q q q.9 ' EN q ' EN q ' EN q EN q EN q EN q q q q '' q '' q '' q ' S6 ' S6 ' S6 63
64 . 64
65 65. Groups with sme output:,,,, e d f P Emine net sttes:,,,,,,,,,,,,,,,,,,,,,,,,,,,, f e f e f d f d f f f f e d e d f e d f e d i i i i i i i i i i i i Groups with sme susequent stte output: 3,, P P e d f P.
66 Asynhronous sequentil iruits. G BC AB { Hzrdfree} G BC AB AC. To the left is SR-lth mde y two gtes with feedk. To the right the iruit is drwn s Mooreomptile sttemhine. Moore-mhine. Q R S Q R S Q R S Q S R RQ When deling with synhronous sttemhines the oded stte tle is used to e nmed eittion tle. For eh input olumn, there must e t lest one stte where Q Q. Suh onditions re stle nd they re usully mrked y irle. The stte digrm follows from the eittion tle. The stte tle is nmed flow tle when working with synhronous stte mhines
67 .4 At positive edge C hnges from to nd when C the MUX onnets the upper flip-flop q to the output. At negtive edge C hnges from to nd C the MUX onnets the lower flip-flop q to the output. The result is D-flip-flop tht rets on oth edges of the lok..5 There re four input omintions CD nd two output omintions Q. A totl of 8 possile sttes CDQ.: Possile input/output omintions Present stte Net stte Comment Stte tg CDO CDO CDO A Output O gets D input vlue when C hnges vlue B C No hnge of O when D hnges vlue D E F G H Flow tle stile sttes mrked in old font Present Net Stte Output stte CD A A C - E B B D - E C A C H - D B D H - E A - G E F A - H F G - D G E H - D H F We see immeditely tht no minimiztion my e done y stte equivlene lsses, euse ll eight sttes hve different outputs where they hve stle sttes, nd where they hve do not res in the tle. Merger-digrm: 67
68 The minized flow tle Flow Tle stle sttes mrked s old Present Net Stte Output stte CD A A A F E B B B F E E A B E E F A B F F Assign sttes, do Krnugh-minimiztion nd derive the oolen equtions. Possile stte ssignements re E, B, A, F nd their rottions nd mirror solutions: Possile stte ssignments A F B E One of the resulting stte tles Flow Tle stle sttes mrked s old Present Net Stte Output stte CD And the orresponding Krnugh digrms nd Boolen epressions eomes: S S CD S S C D S S SS C D O S S D S S C S C D S CD S S C 68
69 .6 Derive the Boolen epressions for the stte vriles. Answer: Y Y Y Y Y C Y C Y Y I Y I C Y C Derive the eittions tle. Whih funtion dshed re in the inner loops. The two inner loops re hzrd-free MUX:es! Derive the flow tle, ssign symoli sttes nd drv FSM. Identify the funtion of the synhronous iruit. Whih flip-flop is it? Positive edge-triggered T-flip-flop. 69
70 .7 Folow the timing digrm nd rete new stte for every omintion tht hs not een efore. In stte we wits for the strtedge, then input is impossile mrked with *. The Protool prohiits hnge of dt SDA when SCL is high. Therefore input is impossile in stte e mrked with *. This gives us two etr don t re positions in the tle. You n diretly see whih sttes tht n e merged. As stte ode ssignement the Gry-ode n e used.,, de, nd. n e used s don t re eept from. The groups re forming ontiguous res in Krnughdigrm nd therefore hzrd free if the networks hve two levels. Relising with optionl gtes. 7
71 Address deoding of memories nd I/O iruits. A dynmi RAM-memory onsits of some 56Mit memory hips orgnised s 3 M 8. How mny hips re needed for 56M 64? Memory N 56M M 64 it. Chip p 3M q 8 it. Numer of olumns k M/q 64/8 8. Numer of rows r N/p 56M/3M 8. Totl numer of hips K r k How mny memory hips re needed for 5M 7? wht n e the reson for the unusul widh 7 of the memory? Memory N 5M M 7 it. Chip p 3M q 8 it. Numer of olumns k M/q 7/8 9. Numer of rows r N/p 5M/3M 6. Totl numer of hips K r k The unusul width The 8 etr its re used for orreting single errors nd deteting doule errors. Not shown in this ourse.. A ertin 6 it proessor n ddress 4 its. Memory Spe is divided etween ROM, SRAM nd IO iruits. Address deoding is done using 3:8-deoder. How lrge is the RAM in the figure? Wht is the ddress rnge epressed in hedeiml numers? Memory hip: p 5k q 8 itr Memory: r 3 k K 3 6 M k q 8 6 itr N p r 5k 3,5M Address rnge: 7
72 How do you hnge the ddress rnge to 98 AFFFFF? Chnge the ddress rnge to 48 5FFFFF? We Interhnges A3 nd A! d ROM-memory is M 6 it nd the ddress rnge is nd forwrd. ROM Chip is 5k 8. How mny hips re needed? Memory: How is the deoder onneted? N M 45k word is M 6 it How re the memory hips onneted? Memory hip: Whih is the ddress re for the ROM epressed in p 5 k yte width q 8 it hedeiml numers. Numer of hip rows r N/p 45k/5k 4 Numer of hip olumns k M/q 6/8 Totl of hips K r k 4 8 7
73 mmm mmmm mmmm mmmm mmmm - F F F F -7FFFF - F F F F 8-FFFFF - F F F F -7FFFF - F F F F 8-FFFFF Totl ROM FFFFF e Whih ddress rnge is free for SRAM nd IO-iruits? mmm mmmm mmmm mmmm mmmm - F F F F -7FFFF - F F F F 8-FFFFF - F F F F 3-37FFFF - F F F F 38-3FFFFF Possile SRAMI/O ddresses 3FFFFF.3 Connet 8 register memory-mpped peripherl devie I/O to CPU. The CPU hs 6-it dt us only 8 its re used y the hip, nd 4 it ddress us. Use 3:8-deoder nd if needed gtes. The peripherl devie must e onneted so tht it hs register ddresses I/O ddresses, 7FFFF is to e found, ording to the previous eerise, t the 3:8-deoder output 4. It deodes A3... A9, the peripherl itself deodes A... A, 73
74 the rest we hve to deode with n nd-gte wht is ment y inomplete deoding? For full deoding, we used &-gte with 7 inputs! Sometimes you mke prtil deoding. Then you omits ddress signls nd thus n use gte with fewer inputs I/O devie ddressing is miguous, it n e ddressed with mny different ddresses, ut the one who writes the progrm ode determines whih ddresses to use. The min thing is to ensure tht the I/O devie ddresses do not ollide with ny other devie ddresses. 74
75 75
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 informationCARLETON 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 informationSolutions - 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 informationexpression 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 informationEngr354: 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 informationInstructions. 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 informationCombinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.
5/9/ Comintionl Logic ENGG05 st Semester, 0 Dr. Hyden So Representtions of Logic Functions Recll tht ny complex logic function cn e expressed in wys: Truth Tle, Boolen Expression, Schemtics Only Truth
More informationBoolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
More informationProject 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 informationControl with binary code. William Sandqvist
Control with binry code Dec Bin He Oct 218 10 11011010 2 DA 16 332 8 E 1.1c Deciml to Binäry binry weights: 1024 512 256 128 64 32 16 8 4 2 1 71 10? 2 E 1.1c Deciml to Binäry binry weights: 1024 512 256
More informationCS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation
CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes
More information1 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 informationCS 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 informationFast Boolean Algebra
Fst Boolen Alger ELEC 267 notes with the overurden removed A fst wy to lern enough to get the prel done honorly Printed; 3//5 Slide Modified; Jnury 3, 25 John Knight Digitl Circuits p. Fst Boolen Alger
More information5. Every rational number have either terminating or repeating (recurring) decimal representation.
CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd
More informationExercise 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 informationNON-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 informationLecture 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 informationAP 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 informationSECTION 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 informationGM1 Consolidation Worksheet
Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up
More informationLogarithms LOGARITHMS.
Logrithms LOGARITHMS www.mthletis.om.u Logrithms LOGARITHMS Logrithms re nother method to lulte nd work with eponents. Answer these questions, efore working through this unit. I used to think: In the
More informationPropositional 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 information8 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 informationLecture 3. Introduction digital logic. Notes. Notes. Notes. Representations. February Bern University of Applied Sciences.
Lecture 3 Ferury 6 ern University of pplied ciences ev. f57fc 3. We hve seen tht circuit cn hve multiple (n) inputs, e.g.,, C, We hve lso seen tht circuit cn hve multiple (m) outputs, e.g. X, Y,, ; or
More information= 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 informationThe 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, 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 informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationTrigonometry Revision Sheet Q5 of Paper 2
Trigonometry Revision Sheet Q of Pper The Bsis - The Trigonometry setion is ll out tringles. We will normlly e given some of the sides or ngles of tringle nd we use formule nd rules to find the others.
More informationActivities. 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 information6.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 informationDiscrete 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 informationELECTRICAL 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 informationSystem 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 informationCS311 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 informationBoolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd
More informationDigital Control of Electric Drives
igitl Control o Electric rives Logic Circuits - Comintionl Boolen Alger, escription Form Czech Technicl University in Prgue Fculty o Electricl Engineering Ver.. J. Zdenek Logic Comintionl Circuit Logic
More informationEECS 141 Due 04/19/02, 5pm, in 558 Cory
UIVERSITY OF CALIFORIA College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Lst modified on April 8, 2002 y Tufn Krlr (tufn@eecs.erkeley.edu) Jn M. Rey, Andrei Vldemirescu Homework
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationMaintaining Mathematical Proficiency
Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +
More informationELECTRICAL 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 informationComparing the Pre-image and Image of a Dilation
hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity
More informationTechnische 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 informationPYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:
PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles
More informationExam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM
riting Exms: Exm Review riting Exms += riting Exms synhronous iruits Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting
More informationLinear 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 informationCS 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 informationLogic 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 informationProbability. b a b. a b 32.
Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,
More informationReview 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 informationChapter 8 Roots and Radicals
Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi
More informationMatrices 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 informationIntroduction to Electrical & Electronic Engineering ENGG1203
Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 27-8 Dr. Hden Kwok-H So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationLecture 6. Notes. Notes. Notes. Representations Z A B and A B R. BTE Electronics Fundamentals August Bern University of Applied Sciences
Lecture 6 epresenttions epresenttions TE52 - Electronics Fundmentls ugust 24 ern University of pplied ciences ev. c2d5c88 6. Integers () sign-nd-mgnitude representtion The set of integers contins the Nturl
More informationWriting Exams: Writing Exams. Exam Review
riting Exms: riting Exms Exm Review riting Exms synhronous iruits += Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting
More informationBehavior 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 informationwhere 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 informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More information21.1 Using Formulae Construct and Use Simple Formulae Revision of Negative Numbers Substitution into Formulae
MEP Jmi: STRAND G UNIT 1 Formule: Student Tet Contents STRAND G: Alger Unit 1 Formule Student Tet Contents Setion 1.1 Using Formule 1. Construt nd Use Simple Formule 1.3 Revision of Negtive Numers 1.4
More informationSection 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 informationLecture 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 informationSymmetrical 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 informationOverview of Today s Lecture:
CPS 4 Computer Orgniztion nd Progrmming Lecture : Boolen Alger & gtes. Roert Wgner CPS4 BA. RW Fll 2 Overview of Tody s Lecture: Truth tles, Boolen functions, Gtes nd Circuits Krnugh mps for simplifying
More informationI1 = 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 informationChapters Five Notes SN AA U1C5
Chpters Five Notes SN AA U1C5 Nme Period Section 5-: Fctoring Qudrtic Epressions When you took lger, you lerned tht the first thing involved in fctoring is to mke sure to fctor out ny numers or vriles
More information12.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 informationSpacetime and the Quantum World Questions Fall 2010
Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1
More informationMathematics SKE: STRAND F. F1.1 Using Formulae. F1.2 Construct and Use Simple Formulae. F1.3 Revision of Negative Numbers
Mthemtis SKE: STRAND F UNIT F1 Formule: Tet STRAND F: Alger F1 Formule Tet Contents Setion F1.1 Using Formule F1. Construt nd Use Simple Formule F1.3 Revision of Negtive Numers F1.4 Sustitution into Formule
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationDigital Circuit Design
2017-10-11 0 Introdution Digitl Ciruit Design Eri Hehner University of Toronto The word iruit is relted to the word irle. It ws used to desrie losed eletril pth tht goes from one end of n eletril ttery,
More informationPAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationChapter 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 informationTHE PYTHAGOREAN THEOREM
THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this
More informationFinite 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 informationLESSON 11: TRIANGLE FORMULAE
. THE SEMIPERIMETER OF TRINGLE LESSON : TRINGLE FORMULE In wht follows, will hve sides, nd, nd these will e opposite ngles, nd respetively. y the tringle inequlity, nd..() So ll of, & re positive rel numers.
More informationPythagoras Theorem. Pythagoras Theorem. Curriculum Ready ACMMG: 222, 245.
Pythgors Theorem Pythgors Theorem Curriulum Redy ACMMG:, 45 www.mthletis.om Fill in these spes with ny other interesting fts you n find out Pythgors. In the world of Mthemtis, Pythgors is legend. He lived
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationGeneralization 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 informationSimilar Right Triangles
Geometry V1.noteook Ferury 09, 2012 Similr Right Tringles Cn I identify similr tringles in right tringle with the ltitude? Cn I identify the proportions in right tringles? Cn I use the geometri mens theorems
More informationHardware 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 informationIntroduction 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 informationA 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 informationExercise 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 informationA 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 informationApril 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 informationNon Right Angled Triangles
Non Right ngled Tringles Non Right ngled Tringles urriulum Redy www.mthletis.om Non Right ngled Tringles NON RIGHT NGLED TRINGLES sin i, os i nd tn i re lso useful in non-right ngled tringles. This unit
More informationMath Lesson 4-5 The Law of Cosines
Mth-1060 Lesson 4-5 The Lw of osines Solve using Lw of Sines. 1 17 11 5 15 13 SS SSS Every pir of loops will hve unknowns. Every pir of loops will hve unknowns. We need nother eqution. h Drop nd ltitude
More informationTOPIC: 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 informationChapter 9 Definite Integrals
Chpter 9 Definite Integrls In the previous chpter we found how to tke n ntiderivtive nd investigted the indefinite integrl. In this chpter the connection etween ntiderivtives nd definite integrls is estlished
More informationSolutions 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 informationAlgorithms & 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 informationLecture 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 informationCalculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx
Clulus Chet Sheet Integrls Definitions Definite Integrl: Suppose f ( ) is ontinuous Anti-Derivtive : An nti-derivtive of f ( ) on [, ]. Divide [, ] into n suintervls of is funtion, F( ), suh tht F = f.
More informationPolynomials. Polynomials. Curriculum Ready ACMNA:
Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression
More informationTIME 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 informationAdvanced Algebra & Trigonometry Midterm Review Packet
Nme Dte Advnced Alger & Trigonometry Midterm Review Pcket The Advnced Alger & Trigonometry midterm em will test your generl knowledge of the mteril we hve covered since the eginning of the school yer.
More information( ) { } [ ] { } [ ) { } ( ] { }
Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or
More information