A High-Quality, Energy Optimized, Real-Time Sampling Rate Conversion Library for the StrongARM Microprocessor
|
|
- Tobias Garrison
- 5 years ago
- Views:
Transcription
1 A Hgh-Qualty, Energy Optmzed, Real-Tme Samplng Rate Converson Lbrary for the StrongARM Mcroprocessor Chung-Tse Mar 1, Mat C. Hans, Mark T. Smth, Tajana Smunc, Ronald W. Schafer 1 Moble& Meda Systems Laboratory HP Laboratores Palo Alto HPL June 3 rd, 2002* dgtal sgnal processng, sample rate converson, audo, StrongARM, Ths paper presents a dgtal audo samplng rate converson lbrary that converts between arbtrary samplng frequences. The lbrary s mplemented as a tme-varyng fractonal delay flter wth coeffcents stored n a lookup table. It s desgned for use by realtme applcatons and optmzed for executon on Intel's StrongARM mcroprocessor. * Internal Accesson Date Only Approved for External Publcaton 1 Center for Sgnal & Image Processng, Georga Insttute of Technology, Atlanta, GA Copyrght Hewlett-Packard Company 2002
2 A Hgh-Qualty, Energy Optmzed, Real-Tme Samplng Rate Converson Lbrary for the StrongARM Mcroprocessor Chung-Tse Mar, Mat C. Hans, Mark T. Smth, Tajana Smunc, Ronald W. Schafer * Abstract Ths paper presents a dgtal audo samplng rate converson lbrary that converts between arbtrary samplng frequences. The lbrary s mplemented as a tme-varyng fractonal delay flter wth coeffcents stored n a lookup table. It s desgned for use by real-tme applcatons and optmzed for executon on Intel s StrongARM mcroprocessor. 1. Introducton Many dfferent samplng rates are used n today s dgtal sgnal processng applcatons. Telephone systems sample speech at 8 khz, khz s used for AM-rado qualty audo, and 44.1 khz s the standard for CD qualty dgtal musc. The problem of convertng between dfferent samplng rates has been dscussed n numerous papers and books, and dfferent methods have been proposed n [1]-[5]. The proposed samplng rate converson lbrary s targeted for processng blocks of audo data n real-tme applcatons. It s mplemented wth a tme-varyng fractonal delay flter that s controlled usng a lookup table to convert between arbtrary rates. The lbrary optmzaton has been performed wth the energy proflng tools presented n [6] for Intel s StrongARM SA-110 mcroprocessor. The motvaton for ths project s dscussed n Secton 2; the theory descrpton s gven n Secton 3; the desgn and mplementaton of the lbrary s descrbed n Secton 4; test results are n Secton 5; optmzaton s dscussed n Secton 6. The lbrary API s gven n the Appendx. 2. Motvaton The motvaton for mplementng a samplng rate converson lbrary came from workng wth the audo on the SmartBadge IV [7]. The SmartBadge IV s the next-generaton contextaware devce from Hewlett-Packard Laboratores. It s controlled by Intel s StrongARM SA processor and a StrongARM SA-1111 companon chp. In addton to the processors, the Badge has on chp memory (FLASH and RAM), Phlps UDA-1341 audo codec and varous onboard sensors. * Chung-Tse Mar and Ronald W. Schafer are wth the Center for Sgnal & Image Processng, Georga Insttute of Technology, Atlanta, Georga. Mat C. Hans, Mark T. Smth, and Tajana Smunc are wth the Applance Platforms Department, Hewlett-Packard Laboratores, Palo Alto, CA. 1
3 One challenge wth dgtal audo on ths research platform prototype s the rate at whch the UDA-1341 codec samples the audo at both playback and recordng. The codec on the SmartBadge IV does not have a dedcated clock; nstead t uses the clock sgnal from the StrongARM. Ths wll produce slght devatons from the standard samplng rates llustrated n Table 1. Table 1 Dfferences n Samplng Rates on the SmartBadge IV Ideal Samplng Frequency Actual Samplng Frequency 8.0 khz khz khz khz 32.0 khz 44.1 khz 8.0 khz khz khz khz 31.2 khz 43.2 khz Real-tme samplng rate converson must be done on both the audo nput and put to record and play hgh qualty audo, avodng dstorton and possble over or under-flow n real-tme communcaton applcaton. Dfferent methods for samplng rate converson are dscussed n Secton 3. Energy consumpton and power dsspaton are crtcal to portable systems lke the SmartBadge IV. System s energy consumpton dctates ts battery lfe. Whle mcroprocessors have become smaller and more powerful, the same advances have not been made by batteres. As a result, engneers need to explctly desgn both hardware and software of portable systems for low energy consumpton. The samplng rate converson lbrary proposed n ths paper s optmzed for executon on the StrongARM processor used by the SmartBadge IV. The optmzaton s summarzed n Secton Theory of Operaton Samplng rate converson s a problem of nterpolatng a sgnal at non-nteger multples of the orgnal samplng perod. Ths may also be vewed as delayng the sgnal by a tmevaryng fractonal amount as demonstrated n Fgure 1, for a rate converson of a sgnal wth samplng perod, T n, to a new perod, T. Fgure 1 Delayng the sgnal by a tme-varyng fractonal amount x[n] T n y[n] T Tme d d 1 d 2 3 2
4 To calculate each samples of the put, y [n], the nput, x [n], must be delayed by fractonal amounts, d, of the orgnal samplng perod. Delayng a sgnal by d corresponds to j d a multplcaton by the complex exponental, e ω, n the frequency doman. Ths may be acheved by a system wth the frequency response: H jω jωd ( e ) = e, for all ω (1) whch corresponds to an all-pass flter. For use n samplng rate converson, a bandlmtng factor must be added to prevent alasng f the nput rate, F n, s hgher than the put rate, F. Specfcally, the converson requres a set of flters, known as fractonal delay flters: H jω jωd ( e ) = e, for 0 ω mn( π, ) πf (2) F n The correspondng mpulse response of these flters, h [n], may be calculated to be: where γ s a bandlmtng factor computed as: sn[ γπ( n d)] h[ n] =, for all n, (3) π( n d ) F γ = mn( 1, ) (4) F The mpulse response s a delayed snc functon of nfnte length. Dfferent methods exst for approxmatng ths unrealzable system wth a causal flter of fnte length. A detaled analyss may be found n [8]. Several dfferent rate converson methods were consdered for use n ths lbrary. They dffer n the method used to desgn the fractonal delay flters. The method proposed n [3] uses B-splne functons. [5] uses the Farrow polynomal approxmaton proposed n [9]. In both cases, the flter coeffcents are low-order polynomal functons of the delay: n N h n 1 ] = cn k= 0 k [ [ k] d (5) where N s the order of the polynomal used to approxmate each flter coeffcent. The coeffcents may be easly updated for an arbtrary delay at run-tme as the nput s beng fltered. Ths s effcent only f the flter length s kept very short. For processng of hgh qualty audo, the nput sgnal must frst be upsampled by some factor n order for the short varable-delay flter to generate accurate puts. Ths method s feasble for a fxed converson factor, F F, but n 3
5 t may get complex f the converson factor s to be made flexble because the coeffcents, c n [k], n (5) must be recomputed to approxmate a flter response wth a dfferent cutoff frequency. The method proposed n [4] does not requred upsamplng of the nput. It uses the wndow method for flter desgn [10], where the flter coeffcents are computed as: h n] = w( n d )snc[ γ ( n d )] for n = 1... N, (6) [ where w (n) s the wndow functon, γ s the bandlmtng factor computed n (4), and N s the length of the flter. Commonly used wndow functons nclude the Kaser wndow and the Dolph-Chebyshev wndow. Snce calculatng snc and wndow functons for arbtrary delays at run-tme s too computatonally expensve, a lookup table may be used. Interestngly, for a gven factor of converson, F Fn, the total number of dfferent delays, d, s fnte. The delays also vary perodcally durng the converson. Suppose that ths factor may be reduced to the an ntegral fracton, R Rn. The delays, d, may be computed as: where = 0,1, ( R 1) R n Rn d = (7) R R, and x denotes the largest nteger less than or equal to x. Observe that 0 d < 1. A table of flters correspondng to the set of R delays for a partcular factor of converson may be pre-computed. The number of elements n the flter table s equal to R N, where N s the flter length. For example, when convertng 44.1 khz to 48 khz, we may use R n = 147 and R = 160, there are 160 put samples for 147 nput samples, and a total of 160 dfferent delays to be calculated. If a flter length of 65 s used wth 16-bt resoluton for each coeffcent, the lookup table would requre 20 Kbytes of memory. An mportant pont to note s that the flter must be operated at the put samplng rate. Ths can be acheved by shftng the nput samples by a tme-varyng number of samples, s, nto the flter s delay lne: The put s calculated usng: R n Rn s = ( 1) (8) R R N 1 k = 0 y [ n] = h ( k) x( n + s k) (9) where the varable ndexes the partcular flter coeffcents and shft values to use. It s perodc and s equal to n mod R. The lookup table method s hghly effcent snce the coeffcents are only computed once. On the other hand, dfferent tables are needed for dfferent rates, and for some factors of 4
6 converson, n whch R s a large number, the table may take up more than 100 Kbytes of memory. A more flexble method s proposed n [2]. A low-pass flter wth an arbtrary delay may be computed by lnearly nterpolatng an over-sampled and wndowed snc functon. To llustrate how ths may be done, suppose the wndowed snc functon wth zero delay s represented as h [n], ths s oversampled by a factor, L, to produce: h oversampled n [ n] = h[ ] (10) L Ths oversampled functon can be computed beforehand and stored nto a header fle to be compled wth the lbrary code. To calculate h [n] for the delay d : oversampled h [ n] = h[ n d ] = h [ nl d L] (11) As n (7), 0 d < 1, and d L usually wll not be an nteger. But f L s large enough, lnear nterpolatng between the oversampled coeffcents wll produce accurate estmates for h[ n d]. Detals on how ths s done wth fxed pont numbers and an analyss on the sze requrement of L may be found n [2]. Ths s the method employed n ths lbrary. The flter coeffcents may ether be computed at run-tme wth mnmum overhead (one multplcaton and one addton for each coeffcent), or they may be computed and stored n a lookup table. Ths lbrary offers the user both optons, but the lookup table should be used f possble because of the sgnfcant reducton n computatonal complexty (see Secton 5). 4. Lbrary Desgn and Implementaton The samplng rate converson s mplemented as a tme-varyng FIR flter n our lbrary. The flter coeffcents may be ether pre-computed and stored n a lookup table, or computed at run-tme by lnearly nterpolatng an oversampled flter response. The desgn of the lbrary s smlar to the block FIR flterng functons n Intel s Integrated Performance Prmtves Lbrary [11]. The lbrary can be used both to process large chunks of data as a whole and small blocks of data wth repeated lbrary calls; such s the case when streamng audo over the Internet n real-tme. To avod transent flter response between contguous blocks of data, the nternal state of the system should be mantaned. Ths ncludes the ndex of the partcular flter coeffcents to use and some nput samples at the end of a block. If the system s ntalzed at the start of each new block to the state that was reached at the end of the prevous block, then a steady-state flter response s mantaned. A dagram of the samplng rate converson system as mplemented n the lbrary s shown n Fgure 2. 5
7 Fgure 2 Block dagram of samplng rate converson system. Interleaved Stereo Audo Input Channel 1 buffer Shft Delay Control Shft Channel 2 buffer Index Tme -Varyng FIR Flter Coeffcents Lookup Table Coeffcents Tme -Varyng FIR Flter Interleaved Stereo Audo Output A block of nterleaved stereo data s frst separated nto two buffers nternal to the lbrary. The delay control element s mplemented as a table contanng the possble shft values as calculated n (8). It controls how many nput samples should be shfted nto the flter and whch set of coeffcents s to be used. The put s calculated followng (9). The resultng effect s a tme-varyng flter operatng at the put samplng frequency. To avod transent response at the end of a block, some nput samples are saved n the nternal buffers untl the next lbrary call. A flush rne s provded n the lbrary for transent response calculaton. 5. Tests Results The lbrary was tested usng both natural audo sgnals and computer generated sne waves. The converson from 44.1 khz to 48 khz and khz wll be llustrated here as examples. The test nput sgnal used s a sum of two snusods wth the frequences 4 khz and 16 khz; t was generated usng 16-bts of resoluton. Its spectrum s plotted n Fgure 3. Fgure 3. Spectrum of nput sgnal sampled at 44.1 khz. 6
8 The nput was resampled to 48 khz usng the samplng rate converson lbrary, and the put spectrum s shown n Fgure 4. Fgure 4. Spectrum of put sgnal resampled to 48 khz. Most dstortons generated by the converson are 80 db below the sgnal level. The converson was repeated for an put rate of khz, and the result s shown n Fgure 5. Fgure 5. Spectrum of put sgnal resampled to khz. As expected, the frequency component above 11 khz has been elmnated by the bandlmtng factor n the nterpolaton flters. The dstortons are stll mostly 80 db below the sgnal level. 7
9 6. Optmzaton The fxed-pont samplng rate converson mplementaton code [12] for the method proposed n [2] was used as a startng pont for the lbrary mplementaton. It was modfed to ft the lbrary specfcatons and optmzed for executon on the Hewlett-Packard Laboratores SmartBadge portable devce. Optmzaton was done manually n the ARM Software Development Toolkt (SDT) [13] wth the gudance of the cycle-accurate energy profler proposed n [6] and the applcaton notes publshed by ARM [14]. At the mplementaton level, many trcks from [14] were used to optmze the code. They ncluded, among others, condtonal executon, functon nlnng, and effcent regster allocaton. Two other major modfcatons are dscussed below. Stereo audo s usually stored as nterleaved 16-bt ntegers, but for samplng rate converson, each channel must be processed separately. In the orgnal code, the separaton was done by the user applcaton, and two lbrary calls must be made, one for each channel. Ths ntroduces redundances. To process stereo data more effcently, the channel separaton was moved nsde of the lbrary, such that a sngle lbrary call s used for converson. Addtonally, a lookup table for the flter coeffcents was added to the orgnal code to elmnate the calculaton of the coeffcent at run-tme. On the other hand, t requres an ntalzaton functon to comple the flter table. The result of the optmzaton s summarzed n Table 2. Table 2 Performance and Energy for Samplng Rate Converson Implementatons, 44.1 khz to 48 khz Performance Energy (mwhr) Code Revson Total Cycles (%Reducton) Processor Memory Total Battery (%Reducton) Orgnal [12] (0%) 1.10E E E-02 (0%) Optmzed (39%) 1.02E E E-02 (10%) Optmzed wth Lookup Table (64%) 6.89E E E-02 (37%) The above data were collected from the energy profler, whch was confgured for the StrongARM-110 processor usng 1 MB of Flash memory and 2 MB of SRAM. The StrongARM SA-1110 processor on the SmartBadge IV s not yet supported by the ARM SDT, so the SA-110 s used nstead for the smulaton. To generate the data, the lbrary was used to convert fve seconds of stereo audo recorded at 44.1 khz to 48 khz n blocks of 1024 samples usng a 13-tap flter. Smlar reductons may be found n the down-samplng converson from 44.1 khz to 8 khz shown n Table 3. Table 3 Performance and Energy for Samplng Rate Converson Implementatons, 44.1 khz to 8 khz Performance Energy (mwhr) Code Revson Total Cycles (%Reducton) Processor Memory Total Battery (%Reducton) Orgnal [12] (0%) 8.00E E E-02 (0%) Optmzed (38%) 6.31E E E-02 (23%) Optmzed wth Lookup Table (61%) 5.94E E E-02 (25%) 8
10 These results are overall lower than those n Table 2 because the down-samplng put data length s much shorter. The reductons may be even more dramatc f the flter length was ncreased to 65 as n Table 4. Table 4 Performance and Energy for Samplng Rate Converson Implementatons, 44.1 khz to 8 khz Performance Energy (mwhr) Code Revson Total Cycles (%Reducton) Processor Memory Total Battery (%Reducton) Orgnal [12] (0%) 7.39E E E+00 (0%) Optmzed (44%) 3.82E E E+00 (48%) Optmzed wth Lookup Table (90%) 5.06E E E-01 (93%) The ncreased savngs are manly due to the large overhead n calculatng 65 coeffcents at runtme that s avoded by usng a lookup table. References [1] R. E. Crochere and L. R. Rabner, Multrate Dgtal Sgnal Processng. Englewood Clffs, NJ: Prentce-Hall, [2] J. O. Smth and P. Gosset, A flexble samplng-rate converson method, n Proc. IEEE Int. Conf. Acoustc Speech Sgnal Processng, vol.2, pp , [3] S. Cucch, F. Desnan, G. Parlador, and G. Scuranza, DSP Implementaton of Arbtrary Samplng Frequency Converson for Hgh Qualty Sound Applcaton, Int. Conf. Acoustc Speech Sgnal Processng, vol. 5, pp , [4] S. Park, G. Hllman, and R. Robles, A Novel Structure for Real-Tme Dgtal Sample-Rate Converters wth Fnte Precson Error Analyss, Int. Conf. Acoustc Speech Sgnal Processng, vol. 5, pp , [5] K. Rajaman, Y. La, and C. W. Farrow, An Effcent Algorthm for Sample Rate Converson from CD to DAT, IEEE Sgnal Processng Letters, vol. 7, no. 10, October, pp , [6] T. Smunc, L. Benn, and G. De Mchel, Energy-Effcent Desgn of Battery-Powered Embedded Systems, IEEE Transactons on VLSI Systems, vol. 9, February, pp , More nformaton: [7] M. T. Smth and G. Q. Magure Jr., SmartBadge/BadgePad verson 4, HP Labs and Royal Insttute of Technology (KTH), date of access [8] T. I. Laakso, V. Valmak, M. Karjalanen, and U. K. Lane, Splttng the Unt Delay, IEEE Sgnal Processng Magazne, vol. 13, January, pp , [9] C. W. Farrow, A contnuously varable dgtal delay element, n Proc. IEEE Int. Symp. Crcuts Syst., vol. 3, pp , [10] A. V. Oppenhem, R. W. Schafer, and J. R. Buck, Flter Desgn Technques, Chap. 7 n Dscrete-Tme Sgnal Processng. Upper Saddle Rver, NJ: Prentce-Hall, [11] Intel Corporaton, Intel Integrated Performance Prmtves for the Intel StrongARM SA Mcroprocessor Reference Manual, verson 1.01,
11 [12] Julus Smth, Samplng Rate Converson Program Verson 1.6, Avalable: [13] Advanced RISC Machnes Ltd (ARM), ARM Software Development Toolkt Verson 2.11, [14] Advanced RISC Machne Ltd (ARM), Applcaton Note 34: Wrtng Effcent C for ARM, [Onlne document], Avalable: [15] J. F. Kaser, Nonrecursve Dgtal Flter Desgn Usng the Io-Snh Wndow Functon, n Proc. IEEE Int. Symp. Crcuts Syst., pp , Appendx 1. Lbrary API Ths lbrary supports sample rate converson of contguous data blocks usng repeated calls wth loss of nternal flter state. Transent flter responses are avoded at block boundares by provdng a state ntalzaton mechansm for the functon. If the flter s ntalzed at the start of each new block to the state that was reached at the end of the prevous block, then a steady-state flter response s mantaned when flterng a long data record on a block-by-block bass. Applcaton code makng use of the resample functon should adhere to the followng usage model: a. Intalzaton Pror to callng resample for the frst tme, nvoke resampleinit() wth the approprate parameters to ntalze the nternal varables used by the lbrary. b. Resamplng If samples from a long sequence are processed n blocks usng repeated calls to the lbrary, the applcaton should not modfy the RESAMPLE_STATE varable n between successve calls. Ths mplementaton wll produce around (TAP*factor) samples of start-up transent put when t s called for the frst tme. c. Extng When there are no more nputs, the applcaton should frst call resampleblock() wth nlength set to zero. Ths should resample what's left n the nternal buffer. If transent response s desred at the end, resampleflush() should then be called. Once converson has been completed, call resampleexit() to free up the memory used by the nternal varables (lookup tables and nternal buffer). Block sze management: Block processng n sample rate converson presents a unque problem because the nput block sze s dfferent from the put. In ths lbrary, the user should request (nt)(nlength*factor) samples of put per nlength nput samples. Requestng too many or too few puts may result n resampleblock returnng an abnormal ext condton. Processng nterleaved stereo audo: Two channel (stereo) audo data s often stored wth the channels nterleaved. Ths lbrary provdes functons for resamplng nterleaved data so the applcaton won't have to separate the channels. 10
12 2. Example code Ths s a smple example code that uses the lbrary to convert a two-channel, raw PCM audo fle recorded at 44.1 khz to 32 khz. Converson s done n blocks of 100 ms. #nclude <stdo.h> #nclude <stdlb.h> #nclude "resample_smth_gossett.h" vod example(vod) { RESAMPLE_STATE state; nt qualty, stereo, use_table; nt Fn, F; nt Nn; /* number of nput samples per block */ nt N; /* number of put samples per block */ nt nbytes; /* bytes per nput block */ nt Bytes; /* bytes per put block*/ nt *nbuffer, *Buffer; double factor; FILE *nfp, *Fp; Fn = 44100; F = 32000; factor = (double)f/(double)fn; /* the audo s processed n blocks of 0.1 second */ Nn = 4410; N = (nt)( (double)nn*factor ); /* Allocate memory for n/ blocks */ nbytes = Nn*szeof(nt); Bytes = N*szeof(nt); nbuffer = (nt *)malloc(nbytes); Buffer = (nt *)malloc(bytes); /* Open up the fles we need */ nfp = fopen("n.pcm", "rb"); Fp = fopen(".pcm", "wb"); qualty = 0; /* normal qualty */ stereo = 1; /* stereo audo */ use_table = 1; /* use lookup table */ resampleinit(&state, factor, qualty, stereo, use_table); /* ntalze nternal varables */ /* resample Nn nput samples at a tme untl the end of the nput fle */ whle (fread(nbuffer, szeof(nt), Nn, nfp)==nn) { resampleblock_stereo(nbuffer, Buffer, Nn, &N, &state); fwrte(buffer, szeof(nt), N, Fp); } /* flush what's left n the nternal buffer */ resampleblock_stereo(n Buffer, Buffer, 0, &N, &state); fwrte(buffer, szeof(nt), N, Fp); N = resampleflush_stereo(buffer, &state); fwrte(buffer, szeof(nt), N, Fp); resampleexit(&state); /* free up memory used by nternal varables */ } fclose(nfp); fclose(fp); free(buffer); free(nbuffer); 11
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 informationSimulation 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 informationHigh level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization
What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton
More information[33]. As we have seen there are different algorithms for compressing the speech. The
49 5. LD-CELP SPEECH CODER 5.1 INTRODUCTION Speech compresson s one of the mportant doman n dgtal communcaton [33]. As we have seen there are dfferent algorthms for compressng the speech. The mportant
More informationCompiler 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 informationA 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 informationImprovement 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 informationThe 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 informationArray 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 informationWishing 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 informationParallelism 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 informationLoad 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 informationAn 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 informationMathematics 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 informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationNewton-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 informationParallel 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 informationProgramming 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 informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationFloating-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 informationRADIX-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 informationTHE PULL-PUSH ALGORITHM REVISITED
THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748
More informationVRT012 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 informationELEC 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 informationA 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 informationVirtual 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 informationSpecifications 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 informationTN348: 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 informationRandom 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 informationReal-time interactive applications
Real-tme nteractve applcatons PC-2-PC phone PC-2-phone Dalpad Net2phone vdeoconference Webcams Now we look at a PC-2-PC Internet phone example n detal Internet phone over best-effort (1) Best effort packet
More informationLobachevsky 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 informationParallel 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 informationThe 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 informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationCMPS 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 informationCluster 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 informationCombined Rate Control and Mode Decision Optimization for MPEG-2 Transcoding with Spatial Resolution Reduction
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Combned Rate Control and Mode Decson Optmzaton for MPEG-2 Transcodng wth Spatal Resoluton Reducton TR2003-7 December 2003 Abstract Ths paper
More informationFPGA 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 informationAADL : 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 informationEdge 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 informationAN EFFICIENT ALGORITHM FOR REAL-TIME SPECTROGRAM INVERSION. Gerald T. Beauregard Xinglei Zhu Lonce Wyse. Research, Singapore
AN EFFICIENT ALGORITHM FOR REAL-TIME SPECTROGRAM INVERSION Gerald T. Beauregard Xngle Zhu Lonce Wyse muvee Technologes g.beauregard@eee.org Insttute for Infocomm Research, Sngapore xzhu@r.astar.edu.sg
More informationRelated-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 informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationReducing 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 informationSLAM 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 informationHigh-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 informationOutline. 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 informationMallathahally, 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 informationTerm 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 informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationKey-Selective Patchwork Method for Audio Watermarking
Internatonal Journal of Dgtal Content Technology and ts Applcatons Volume 4, Number 4, July 2010 Key-Selectve Patchwork Method for Audo Watermarkng 1 Ch-Man Pun, 2 Jng-Jng Jang 1, Frst and Correspondng
More informationEFFICIENT LOW DELAY FILTERING FOR RESIDUAL ECHO SUPPRESSION
EFFICIENT LOW DELAY FILTERING FOR RESIDUAL ECHO SUPPRESSION Chrstelle Yemdj, Moctar Moss Idrssa and Ncholas W. D. Evans EURECOM Insttute 656 Sopha-Antpols, France {yemdj, moss, evans}@eurecom.fr web: www.eurecom.fr
More informationConvolutional interleaver for unequal error protection of turbo codes
Convolutonal nterleaver for unequal error protecton of turbo codes Sna Vaf, Tadeusz Wysock, Ian Burnett Unversty of Wollongong, SW 2522, Australa E-mal:{sv39,wysock,an_burnett}@uow.edu.au Abstract: Ths
More informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationImplementation of IMDCT Block of an MP3 Decoder through Optimization on the DCT Matrix
22 M. GALABOV, IMPLEMENTATION OF IMDCT BLOCK OF AN MP DECODER THROUGH OPTIMIZATION... Implementaton of IMDCT Block of an MP Decoder through Optmzaton on the DCT Matr Mroslav GALABOV Dept. of Computer Systems
More informationStorage Binding in RTL synthesis
Storage Bndng n RTL synthess Pe Zhang Danel D. Gajsk Techncal Report ICS-0-37 August 0th, 200 Center for Embedded Computer Systems Department of Informaton and Computer Scence Unersty of Calforna, Irne
More informationETAtouch RESTful Webservices
ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................
More informationSupport 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 informationLecture 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 informationAlgorithm To Convert A Decimal To A Fraction
Algorthm To Convert A ecmal To A Fracton by John Kennedy Mathematcs epartment Santa Monca College 1900 Pco Blvd. Santa Monca, CA 90405 jrkennedy6@gmal.com Except for ths comment explanng that t s blank
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationNUMERICAL 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 informationCCT. Abdul-Jabbar: Design And Realization Of Circular Contourlet Transform ..VLSI. z 2. z 1.
Abdul-Jabbar: Desgn And Realzaton Of Crcular Contourlet Transform DESIGN AND REALIZATION OF CIRCULAR CONTOURLET TRANSFORM Dr Jassm M Abdul-Jabbar * Hala N Fathee ** * Ph D n Elect Eng, Dept of Computer
More informationRun-Time Energy Estimation in System-On-a-Chip Designs *
Run-Tme Energy Estmaton n System-On-a-Chp Desgns * J. Had, G. Kaefer, Ch. Steger, R. Wess Insttute for Techncal Informatcs Graz Unversty of Technology Graz, Austra Abstract - In ths paper, a co-processor
More informationUsing 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 informationHelp for Time-Resolved Analysis TRI2 version 2.4 P Barber,
Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, 22.01.10 Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans
More informationConditional 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 informationDesign and Implementation of an Energy Efficient Multimedia Playback System
Desgn and Implementaton of an Energy Effcent Multmeda Playback System Zhjan Lu, John Lach, Mrcea Stan, Kevn Skadron, Departments of Electrcal and Computer Engneerng and Computer Scence, Unversty of Vrgna
More informationA 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 informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationQuantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control
Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,
More informationEnd-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video
End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa
More informationJ-DSP-CONTROL: A CONTROL SYSTEMS SIMULATION ENVIRONMENT +
J-DSP-CONTROL: A CONTROL SYSTEMS SIMULATION ENVIRONMENT + T. Thrasyvoulou, K. Tsakals and A. Spanas MIDL Department of Electrcal Engneerng Arzona State Unversty, Tempe, AZ 85287-7206 thrassos@asu.edu,
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationSAO: A Stream Index for Answering Linear Optimization Queries
SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples
More informationQuantization Noise Power Injection In Subband Audio Coding Using Low Selectivity Filter Banks
Quantzaton Nose Power Injecton In Subband Audo Codng Usng Low Selectvty Flter Banks D. ARTÍNEZ -UÑOZ, N. RUIZ-REYES, P. VERA-CANDEAS, P.J. RECHE-LÓPEZ, J. CURPIÁN-ALONSO Departamento de Electrónca Unversdad
More informationTECHNIQUE 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 informationREMOTE SENSING REQUIREMENTS DEVELOPMENT: A SIMULATION-BASED APPROACH
REMOTE SENSING REQUIREMENTS DEVEOPMENT: A SIMUATION-BASED APPROAC V. Zanon a, B. Davs a, R. Ryan b, G. Gasser c, S. Blonsk b a Earth Scence Applcatons Drectorate, Natonal Aeronautcs and Space Admnstraton,
More informationHigh resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices
Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationIP 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 informationArea 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 informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationData 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 informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationA 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 informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationContent 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 informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationAC : TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS
AC 2011-1615: TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS Nkunja Swan, South Carolna State Unversty Dr. Swan s currently a Professor at
More informationA 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 informationCHAPTER 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 informationClassifying 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 informationSteps 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 informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationSorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions
Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place
More informationSome 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