Automatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL
|
|
- Leslie Heath
- 5 years ago
- Views:
Transcription
1 Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig codes. Automatig the desig process for these multipliers could reduce the cost ad developmet time of hardware implemetatios. I this project, we preset a geeral desig for these multipliers ad a strategy to geerate them automatically give the precisio of the operads ad the irreducible polyomial which defies the field. I particular, the geeratio ad use of tree structures based o a previously proposed recursive VHDL techique is compared with other Galios Field multipliers. It is show that the fial result of this automatic desig tool is very competitive with some specialized desigs preseted i the literature, with the advatage that it ca be adjusted to ay type of triomial or petaomial i the IEEE stadard. Idex Terms recursive VHDL, GF (2 ) multiplicatio, automatic geeratio, cryptography, recofigurable. I. INTRODUCTION MULTIPLICATION i biary extesio fields, or Galois Fields GF (2 ), is a very importat operatio i several umerical algorithms used i cryptographic applicatios ad error-correctig codes []. The field is defied based o a irreducible polyomial ad as a result, the multipliers have a structure that depeds o this polyomial [2]. Polyomials with fewer coefficiets have less complexity, ad for this reaso the most commo irreducible polyomials are triomials ad petaomials (3 ad 5 coefficiets respectively). The IEEE stadard shows a huge list of such polyomials [3]. Most of the work preseted i the literature estimates the complexity of multipliers i GF (2 ) [4], [5], [6], [7] ad usually proposes desig alteratives to optimize them. However, the actual desig process, eve with these desig guidelies, is always a complex ad tedious task. I this work we preset a HDL (hardware descriptio laguage) descriptio for multipliers i GF (2 ) that use polyomial basis. This descriptio allows the geeratio of multipliers for ay field size (withi the limits of the sythesis tool) ad for ay triomial or petaomial. However, the basic cocept is geeral ad could be used for ay type of irreducible polyomial. As i other multipliers, the fast additio of partial products is the most importat factor i determiig performace. The use of tree structures is the fastest way to perform this task. However, a parameterizable descriptio of tree structures usig VHDL ca oly be obtaied whe usig recursive calls. The use of recursive VHDL is briefly explaied i Sectio IV. The beefits of usig a automatic geerator Authors are with the Departmet of Electrical Egieerig & Computer Sciece, Orego State Uiversity, Corvallis, Orego {elsoja,laige,teca}@ece.orst.edu of multipliers are flexibility ad speed. From the iformatio about the field size ad possibly the irreducible polyomial, the multiplier is geerated with miimal user itervetio. This approach sigificatly reduces the cost of gettig a workig ad efficiet desig solutio. We iitially preset a overview of multiplicatio i GF (2 ) ad show the geeral desig approach to be used i this work. A brief descriptio of recursive VHDL is also show. Some experimetal results are preseted ad compared agaist published results. We iitially imagied that the circuit would be iefficiet, but the results show that the sythesized desig is very competitive with optimized multiplier desigs. These results are show i later sectios. II. POLYNOMIAL BASIS MULTIPLICATION IN GF (2 ) For our desig we chose to use the stadard or polyomial basis to represets elemets i GF (2 ). Whe usig polyomial basis, each elemet of the field is represeted by a polyomial of the form a(x) = a x + a 2 x a 2 x 2 + a x + a 0 whose coefficiets are always or 0. To create a proper field a irreducible polyomial of degree must be chose to defie that field. All operatios withi the field are the performed modulo the polyomial. Additio ad subtractio, whe usig polyomial basis, is a simple XOR of the correspodig coefficiets. Multiplicatio o the other had is a very complicated procedure requirig the result to be reduced by as show i (). c(x) = a(x)b(x) mod () This reductio ca be performed by subtractig x i for each coefficiet i whose degree is greater tha. If we view the multiplicatio as show i (2) the it is possible to reduce each partial product seperately as show i (3). (a(x)b x + + a(x)xb + a(x)b 0 ) mod (2) c(x) = a(x)b i x i mod (3) i=0 I fact, the reductio ca be further simplified by usig each reduced partial product as the base for the ext partial product. We ca produce ay partial product z(x) i as z(x) i = z(x) i x + z (4) where z is the MSB of z(x) i ad z(x) 0 = a(x). Each z(x) i is the ANDed with b i to select the actual partial products. This allows us to perform the reductio while calculatig each partial product by addig z at each iteratio.
2 2 c(x) 0 Geerator MSB MUX Shift Left b(x) - Recursive XOR Trees 0 Geerator MSB MUX Shift Left a(x) b(x) 0 Fig.. Block Diagram of recursive implemetatio. Note that the result of each partial product module is fed ito the ext. It is also possible to view the polyomial basis multiplicatio as the multiplicatio of a biary matrix ad a biary vector as preseted i [2]. Each colum of the biary matrix cotai oe partial product a(x)x i. The biary vector cotais the coefficiets of b(x). It is the possible to create a reductio matrix Q based o. It has bee show that the logic required to add i the reductio matrix Q ca be greatly simplified for most polyomials [4], [5], [6]. For all polyomials preseted i [3] the Q matrix will be very sparse. This leads to a faster ad smaller implemetatio. III. MULTIPLIER DESIGN APPROACH The multiplier we preset i this paper is a Galois Field multiplier that operates o field elemets defied usig polyomial basis. The irreducible polyomial ca be prespecified for each desired multiplier desig or oe will be automatically chose from [3] based o the operad size. Rather tha describig the matrix preseted i [2] our HDL describes a structure with two mai parts. The first is the the partial product geeratio stage ad the secod combies the resultig partial products. The combiatio of the partial products is performed by the recursive XOR trees described i Sectio IV. Idividual partial products are computed by left-shiftig the previous partial product by oe bit ad checkig the mostsigificat bit (MSB) of the result. If this bit is equal to 0, the the curret partial product has ot exceeded the degree of the field. If it is equal to, the it has exceeded the degree of field ad must be reduced by. The reductio is accomplished by a bitwise XOR of the shifted partial product ad. This way, the partial product computed i ay iteratio ca always be represeted i a -bit vector. The computed partial product is passed o to the ext iteratio ad this process cotiues util all partial products have bee geerated. As show i Figure, each dotted block represets oe iteratio step. I each block, the curret partial product is leftshifted ad its MSB is used to determie whether the partial product will be reduced by. The resultig partial product is the used i the ext iteratio step. The, effective partial products are selected by AND operatios of the partial product at block i with c(x) i. To obtai the result, a bitwise-xor of all the effective partial products is accomplished by meas of a XOR tree. IV. RECURSIVE VHDL DESCRIPTION OF TREES Several efficiet hardware circuits are costructed usig trees. Describig these trees usig o-recursive costructs ca be very difficult. By usig recursive VHDL [8], we foud a compact ad regular way to describe these trees. The followig code is the architecture body of the etity called tree: BEGIN // begiig of architecture body degeerated tree: IF d = 0 GENERATE output <= iput(0); END GENERATE degeerated tree; sigle gate: IF d = GENERATE xor gate root: xor GENERIC MAP( => ) PORT MAP(a => iput, z => output); END GENERATE sigle gate; compoud tree: IF d > GENERATE the gate: xor GENERIC MAP( => ) PORT MAP(a => xor iput, z => output); subtree array: FOR i IN 0 TO GENERATE the subtree: tree GENERIC MAP(d => d-, => ) PORT MAP(iput => iput(i***(d-) to (i+)***(d-)-), output => xor iput(i)); END GENERATE subtree array; END GENERATE compoud tree; END; // ed of architecture body where xor is a -iput XOR gate compoet. The variable d correspods to the tree level, ad depedig o the level differet istatiatios are made. Whe d = 0 the tree is a sigle wire (degeerated tree). Whe d = the level cosists of a sigle XOR gate (the base of the tree). Whe the d >, oe XOR gate is used, ad each gate iput is coected to oe ew tree. That is whe the same compoet tree is ivoked agai. This VHDL code is extremely simple ad flexible eough to geerate trees of differet sizes. It allows the cotrol of the fa-i of the XOR gate ad the umber of tree levels. Oce a tree is used to assimilate several bits from the partial products, there will most frequetly be uused iputs. It is expected that the sythesis tool will prue uused logic from the tree geerated from the recursive descriptio. Give the sparse ature of the large peta- or triomial, the sythesis tool is able to remove a large umber of XOR gates that have all the iputs as zero, or oly oe variable with all the remaiig iputs as zeros. V. INITIAL SYNTHESIS RESULTS To determie the characteristics of the proposed multiplier desig, it was sythesized usig several differet operad sizes. For each ru, oe of the irreducible polyomials supplied i [3] were used. These polyomials icluded both
3 3 triomials ad petaomials. The sythesis was performed usig the Leoardo ad the HEP ADK with its AMI-05 CMOS libraries. As explaied before, we expected to have the sythesis tool prue uused XOR gates from the tree. However, we did ot expect that the sythesis tool would break the coectios betwee partial product geerators ad make the fial bitslices largely idepedet. I doig this, the sythesis tool udoubtedly improved the delay of the fial circuit. Table I cotais results from sythesis rus at 4, 8, 6, 32, 64, ad 28 bits. We had attempted to sythesize larger versios but the system requiremets exceeded the available resources. Ideally, we would like to determie the behavior of the recursive desig at 52 ad 024 bits. Table I Auto-Geeratio ASIC Results Size XOR gates AND gates Delay 4-bit 5 6 T A + 3T X 8-bit T A + 7T X 6-bit T A + 7T X 32-bit,083,024 T A + 9T X 64-bit 4,22 4,096 T A + 0T X 28-bit 6,638 6,384 T A + 0T X The memory requiremet to sythesize desigs with a large umber of bits is sigificatly high. This is due largely to the umber of istaces eed for such a large bit-parallel multiplier. The amout of memory available to the sythesis tool will almost certaily defie the largest multiplier which ca be created usig auto-geeratio. As ca be see, the area of the recursive desig is quite large. Give the large umber of XOR gates eeded to costruct the recursive trees, the area results are ot surprisig. It is iterestig to ote the delay characteristics of this desig. Give the desig of the partial product geeratio it was expected that there would be a large liear compoet, with a logarithmic compoet cotributed by the XOR trees. However, whe the sythesis tool optimized the partial product geeratio module, it chaged the delay characteristics of the proposed multiplier structure. VI. COMPARISON TO OTHER MULTIPLIERS For compariso, other parallel implemetatios of GF (2 ) multipliers are itroduced. The first is based o a modified versio of the Karatsuba algorithm for polyomial multiplicatio. The secod is a form of Mastrovito multiplier. For more details o these desigs see [7,8]. The multipliers are similar to the oe preseted i this work i the sese that their delay grows logarithmically as icreases. It should be oted that the delays for the multipliers from [7,8] are purely theoretical ad the delay ad area characteristics are based solely o the algorithms. See Tables II ad III for the estimated delay ad area values. The data shows that the recursive desig is geerally about twice as large as the Karatsuba multiplier. This is cosistet for all the values of we have sythesized. These results may idicate that there is more which ca be doe to optimize the area of the auto-geerated multiplier. It is i the delay performace that the auto-geerated desig begis to show a real beefit. Figure 2 compares the delay characteristics of the recursive desig with those of the other multipliers. As ca be see i the chart, the auto-geerated desig is able to out perform the Karatsuba multiplier at higher operad sizes. Table II Karatsuba-Ofma[7] ASIC Estimates Size XOR gates AND gates Delay 4-bit 9 6 T A + 2T X 8-bit T A + 6T X 6-bit T A + 0T X 32-bit T A + 4T X 64-bit 2,649,296 T A + 8T X 28-bit 8,455 3,888 T A + 22T X Table III Mastrovito Multiplier[2] ASIC Estimates Size XOR gates AND gates Delay 4-bit[4] 5 6 T A + 3T X 8-bit[6] T A + 6T X 6-bit[6] T A + 7T X 32-bit[6],085,024 T A + 9T X 64-bit[6] 4,60 4,096 T A + 9T X 28-bit[6] 6,637 6,384 T A + 0T X Eve whe compared to the ideal Mastrovito multiplier, the auto-geerated multiplier remais very competitive. The gap betwee the two ever exceeds oe T X (XOR delay) for ay operad size. I both cases where the auto-geerated multiplier lags behid the ideal Mastrovito multiplier, is of the form x + x 4 + x 3 + x +. For this type of petaomial, the sythesis tool seems uable to completely optimize partial product geeratio. This may i fact be due to the limitatio of auto-geeratio or it may be simply a weakess i the sythesis tool. More detailed aalysis of the resultig etworks will eed to be performed before results like [6] ca be obtaied for these polyomials. VII. FPGA IMPLEMENTATION Automatic geeratio of multipliers i GF (2 ) is particularly iterestig for FPGAs, give the large umber of polyomials that are available i the stadard. For more security, several desigs could be geerated ad replaced periodically. The flexibility of the FPGA, combied with the auto-geeratio capabilities, would allow for rapid chages ad make periodic desig chages quick ad cost effective. Give the resources available withi a FPGA, pipeliig the multiplier becomes a very effective way to improve performace without much of a impact o size. By pipeliig the auto-geerated multiplier, the performace hit, caused by the ature of FPGA implemetatios, could be sigificatly reduced. This chage will greatly improve the throughput of the auto-geerated multiplier.
4 4 Fig. 2. Our auto-geerated multiplier out performs the Karatsuba multiplier for larger values of ad remais very close i performace to the ideal Mastrovito multiplier. Geerator b(x) Geerator 2 Levels of XOR Gates XOR Gates b(x) Geerator a(x) b(x) 0 Fig. 4. Pipelied performace does ot iclude cold start Table V No-Pipelied Multiplier FPGA Results Size LUTs CLB Slices Delay (s) 4-bit bit bit bit, bit 5,435 2, bit 2,760 0, c(x) XOR Gates DFFs Table IV Pipelied Recursive Multiplier FPGA Results Fig. 3. Block diagram of pipelied FPGA implemetatio The origial recursive desig was modified to iclude iput ad output registers as well as registers to hold each partial product. Flip-flops were also added to the recursive XOR trees. The flip-flops were iserted betwee every other level of the tree structure as show i 3. The recursive VHDL allowed for easy itegratio of these flip-flops ito the XOR trees. For details see Sectio VIII. The results of the FPGA sythesis for the pipelied implemetatio are show i Table IV. For the target of our FPGA sythesis we agai used Leoardo. We chose Xiliix VIRTEX as our target family. The specific device was varied depedig o the space requiremets of the multiplier beig geerated. To study the performace of the pipelied recursive multiplier, a o-pipelied versio was also sythesized to the same FPGAs. The sythesis results for this multiplier are show i Tables V. As expected, the throughput of the auto-geerated multiplier was greatly icreased by pipeliig. See Fig. 4 for a compariso of throughput for the two desigs. While the latecy of a sigle calculatio would be less i the opipelied desig, the ability of the pipelied multiplier to complete a multiplicatio every clock cycles makes it faster whe cosiderig a large umber of multiplicatios performed back to back. Size LUTs CLB Slices Dff Clk (MHz) 4-bit bit bit bit, , bit 5,592 2,89 5, bit* 9,0 8,0 00 *Uoptimized, oly a iitial pass could be made. Curretly, the mai limitig factor i performace of the pipelied recursive desig is the partial product geeratio stage. To allow the sythesis tool to freely optimize partial product geeratio, D-flip-flops caot be iserted ito this stage prior to sythesis. The key to improvig performace at larger operad sizes will be to modify the partial product geeratio to allow for automated pipeliig without impairig the sythesis tool s ability to optimize this stage based o the polyomial. VIII. PIPELINING THE RECURSIVE VHDL TREES To make the multiplier more effective i a FPGA eviromet, the desig was pipelied to icrease throughput ad clock speed. To pipelie the recursive tree structures, additioal geeric parameters are passed betwee levels. The geeric values idicate whether or ot the output of that level should be latched. Oe value sets the umber of recursive
5 5 levels i betwee latches. The secod determies which levels will actually be latched. This iherit flexibility allows for the pipelied recursive tree to be optimized for clock frequecy ad target device. The code for tree was modified i the followig maor: BEGIN // begiig of architecture body... compoud tree: IF d > GENERATE IF L = 0 THEN the gate: xor GENERIC MAP( => ) PORT MAP(a => xor iput, z => temp out); tree ff: PROCESS(reset, clk, temp out) BEGIN IF reset = THEN output <= 0 ; ELSIF clk EVENT AND clk= THEN output <= temp out; END IF; END PROCESS tree ff; subtree array: FOR i IN 0 TO - GENERATE the subtree: tree GENERIC MAP(d => d-, =>, L => c, c => c) PORT MAP (iput => iput(i***(d-) TO (i+)***(d-)-), output => xor iput(i), clk => clk, reset => reset); END GENERATE subtree array; ELSE the gate2: xor GENERIC MAP( => ) PORT MAP(a => xor iput, z => output); subtree array2: FOR i IN 0 TO - GENERATE the subtree2: tree GENERIC MAP(d => d-, =>, L => L-, c => c) PORT MAP (iput => iput(i***(d-) TO (i+)***(d-)-), output => xor iput(i), clk => clk, reset => reset); END GENERATE subtree array2; END IF; END GENERATE compoud tree; END; // ed of architecture body L is used to determie if a particular level withi the tree should be latched. c is the umber of levels betwee latches mius oe. Whe L = 0, a D-flip-flop is created to hold the output of the XOR gate. Each sub-tree created for the levels above will have L mapped to c. For L > 0, the level is created almost idetically to the origial recursive code, except for the additioal geeric ad port mappigs. I this case, the sub trees are created with L mapped to L. This implemetatio ot oly allows for cotrol over the umber of pipelie stages withi the tree, but also where those stages are iserted. Chagig the value of L passed to the top level of the recursive tree will move the latches up or dow withi the tree. This would allow the fial result to be latched withi the tree or allow the last level(s) to be used ad the latched exterally of tree. c ca be adjusted to improve clock frequecy or overall latecy depedig o the implemetatio. Larger values of c will mea fewer pipelie stages with a lower clock frequecy. Smaller values would create more stages ad allow for a higher clock frequecy. IX. CONCLUSION As the developmet eviromet cotiues to call for shorter ad shorter cycles, auto-geeratio will become more ad more critical to successful product developmet. Moreover, the ability to geerate a dedicated solutio oly based o geeral parameters is of great iterest to a system that has FPGAs. The results obtaied with the sythesis of this flexible VHDL descriptio for both AMI-CMOS ad FPGAs are comparable to those created by traditioal ad optimized desig methods. The results show that automatic geeratio of polyomial basis multiplier i GF (2 ) is a quick, flexible ad efficiet alterative to traditioal desig. It was whe attemptig to pipelie the auto-geerated multiplier, that the real advatage of the recursive VHDL became apparet. The ability of recursio to more accurately model tree structures makes it clearly superior to cruder descriptios. Whe used effectively, recursio ca greatly improve the developmet of tree structures i VHDL. The test results we acquired i terms of delay versus area are promisig, ad we hope that this desig approach for autogeeratig multipliers i GF (2 ) ca still be improved to lead to better optimized desigs ad also to geerate ew ideas for other desigs. X. ACKNOWLEDGEMENTS The authors would like to ackowledge the partial support of NSF from the CAREER Grat CCR Computer Arithmetic Algorithms ad Scalable Hardware Desigs for Cryptographic Applicatios. REFERENCES [] S. B. Wicker ad V. K. Bhargava, Reed-Solomo Codes ad Their Applicatios. IEEE Press, New York. [2] E. D. Mastrovito, VLSI desigs for multiplicatio over fiite fields GF(2 m ), i Proceedigs of the 6th Iteratioal Coferece, o Applied Algebra, Algebraic Algorithms ad Error-Correctig Codes. Spriger- Verlag, 989, pp [3] IEEE P363, Stadard specificatios for public key cryptography, Draft 3, November 999, [4] B. Suar ad Ç. K. Koç, Mastrovito multiplier for all triomials, IEEE Tras. Comput., vol. 48, o. 5, pp , 999. [5] A. Halbutoğullari ad Çeti K. Koç, Mastrovito multiplier for geeral irreducible polyomials, IEEE Tras. Comput., vol. 49, o. 5, pp , [6] A. Reyhai-Masoleh ad M. A. Hasa, O low complexity bit parallel polyomial basis multipliers, i Cryptographic Hardware ad Embedded Systems, ser. Lecture Notes i Computer Sciece, No. 2779, C. D. Walter, Ç. K. Koç, ad C. Paar, Eds. Spriger, Berli, Germay, 2003, pp
6 [7] F. R. Heriquez, Research problem: Fully parallel multipliers for GF(2 m ), CINVESTAV-IPN #2508, adiaz/reccomp2003/rproblems.pdf. [8] P. J. Ashede, Recursive ad repetitive hardware models i VHDL, techical Report TR 60/2/93/ECE, Departmet of Electrical ad Computer Egieerig, Uiversity of Ciciati, also published as Techical Report 93-9, Departmet of Computer Sciece, The Uiversity of Adelaide, Australia. 6
Chapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationThe Simeck Family of Lightweight Block Ciphers
The Simeck Family of Lightweight Block Ciphers Gagqiag Yag, Bo Zhu, Valeti Suder, Mark D. Aagaard, ad Guag Gog Electrical ad Computer Egieerig, Uiversity of Waterloo Sept 5, 205 Yag, Zhu, Suder, Aagaard,
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationLecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationLecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 3 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationSoftware development of components for complex signal analysis on the example of adaptive recursive estimation methods.
Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationAlgorithm Design Techniques. Divide and conquer Problem
Algorithm Desig Techiques Divide ad coquer Problem Divide ad Coquer Algorithms Divide ad Coquer algorithm desig works o the priciple of dividig the give problem ito smaller sub problems which are similar
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationUNIVERSITY OF MORATUWA
UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationFPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea
FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset
More informationBehavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationVISUALSLX AN OPEN USER SHELL FOR HIGH-PERFORMANCE MODELING AND SIMULATION. Thomas Wiedemann
Proceedigs of the 2000 Witer Simulatio Coferece J. A. Joies, R. R. Barto, K. Kag, ad P. A. Fishwick, eds. VISUALSLX AN OPEN USER SHELL FOR HIGH-PERFORMANCE MODELING AND SIMULATION Thomas Wiedema Techical
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationGPUMP: a Multiple-Precision Integer Library for GPUs
GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationModule Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two
Give submodule mux32two: 2-to- MUX module mux32two (iput [3:] i,i, iput sel, output [3:] out); Module Istatiatio Fiite Machies esig methodology for sequetial logic -- idetify distict s -- create trasitio
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Single-Cycle Disadvantages & Advantages
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 4 The Processor Pipeliig Sigle-Cycle Disadvatages & Advatages Clk Uses the clock cycle iefficietly the clock cycle must
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More information1&1 Next Level Hosting
1&1 Next Level Hostig Performace Level: Performace that grows with your requiremets Copyright 1&1 Iteret SE 2017 1ad1.com 2 1&1 NEXT LEVEL HOSTING 3 Fast page loadig ad short respose times play importat
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationSearching a Russian Document Collection Using English, Chinese and Japanese Queries
Searchig a Russia Documet Collectio Usig Eglish, Chiese ad Japaese Queries Fredric C. Gey (gey@ucdata.berkeley.edu) UC Data Archive & Techical Assistace Uiversity of Califoria, Berkeley, CA 94720 USA ABSTRACT.
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationtop() Applications of Stacks
CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationAn Estimation of Distribution Algorithm for solving the Knapsack problem
Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationChapter 4 The Datapath
The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationDigital System Design
July, 22 9:55 vra235_ch Sheet umber Page umber 65 black chapter Digital System Desig a b c d e f g h 8 7 6 5 4 3 2. Bd3 g6+, Ke8 d8 65 July, 22 9:55 vra235_ch Sheet umber 2 Page umber 66 black 66 CHAPTER
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationGeneration of Distributed Arithmetic Designs for Reconfigurable Applications
Geeratio of Distributed Arithmetic Desigs for Recofigurable Applicatios Christophe Bobda, Ali Ahmadiia, Jürge Teich Uiversity of Erlage-Nuremberg Departmet of computer sciece Am Weichselgarte 3, 91058
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationDesign of Efficient Pipelined Radix-2 2 Single Path Delay Feedback FFT
IOSR Joural of VLSI ad Sigal Processig IOSR-JVSP Volume Issue Ver. I May-Ju. 0 PP 88-9 e-iss: 9 00 p-iss o. : 9 97 www.iosrjourals.org Desig of Efficiet Pipelied Radi- Sigle Path Delay Feedbac FFT isha
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationEfficient Hardware Design for Implementation of Matrix Multiplication by using PPI-SO
Efficiet Hardware Desig for Implemetatio of Matrix Multiplicatio by usig PPI-SO Shivagi Tiwari, Niti Meea Dept. of EC, IES College of Techology, Bhopal, Idia Assistat Professor, Dept. of EC, IES College
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationChapter 24. Sorting. Objectives. 1. To study and analyze time efficiency of various sorting algorithms
Chapter 4 Sortig 1 Objectives 1. o study ad aalyze time efficiecy of various sortig algorithms 4. 4.7.. o desig, implemet, ad aalyze bubble sort 4.. 3. o desig, implemet, ad aalyze merge sort 4.3. 4. o
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationComputer Systems - HS
What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic
More informationAnalysis of Documents Clustering Using Sampled Agglomerative Technique
Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based
More informationISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationAPPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview
APPLICATION NOTE Automated Gai Flatteig Scope ad Overview A flat optical power spectrum is essetial for optical telecommuicatio sigals. This stems from a eed to balace the chael powers across large distaces.
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationOperating System Concepts. Operating System Concepts
Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationn Explore virtualization concepts n Become familiar with cloud concepts
Chapter Objectives Explore virtualizatio cocepts Become familiar with cloud cocepts Chapter #15: Architecture ad Desig 2 Hypervisor Virtualizatio ad cloud services are becomig commo eterprise tools to
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationUsing the Keyboard. Using the Wireless Keyboard. > Using the Keyboard
1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More information