CUSTOM FPGA CRYPTOGRAPHIC BLOCKS FOR RECONFIGURABLE EMBEDDED NIOS PROCESSOR

Size: px
Start display at page:

Download "CUSTOM FPGA CRYPTOGRAPHIC BLOCKS FOR RECONFIGURABLE EMBEDDED NIOS PROCESSOR"

Transcription

1 CUSTO PGA CRYPTOGRAPHIC BLOCKS OR RECONIGURABLE EBEE NIOS PROCESSOR loš rutarovský, artn Šmka epartment of Electroncs and ultmeda Communcatons, aculty of Electrcal Engneerng and Informatcs, Techncal Unversty of Košce, Park Komenského 13, Košce, Slovak Republc, E-mal: {los.rutarovsky, artn.smka}@tuke.sk SUARY Ths paper ntroduces two custom blocks for Nos reconfgurable embedded processor mplemented on Altera eld Programmable Gate Arrays (PGAs). When operatons lke modular multplcaton and modular exponentaton of long ntegers or other complex algebrac functons are performed on a general-purpose processor they usually consume a lot of processor resources and executon tmes are not satsfactory. A soluton of ths problem les n development of custom coprocessors. The algebrac coprocessor for ontgomery ultplcaton () makes possble a fast executon of modular multplcaton wth large numbers that can be used n several publc key cryptographc algorthms. A True Random Number Generator (TRNG) enhances an applcaton of the Nos processor n cryptographc protocols. Untl now only few mplementatons of TRNG on PGA have been presented n lterature. We descrbe a custom TRNG mplementaton based on a recently proposed method that relably extracts ntrnsc randomness from low-jtter clock sgnals syntheszed by on-chp PGA analog PLLs. Both perpheral blocks are connected to the Nos processor through Altera Avalon bus that drectly supports scalable connecton and dfferent sources of the clock sgnal. In ths way we can optmally use the resources of Altera PGAs and mplement desgns customsable wth regard to avalable area resources and desred level of securty or tmng constrants. Proposed solutons sgnfcantly mprove securty and computatonal power of System on a Chp (SoC) embedded cryptographc applcatons based on the Nos processor. Keywords: cryptographc algorthm, SoC, embedded coprocessor, TRNG, IP blocks, ontgomery multplcaton 1. INROUCTION The recent rapd ncrease of the devces complexty and decreasng tme-to-market are forcng new ways of system desgn. Capable soluton of ths problem les n applcaton of System on a Chp (SoC) based on pre-desgned Intellectual Property (IP) cores and buldng blocks. IP blocks optmsed for target devces, and wth standardsed nterfaces offer fast soluton wthout need for longterm development of often-used parts of desgns. A cryptographc IP block ether executes whole cryptographc algorthms, or, as t s n our case, offers sgnfcant mprovement of computatonal power or securty level of the system. The coprocessor for ontgomery ultplcaton () enables a faster executon of large numbers of multplcaton needed for several cryptographc publc key algorthms. The True Random Number Generator (TRNG) enhances an applcaton of the Nos processor [1] n cryptographc protocols. Almost all cryptographc protocols requre generaton and use of secret values that must be unknown to attackers []. or example, TRNGs are requred to generate publc/prvate key pars for asymmetrc (publc key) algorthms ncludng RSA, SA, and ffe-hellman []. Unfortunately, standard processors (ncludng syntheszable Nos processor from Altera) are not able to generate true random numbers, as they are determnstc systems. The only way how to get true random numbers, hence true securty for cryptographc systems, s to buld a generator based on a random physcal phenomenon. Current modern eld Programmable Gate Arrays (PGAs) provde an alternatve hardware platform even for system-level ntegraton of embedded symmetrc and asymmetrc cryptographc algorthms, but not for hgh qualty TRNGs. ost hardware TRNGs follow unpredctable natural processes, such as thermal (resstance or shoot) nose or nuclear decay. Snce these prncples of random numbers generaton requre addtonal external devces, they cannot be embedded completely nsde the PGAs. Such TRNGs are not compatble wth modern PGAs and do not provde a SoC soluton. Ths paper descrbes a custom TRNG IP block based on a recently proposed method [3] that uses on-chp analog PLLs ncluded n Altera APEX PGAs [4]. The proposed method relably extracts ntrnsc randomness from low-jtter clock sgnals syntheszed by on-chp APEX analog PLLs. The TRNG s developed as a custom IP buldng block optmsed for Nos processor and provdes sgnfcantly hgher system level securty for complete embedded cryptographc SoC desgns. Publc key algorthms, such as RSA, ffe- Hellman key exchange algorthm or Ellptc curve cryptography use modular multplcaton and modular exponentaton of long ntegers (up to 048 bts for RSA). When these operatons are performed

2 8 Acta Electrotechnca et Informatca No. 1, Vol. 1, 001 on a general-purpose processor they consume a lot of tme and processor resources. A soluton of ths problem les n development of a custom coprocessor for modular long nteger multplcaton. Chosen algorthm provdes certan advantages n the mplementaton of modular multplcaton. The coprocessor has a scalable structure and uses effectvely the resources of PGA. Thanks to the mplementaton on PGA we can obtan a very flexble and secure soluton. The paper s organsed as follows: n Secton we present brefly the Nos processor and ts features mportant to nterface of the coprocessor and TRNG. In Secton 3 we gve a bref descrpton of the TRNG prncple and n Secton 4 the algorthm s presented. In the Secton 5 we deal wth a way of an mplementaton of the blocks and ther nterface to the Nos processor, mprovements of the coprocessor's structure, and speed and area results of mplementatons n Altera PGA devces. In the Secton 6 we present our conclusons and propose possble ways of future development.. AN OVERVIEW O EBEE NIOS PROCESSOR The Nos CPU [1] s a ppelned general-purpose RISC processor that s generated by propretary Altera VHL generator (SOPC Bulder) and can be synthessed and embedded n all recent Altera PGAs. The Nos supports both 3-bt and 16-bt archtectural varants. Both varants use 16-bt nstructons. The prncpal features of the Nos nstructon set archtecture are: Large, wndowed regster fle Nos mplementatons can nclude up to 51 nternal general-purpose regsters. The compler uses the nternal regsters to accelerate subroutne calls and local varable access. Smple, complete nstructon set both 3-bt and 16-bt Nos varants use 16-bt wde nstructons. 16-bt nstructons reduce code sze and nstructonmemory bandwdth. Powerful addressng modes the Nos nstructon set ncludes Load and Store nstructons that the compler uses to accelerate structure access and local-varable (stack) access. Extensblty users can ncorporate custom logc drectly nto the Nos arthmetc logc unt. The automatcally-generated software development kt ncludes macros for accessng custom nstructon hardware for C and assembly-language programs. Exstng Nos perpherals (e.g. UART, Tmer...) as well as new custom perpherals can be connected through an Avalon bus [5]. Avalon s a smple bus archtecture desgned for connectng on-chp processor(s) and perpheral together nto a SoC. The prncpal features of the Avalon bus are: Smplcty provdes an easy to understand protocol wth a short learnng curve. Optmzed resource utlzaton conserves Logc Elements (LEs) nsde the PGAs. Synchronous operaton ntegrates well wth other user logc that coexsts on the same PGA, whle avodng complex tmng analyss ssues. An example of a SoC structure wth user-defned custom perpherals s shown n g.1. Custom perpherals can be ncluded n a system block generated by SOPC Bulder what brngs optmsed mplementaton of the whole system, or they can be fed to Avalon bus as pre-synthessed blocks. The g. 1 depcts a smplfed clock dstrbuton, where s a prmary clock sgnal used for clockng of the 1 Nos and all of perpherals, and denotes addtonal clock sgnals whose functon s explaned later. data_rx data_tx ext 1 PLL SOPC Bulder System Block UART Custom perpheral Custom perpheral Custom perpheral Altera PGA g. 1 Example of a system module ntegrated wth custom perpherals nto an Altera PGA 3. BASIC PRINCIPLE O TRNG IP BLOCK Several well-known TRNGs requre addtonal off-chp component whch decreases a securty level of the system. In addton, some practcal mplementatons based on free runnng oscllators are not secure enough for cryptographc applcatons as the entropy ncrease s not suffcently hgh, so that the output of the generator can be predcted [6]. In next we shortly descrbe an mplementaton completely embedded n Altera PGAs [3]. odern Altera PGAs use reconfgurable analog on-chp PLLs to ncrease performance and to provde on-chp clock-frequency synthess. The basc prncple behnd our method s an extracton of a randomness from the jtter of the clock sgnal syntheszed n the embedded analog PLL [3] (llustrated n g.). PLL q(nt) XOR ecmator (K) x(nt) g. Basc prncple of randomness extracton from the low-jtter clock sgnal The jtter s detected by the samplng of a reference clock sgnal ( 1 n g. 1) wth

3 8 Acta Electrotechnca et Informatca No. 1, Vol. 1, 001 frequency usng ratonally related clock sgnal ( n g. 1) syntheszed n the PLL wth the frequency: K K where m and k can range from to 160, and n ranges from 1 to 16 [4]. Let values of multplcaton factor K and dvson factor K be relatve prmes, so GC( K, K where GC s an abbrevaton of Greatest Common vsor. Equaton () ensures that the maxmum guaranteed dstance between the closest edges of and (denoted as AX( T )) over the perod: mn T K K T (3) T s equal to [3]: σ jt m n k, (1) ) 1, () GC( K, K) AX( Tmn ) T 4K GC( K, K) T. 4K (4) By proper choosng of K, K and T t s possble to guarantee that AX( T ) < σ, where mn s the RS (root mean square) value of PLL ntrnsc jtter. Accordng to [7] and [8], an ntrnsc jtter can be approxmated by Gaussan dstrbuton and σ 15ps. oreover, the jt proposed method s nsenstve to an overall jtter characterstc as far as an ntrnsc PLL jtter s ncluded. In general, the obtaned bts are statstcally based random bts. Acceptable TRNG should produce output bts wth equal probablty. A common way how to reduce the statstcal bas s to use a XOR corrector. Non-overlapped pars of bts are XORed together. In ths way, a unform dstrbuton of generated true random bts wth perod T (3) s guaranteed [3]. 4. SCALABLE WOR-BASE ONTGOERY ULTIPLICATION ALGORITH jt E Z X mod, (5) that a bnary or general m -ary method can break nto a seres of modular multplcatons. All of these computatons have to be performed wth large k -bt ntegers (typcally k { 104, 048 }). The well-known algorthm [9] speeds-up modular multplcaton and squarng requred for exponentaton (5). It computes the product for k -bt ntegers X, Y as 1 ( X, Y) XYR mod, (6) where R k, and s an nteger n the range k 1 k < < such that GC ( R, ) 1. Basc (6) can be used for effcent computaton of (5) by the standard ontgomery exponentaton algorthm []. The startng pont of ths algorthm s the. The faster s performed, the faster exponentaton process wll be accomplshed. or mplementaton of on PGAs we use a modfed verson of ultple Word Radx- ontgomery ultplcaton (WR) algorthm [10]. WR wth word wdth w performs btlevel computatons and produces word-level outputs. The scalablty and word-orentaton of the algorthm makes possble to mplement the scalable coprocessor. or operands wth a k -bt precson, e k w words are requred. WR algorthm scans word-wse operand Y (multplcand) and, and bt-wse operand X (multpler). ependng on tmng requrements, area lmtatons and connected verson of Nos processor we can choose the word wdth w 8,16,3, 64 or descrpton of the WR algorthm we use the followng denomnatons: ( e 1) ( 1) ( 0) ( ),,,, ( e 1) ( 1) ( 0) Y ( Y,, Y, Y ), (7) X ( x,, x, x ). k The concatenaton of vectors A and B s represented as ( A, B ). A partcular range of bts n a vector A from poston to poston j s represented as th A. The bt poston of the k word j.. ( ) k of A s represented as A. Then a fragment of the WR algorthm can be descrbed as: Basc mathematcal operaton used by RSA s modular exponentaton []:

4 10 Acta Electrotechnca et Informatca No. 1, Vol. 1, 001 for 0 to k 1 do ( 0) ( 0) ( 0) ( CS, ) xy + S f ( 0) S0 1 then ( 0) ( 0) ( 0) ( CS, ) C+ S + for j 1 to e 1 do S ( j) ( j) ( j) ( j) ( CS, ) C+ xy + + S ( ) e ( C, Sw 1..1) ( j 1) ( j) ( j 1) 0, w 1..1 S S S ( e 1) ( 1) The computatons are performed wth precson w bts, what means that they are ndependent on the operands precson k. What vares s the number of loop teratons needed to compute the result of modular multplcaton. ue to the mutual dependency of the operatons nsde the j loop the parallel executon s not possble. Ths s not the case of the nstructons n dfferent loops whch can be executed n parallel. Ths fact makes possble to mplement even more flexble and faster scalable ppelned archtecture. 5. HARWARE APPING TO THE ALTERA PGA The Altera Nos Embedded Processor evelopment Board wth APEX EP0K00 [11] has been used for the mplementaton of the proposed IP blocks. The board and the provded software form powerful development tools for mplementaton and testng of the desgns. Thanks to the fact that the custom blocks are descrbed by VHL code we obtaned parametersed desgns that can be modfed accordng to the desred tme and area lmts. All presented results have been obtaned by usng the Altera uartus II ver.., Altera Nos., and PGA Advantage 5.3 tools TRNG The same Nos development board was also used n [8] for reference PLL measurements so we can expect that jtter characterstcs presented n [8] can be drectly appled to our desgn. The confguraton of the TRNG block s depcted n g.3. The board features a PLL-capable APEX EP0K00-X wth four on-chp analog PLLs. We used the same PLL organsaton as descrbed n the prevous desgn of TRNG [3], the values of parameters K and K were chosen accordng to the connecton of the TRNG to the Nos processor. The two on-chp PLLs shown n g.3 have been used for generatng and sgnals. The external clock source was 33.3Hz, on-chp syntheszed clocks were EXT Hz EXT 33.3 Hz PLL4 clk1 nclk clk0 PLL clk1 nclk clk0 80*14 EXT Hz 11* EXT EXT Hz Hz 4 edcated Clocks G4 G G1 G3 g. 3 Actual PLL confguraton used n the proposed TRNG IP block 33.3Hz and ( 110 / 3333) 11.9 Hz (can be modfed accordng to other requrements). Accordng to (4) these parameters ensure that AX( T ) 6.7 ps < σ. The output bt-rate of the TRNG s 1 / T bts/s. Example of resource requrements of 16-bt and 3-bt Nos wth correspondng 16-bt and 3-bt TRNG mplementatons are shown n Tab.1 (LE Logc Element s the basc buldng block of Altera PGAs). Name of the block # LEs % of total capacty Nos-16 Nos UART 170 TRNG-16 TRNG ALL ALL + nterface logc Tab. 1 Results of TRNG mappng to Altera APEX EP0K00-X TRNG nterface The TRNG perpheral s connected to Avalon bus as a standard memory mapped perpheral. TRNG can be accessed from the Nos processor through three custom regsters. ata (read only) and Control/Status regsters (wrte/read access) are mapped nto two memory locatons shown n g.4. read access TRNG_base+0 TRNG ata (data regster) TRN G_base+1 X X X... X X X C V (status regster) mn wrte access X X X... X X X IE (control regster) jt :3 V 1/0 - vald/nvald data C 1/0 - proper/mproper clocks IE1/0 - nterrupt enable/dsable X - undefned g. 4 ata and Control/Status regsters of 16-bt TRNG TRNG can be accessed by the standard memory poolng as well as by usng an nterrupt servce request that can be enabled by an applcaton program. The exact poston of a TRNG_base

5 8 Acta Electrotechnca et Informatca No. 1, Vol. 1, 001 address and TRNG_IR can be confgured by the SOPC Bulder TRNG statstcal testng Statstcal testng s very mportant for random number generators dedcated to usage n cryptographc algorthms. ore detaled descrpton of applyng NIST statstcal test sute [1] on presented TRNG can be found n [3]. Whle n [3] the generator s the only one block mplemented on the devce, n ths paper we present confguraton wth TRNG connected to the Nos processor. ore complex desgn and logc clocked by dfferent clock sources can affect the jtter dstrbuton. The am of tests was to detect possble devatons of statstcal characterstcs. After testng we have obtaned smlar results of statstcal tests as n [3]. Ths confrms the fact that the relablty of TRNG and the randomness of ts output are ndependent on the desgn complexty, PGA confguraton, and nternal crcut actvty. 5.. Scalable coprocessor The mplemented radx- coprocessor s a unt realzng the WR algorthm. Input values ( X,Y, and ) as well as the result S obtaned by the coprocessor are stored n coprocessor's memory. Snce nput and output values can have hgh precson (104 bts or more), we have decded to store nputs and ntermedate results n Embedded emory Blocks (EBs). EBs can mplement varous types of memory wth one block sze 048 bts [4]. Therefore, the coprocessor has been splt nto two blocks: a Radx- ontgomery multpler and a dual port data memory. In order to reduce storage and arthmetc hardware complexty, data path of the coprocessor uses X,Y, and n a standard nonredundant form. The nternal sum S s receved and generated n the redundant Carry-Save form [13]. Therefore, the bt resoluton of the sum S s effectvely doubled and we use denomnaton 1 S j and for t. Then 1 S represents the second bt th of the j word of the frst part of S (see g. 5). The advantage of Carry-Save form s faster addton process wthout usng the carry logc especally for w > 16. The data path desgn s based on the structure presented n [10]. The unt conssts of two layers of carry-save adders as t s shown n g. 5 for w 3. Input c represents latched value t that s S ( ) ( ) ( ) 0 0 the least sgnfcant bt of the value S + x Y and s used to control the addton of. The most mportant parameter nfluencng the overall multpler speed s the memory access tme. Snce durng one cycle prevous results 1 S and S g. 5 Structure of the unt for w 3 (A ull Adder) have to be read and current results from the last stage have to be wrtten to the same memory, we have chosen the EB confguraton as a dual port RA usng the Altera-specfc functon lpm_ram_dp from the Lbrary of Parameterzed odules (LP). The memory wth regstered nput/output data has been found as the faster mplementaton. The ppelned verson of the coprocessor has been mplemented usng changes publshed n [14]. The data path s organzed as a ppelned structure of several unts shown n g. 6. A dstrbuton of sgnal X to the unts has been found as a crtcal path n the tme analyss. Therefore ths part has been redesgned by addng an 1-bt regster for x nto the unt (see g. 6). Thanks to ths modfcaton there are no lmtatons for a number of unts as n [15]. g. 6 Block dagram of the coprocessor data path

6 1 Acta Electrotechnca et Informatca No. 1, Vol. 1, 001 The maxmum degree of parallelsm that can be obtaned wth ths archtecture s found as: asserted. Ths state perssts untl the results are read wthn the nterrupt routne by the processor. e k 104 k 048 nmax. (8) LEs f LEs clk f clk n The number n denomnator expresses the n number of clock cycles after whch the output of the n unt s vald. When less than n max unts are n avalable, the total executon tme wll ncrease, but on the other hand the area occupaton of the Tab. Area occupaton (LEs)/max f clk (Hz) coprocessor can be changed accordng to the area constrants of a target devce. The computaton tme of the coprocessor ( w 3, n 1..4 ) of the sngle operaton when n n max k 104 k 048 unts are used s: n n 1 k T + f clk wn n. (9) n n The coprocessor has 3 man parameters ( w, e, and n ) that can be changed accordng to the requred area of the mplemented coprocessor and the requred tmngs for computatons ( n, w ) or the securty level ( e ). Ths approach gves hgh flexblty to the processor and coprocessor desgn. Area occupaton expressed n LEs and maxmal possble PGA clock frequency for Altera APEX 0K00E are gven n Table for precsons k 104, and 048 bts. The coprocessor has the maxmal clock frequency sgnfcantly hgher than the Nos processor ( f Hz ). To acheve hgher performance of the system, we use one clock sgnal ( ) for the Nos processor, and another one ( f clk f clk Nos clk Nos ), wth hgher frequency, for the coprocessor. The computatonal tme (n µs) of the sngle operaton (accordng to the equaton 9) s presented n Table 3 for frequency value of the coprocessor clock sgnal f Hz. clk coprocessor nterface The way n whch the coprocessor s connected to the embedded processor s mportant for the computng process control (the process startng and the processor status checkng), and for an exchange of processed data. In the prevous soluton [15] the status regster has been used for checkng the actual status of the coprocessor and the computatonal process. The current verson uses the communcaton over an nterrupt. Ths soluton s more sutable for software control of coprocessors and for a confguraton wth several coprocessors that can be used for parallel computaton of. After the computaton of the nterrupt sgnal of the processor s Tab. 3 Computatonal tme T (µs) for w 3, f Hz, n 1..4 clk Thereafter new operands can be loaded nto the memory and the whole process starts agan. The second area where the most sutable soluton needs to be found s the nterface between the coprocessor's memory block and the bus of the embedded processor. Snce there s a need for faster clockng of the coprocessor, we have assumed the case wth two clock sgnals (see g. 7). g. 7 ext PLL SOPC Bulder System Block f clk f clknos Coprocessor Block dagram of the nterface between the coprocessor and the Nos processor The slower one s connected to the processor, and through the bus and the nterface to the coprocessor. All the processes concernng the operatons between the processor's bus and the coprocessor's memory block are clocked by ths sgnal ( ). The operatons nsde the f clk Nos coprocessor are clocked by the external faster clock sgnal ( ). Thanks to ths clock sgnals f clk organsaton almost three tmes hgher performance has been obtaned compared to the prevous mplementaton [15].

7 8 Acta Electrotechnca et Informatca No. 1, Vol. 1, CONCLUSIONS AN UTURE EVELOPENT The paper has demonstrated the possblty of custom IP blocks development for cryptographc applcatons n PGAs. Advancements n PGAs provde new optons for desgn engneers. PGAs mantan the advantages of custom functonalty, lke an ASIC, but avod hgh development costs and the nablty to make desgn modfcatons after productons. Implemented IP blocks enhance the applcablty of the Nos processor n a cryptographc SoC. Both blocks have scalable structure and hence create together wth the parametersable Nos processor very flexble soluton. A support for faster modular multplcaton and a need of true random numbers are functons requred for several currently used cryptographc protocols and algorthms Thanks to the changes n mplemented coprocessor we obtaned faster soluton wth optmsed features of the nterface. The fact that TRNG can be mplemented nsde the PGAs represents sgnfcant securty and system advantage n embedded cryptographc applcatons. The future development should nclude the mplementatons of other cryptographc algorthms and the mprovements of the presented blocks. REERENCES [1] NIOS. CPU. ata Sheet, September 00, ver. 1.3, pp. 1-14, [] J.A. enezes, P.C. Oorschot, and S.A. Vanstone: Handbook of Appled Cryptography, CRC Press, New York, [3] V. scher and. rutarovský: True Random Number Generator Embedded n Reconfgurable Hardware, Proceedngs of the Workshop on Cryptographc Hardware and Embedded Systems CHES 00, Redwood Shores, Calforna, USA, August 00, pp [4] APEX 0K Programmable Logc evce amly. ata Sheet, ebruary 00, ver. 4.3, pp , [5] Avalon Bus Specfcaton, Altera Reference anual, January 003, ver..1, pp , [6]. chtl: How to Predct the Output of a Hardware Random Number Generator, In C.. Walter, C. K. Koc, Ch. Paar (Eds.): Cryptographc Hardware and Embedded Systems 003, LNCS 779, Sprnger, Berln, 003, pp [7] Jtter comparson analyss: APEX 0KE PLL vs. Vrtex-E LL, Techncal Bref 70, January 001, ver.1.1, pp.1-7, [8] Superor Jtter management wth LLs. Vrtex Tech Topc VTT013(v1.), January 1, 00, pp. 1-6, [9] C.K. Koc, T. Acar: Analyzng and Comparng ontgomery ultplcaton Algorthms, IEEE cro, (16) 3, pp. 6-33, June [10] A.. Tenca, C.K. Koc: A Scalable Archtecture for odular ultplcaton Based on ontgomery s Algorthm, IEEE Transactons on Computers, 5(9), pp , September 003. [11] Nos Embedded Processor evelopment Board, Altera ata Sheet, v..1, Aprl 00, pp.1-, [1] A. Rukhn, et al.: A statstcal test sute for random and pseudorandom number generators for cryptographc applcatons, NIST Specal Publcaton 800-, ay 15, 001, pp , cs- [13] C.K. Koc: RSA Hardware Implementaton, pp.1-8, August [14]. rutarovský, V. scher: Implementaton of Scalable ontgomery ultplcaton Coprocessor n Altera Reconfgurable Hardware, Proceedngs of 5 th Internatonal Scentfc Conference SP CO 001, Košce, Slovaka, pp , November 001. [15]. Šmka, V. scher: ontgomery ultplcaton Coprocessor for Altera Nos Embedded Processor, Proceedngs of the 5 th Internatonal Scentfc Conference on Electronc Computers and Informatcs 00, Košce, Slovaka, pp , October 00. BIOGRAPHY loš rutarovský was born n 1965 n Prešov, Slovak Republc. He receved the Sc degree and Ph degree n radoelectroncs from the aculty of Electrcal Engneerng and Informatcs, Techncal Unversty of Košce, n 1988 and 1995, respectvely. He defended hs habltaton work - gtal Sgnal Processors n gtal Sgnal Processng n 000. He s currently workng as an assocated professor at the epartment of Electroncs and ultmeda Communcatons, Techncal Unversty of Košce. an areas of hs research are appled cryptography, dgtal sgnal processng, and algorthms for embedded cryptographc archtectures. artn Šmka was born n 1979 n Košce. He receved hs Sc. degree n Electroncs and Telecommuncatons n 00 after defendng hs aster's Thess - Concepton of connecton of embedded processor to arthmetc coprocessor n SOPC Altera. Currently he s a Ph student at the epartment of Electroncs and ultmeda Communcatons, Techncal Unversty of Košce and hs man research area s an mplementaton of cryptographc blocks on PGAs.

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Outline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011

Outline. Digital Systems. C.2: Gates, Truth Tables and Logic Equations. Truth Tables. Logic Gates 9/8/2011 9/8/2 2 Outlne Appendx C: The Bascs of Logc Desgn TDT4255 Computer Desgn Case Study: TDT4255 Communcaton Module Lecture 2 Magnus Jahre 3 4 Dgtal Systems C.2: Gates, Truth Tables and Logc Equatons All sgnals

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

RADIX-10 PARALLEL DECIMAL MULTIPLIER

RADIX-10 PARALLEL DECIMAL MULTIPLIER RADIX-10 PARALLEL DECIMAL MULTIPLIER 1 MRUNALINI E. INGLE & 2 TEJASWINI PANSE 1&2 Electroncs Engneerng, Yeshwantrao Chavan College of Engneerng, Nagpur, Inda E-mal : mrunalngle@gmal.com, tejaswn.deshmukh@gmal.com

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Conditional Speculative Decimal Addition*

Conditional Speculative Decimal Addition* Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

The stream cipher MICKEY-128 (version 1) Algorithm specification issue 1.0

The stream cipher MICKEY-128 (version 1) Algorithm specification issue 1.0 The stream cpher MICKEY-128 (verson 1 Algorthm specfcaton ssue 1. Steve Babbage Vodafone Group R&D, Newbury, UK steve.babbage@vodafone.com Matthew Dodd Independent consultant matthew@mdodd.net www.mdodd.net

More information

Assembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.

Assembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface. IDC Herzlya Shmon Schocken Assembler Shmon Schocken Sprng 2005 Elements of Computng Systems 1 Assembler (Ch. 6) Where we are at: Human Thought Abstract desgn Chapters 9, 12 abstract nterface H.L. Language

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Mallathahally, Bangalore, India 1 2

Mallathahally, Bangalore, India 1 2 7 IMPLEMENTATION OF HIGH PERFORMANCE BINARY SQUARER PRADEEP M C, RAMESH S, Department of Electroncs and Communcaton Engneerng, Dr. Ambedkar Insttute of Technology, Mallathahally, Bangalore, Inda pradeepmc@gmal.com,

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Floating-Point Division Algorithms for an x86 Microprocessor with a Rectangular Multiplier

Floating-Point Division Algorithms for an x86 Microprocessor with a Rectangular Multiplier Floatng-Pont Dvson Algorthms for an x86 Mcroprocessor wth a Rectangular Multpler Mchael J. Schulte Dmtr Tan Carl E. Lemonds Unversty of Wsconsn Advanced Mcro Devces Advanced Mcro Devces Schulte@engr.wsc.edu

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

FPGA Based Fixed Width 4 4, 6 6, 8 8 and Bit Multipliers using Spartan-3AN

FPGA Based Fixed Width 4 4, 6 6, 8 8 and Bit Multipliers using Spartan-3AN IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.11 No.2, February 211 61 FPGA Based Fxed Wdth 4 4, 6 6, 8 8 and 12 12-Bt Multplers usng Spartan-3AN Muhammad H. Ras and Mohamed H.

More information

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Newton-Raphson division module via truncated multipliers

Newton-Raphson division module via truncated multipliers Newton-Raphson dvson module va truncated multplers Alexandar Tzakov Department of Electrcal and Computer Engneerng Illnos Insttute of Technology Chcago,IL 60616, USA Abstract Reducton n area and power

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6) Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst

More information

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood

A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING. James Moscola, Young H. Cho, John W. Lockwood A RECONFIGURABLE ARCHITECTURE FOR MULTI-GIGABIT SPEED CONTENT-BASED ROUTING James Moscola, Young H. Cho, John W. Lockwood Dept. of Computer Scence and Engneerng Washngton Unversty, St. Lous, MO {jmm5,

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

CPE 628 Chapter 2 Design for Testability. Dr. Rhonda Kay Gaede UAH. UAH Chapter Introduction

CPE 628 Chapter 2 Design for Testability. Dr. Rhonda Kay Gaede UAH. UAH Chapter Introduction Chapter 2 Desgn for Testablty Dr Rhonda Kay Gaede UAH 2 Introducton Dffcultes n and the states of sequental crcuts led to provdng drect access for storage elements, whereby selected storage elements are

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Specifications in 2001

Specifications in 2001 Specfcatons n 200 MISTY (updated : May 3, 2002) September 27, 200 Mtsubsh Electrc Corporaton Block Cpher Algorthm MISTY Ths document shows a complete descrpton of encrypton algorthm MISTY, whch are secret-key

More information

Resource Efficient Design and Implementation of Standard and Truncated Multipliers using FPGAs

Resource Efficient Design and Implementation of Standard and Truncated Multipliers using FPGAs Proceedngs of the World Congress on Engneerng 2011 Vol II, July 6-8, 2011, London, U.K. Resource Effcent Desgn and Implementaton of Standard and Truncated Multplers usng FPGAs Muhammad H. Ras, Member,

More information

Rapid Development of High Performance Floating-Point Pipelines for Scientific Simulation 1

Rapid Development of High Performance Floating-Point Pipelines for Scientific Simulation 1 Rapd Development of Hgh Performance Floatng-Pont Ppelnes for Scentfc Smulaton 1 G. Lenhart, A. Kugel and R. Männer Dept. for Computer Scence V, Unversty of Mannhem, B6-26B, D-68131 Mannhem, Germany {lenhart,kugel,maenner}@t.un-mannhem.de

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning

Parallel Inverse Halftoning by Look-Up Table (LUT) Partitioning Parallel Inverse Halftonng by Look-Up Table (LUT) Parttonng Umar F. Sddq and Sadq M. Sat umar@ccse.kfupm.edu.sa, sadq@kfupm.edu.sa KFUPM Box: Department of Computer Engneerng, Kng Fahd Unversty of Petroleum

More information

A New Memory Reduced Radix-4 CORDIC Processor For FFT Operation

A New Memory Reduced Radix-4 CORDIC Processor For FFT Operation IOSR Journal of VLSI and Sgnal Processng (IOSR-JVSP) Volume, Issue 5 (May. Jun. 013), PP 09-16 e-issn: 319 400, p-issn No. : 319 4197 www.osrjournals.org A New Memory Reduced Radx-4 CORDIC Processor For

More information

An Optimized Pseudorandom Generator using Packed Matrices

An Optimized Pseudorandom Generator using Packed Matrices An Optmzed Pseudorandom Generator usng Packed Matrces JOSE-VICENTE AGUIRRE 1, RAFAEL ÁLVAREZ, LEANDRO TORTOSA 3, ANTONIO ZAMORA 4 Dpt. of Computer Scence and Artfcal Intellgence Unversty of Alcante Campus

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

An Efficient Algorithm for PC Purchase Decision System

An Efficient Algorithm for PC Purchase Decision System Proceedngs of the 6th WSAS Internatonal Conference on Instrumentaton, Measurement, Crcuts & s, Hangzhou, Chna, Aprl 15-17, 2007 216 An ffcent Algorthm for PC Purchase Decson Huay Chang Department of Informaton

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Configuration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*

Configuration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations* Confguraton Management n Mult-Context Reconfgurable Systems for Smultaneous Performance and Power Optmzatons* Rafael Maestre, Mlagros Fernandez Departamento de Arqutectura de Computadores y Automátca Unversdad

More information

FPGA-based implementation of circular interpolation

FPGA-based implementation of circular interpolation Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 04, 6(7):585-593 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 FPGA-based mplementaton of crcular nterpolaton Mngyu Gao,

More information

A SCALABLE DIGITAL ARCHITECTURE OF A KOHONEN NEURAL NETWORK

A SCALABLE DIGITAL ARCHITECTURE OF A KOHONEN NEURAL NETWORK A SCALABLE DIGITAL ARCHITECTURE OF A KOHONEN NEURAL NETWORK Andrés E. Valenca, Jorge A. Peña and Maurco Vanegas. Unversdad Pontfca Bolvarana, Medellín, Colomba andrez_valenca@yahoo.com, jorge.pena@alar.ch,

More information

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

Lecture 3: Computer Arithmetic: Multiplication and Division

Lecture 3: Computer Arithmetic: Multiplication and Division 8-447 Lecture 3: Computer Arthmetc: Multplcaton and Dvson James C. Hoe Dept of ECE, CMU January 26, 29 S 9 L3- Announcements: Handout survey due Lab partner?? Read P&H Ch 3 Read IEEE 754-985 Handouts:

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Area Efficient Self Timed Adders For Low Power Applications in VLSI

Area Efficient Self Timed Adders For Low Power Applications in VLSI ISSN(Onlne): 2319-8753 ISSN (Prnt) :2347-6710 Internatonal Journal of Innovatve Research n Scence, Engneerng and Technology (An ISO 3297: 2007 Certfed Organzaton) Area Effcent Self Tmed Adders For Low

More information

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB

SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB SURFACE PROFILE EVALUATION BY FRACTAL DIMENSION AND STATISTIC TOOLS USING MATLAB V. Hotař, A. Hotař Techncal Unversty of Lberec, Department of Glass Producng Machnes and Robotcs, Department of Materal

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Cracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm

Cracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State Unversty,

More information

Solution Brief: Creating a Secure Base in a Virtual World

Solution Brief: Creating a Secure Base in a Virtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Abstract The adopton rate of Vrtual Machnes has exploded at most organzatons, drven by the mproved

More information

A fair buffer allocation scheme

A fair buffer allocation scheme A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres

More information

Using Delayed Addition Techniques to Accelerate Integer and Floating-Point Calculations in Configurable Hardware

Using Delayed Addition Techniques to Accelerate Integer and Floating-Point Calculations in Configurable Hardware Draft submtted for publcaton. Please do not dstrbute Usng Delayed Addton echnques to Accelerate Integer and Floatng-Pont Calculatons n Confgurable Hardware Zhen Luo, Nonmember and Margaret Martonos, Member,

More information

Random Kernel Perceptron on ATTiny2313 Microcontroller

Random Kernel Perceptron on ATTiny2313 Microcontroller Random Kernel Perceptron on ATTny233 Mcrocontroller Nemanja Djurc Department of Computer and Informaton Scences, Temple Unversty Phladelpha, PA 922, USA nemanja.djurc@temple.edu Slobodan Vucetc Department

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Analysis of Min Sum Iterative Decoder using Buffer Insertion

Analysis of Min Sum Iterative Decoder using Buffer Insertion Analyss of Mn Sum Iteratve ecoder usng Buffer Inserton Saravanan Swapna M.E II year, ept of ECE SSN College of Engneerng M. Anbuselv Assstant Professor, ept of ECE SSN College of Engneerng S.Salvahanan

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

DLK Pro the all-rounder for mobile data downloading. Tailor-made for various requirements.

DLK Pro the all-rounder for mobile data downloading. Tailor-made for various requirements. DLK Pro the all-rounder for moble data downloadng Talor-made for varous requrements www.dtco.vdo.com Smply brllant, brllantly smple Always the rght soluton The DLK Pro s the VDO product famly, whch sets

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

CHAPTER 4 PARALLEL PREFIX ADDER

CHAPTER 4 PARALLEL PREFIX ADDER 93 CHAPTER 4 PARALLEL PREFIX ADDER 4.1 INTRODUCTION VLSI Integer adders fnd applcatons n Arthmetc and Logc Unts (ALUs), mcroprocessors and memory addressng unts. Speed of the adder often decdes the mnmum

More information

A Time-Bound Ticket-Based Mutual Authentication Scheme for Cloud Computing

A Time-Bound Ticket-Based Mutual Authentication Scheme for Cloud Computing Int. J. of Computers, Communcatons & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. VI (2011), No. 2 (June), pp. 227-235 A Tme-Bound Tcket-Based Mutual Authentcaton Scheme for Cloud Computng Z. Hao, S.

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems

An Efficient Garbage Collection for Flash Memory-Based Virtual Memory Systems S. J and D. Shn: An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems 2355 An Effcent Garbage Collecton for Flash Memory-Based Vrtual Memory Systems Seunggu J and Dongkun Shn, Member,

More information

THE low-density parity-check (LDPC) code is getting

THE low-density parity-check (LDPC) code is getting Implementng the NASA Deep Space LDPC Codes for Defense Applcatons Wley H. Zhao, Jeffrey P. Long 1 Abstract Selected codes from, and extended from, the NASA s deep space low-densty party-check (LDPC) codes

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub

More information

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Simple March Tests for PSF Detection in RAM

Simple March Tests for PSF Detection in RAM Smple March Tests for PSF Detecton n RAM Ireneusz Mroze Balysto Techncal Unversty Computer Scence Department Wejsa 45A, 5-35 Balysto POLAND mroze@.pb.balysto.pl Eugena Buslowsa Balysto Techncal Unversty

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information