All Digital Timing Recovery and FPGA Implementation

Size: px
Start display at page:

Download "All Digital Timing Recovery and FPGA Implementation"

Transcription

1 All Digital imig Recovery ad FPGA Implemetatio Daiel Cárdeas, Germá Arévalo Abstract Clock ad data recovery CDR is a importat subsystem of every commuicatio device sice the receiver must recover the exact trasmitter s clock iformatio usually coded ito the icomig stream. ome aalogue techiques for CDR have bee developed based o PLL theory employig a exteral VCO. However, sometimes exteral compoets could be cumbersome whe iterfacig them with the digital core (FPGA, DP) already preset i the device. hus, the digital core is also used to carry out the timig recovery task by all-digital techiques i.e. without a exteral VCO. his article will describe a all digital timig recovery subsystem usig digital techiques implemeted o a FPGA Idex erms Clock ad Data Recovery CDR, FPGA, DP, ychroizatio, imig Recovery. I. INRODUCION Clock ad Data Recovery is a key elemet of a commuicatio s receiver. Depedig o the characteristics of the trasceiver ad the whole commuicatio system, differet approaches ca be take i order to recover the right clock ad data iformatio from the icomig data. For digital systems, the traditioal approach uses a aalog Voltage Cotrolled Oscillator (VCO) who drives the receiver s sampler. Aother approach uses digital sigal processig i order to recover the right data iformatio, thus o VCO is eeded. his article will briefly describe the latter oe ad will show, as a example, a hardware implemetatio o a Field Programmable Gate Array. II. IMING RECOVERY DECRIPION Figure 1 shows a typical basebad PAM commuicatio system where iformatio bits b k are applied to a lie ecoder which coverts them ito a sequece of symbols a k. his sequece eters the trasmit filter G (ω) ad the is set through the chael C(ω) which distorts the trasmitted sigal ad adds oise. At the receiver, the sigal is filtered by G R (ω) D. Cárdeas is with Electroics Departmet, Col. Politécico, Uiversidad a Fracisco de Quito, M103A, Cumbayá, Ecuador ( dcardeas@usfq.edu.ec). G. Arévalo is with AI echologies Ltd.- Desig Ceter, a Rafael, Ecuador. D. Cárdeas thaks the colleagues at PhotoLab, Istituto uperiore Mario Boella, orio, Italy, for their ecoomical ad techical support. i order to reject the oise compoets outside the sigal badwidth ad reduced the effect of the II. he sigal at the output of the receiver filter is y ( t; ε ) = am g( t m ε ) + ( t) m Equatio 1 where g(t) is the basebad pulse give by the overall trasfer fuctio G(ω) (Equatio 2), (t) is the additive oise, is the symbol period (trasmitter) ad ε is the fractioal time delay (ukow) betwee the trasmitter ad the receiver, ε < ½. he symbols â k are estimated based upo these samples. hey are fially decoded to give the sequece of bits b k. b k Lie ecoder G(ω)= G (ω)c(ω)g R (ω) Equatio 2. Overall trasfer fuctio a k G (ω) C(ω) G R (ω) oise Fig. 1. Basic Commuicatio ystem for basebad PAM he receiver does ot kow a priori the optimum samplig istats {k+ ε}. herefore, the receiver must icorporate a timig recovery circuit or clock or symbol sychroizer which estimates the fractioal delay ε from the received sigal. wo mai categories of clock sychroizers are the distiguished depedig o their operatig priciple: error trackig (feedback) ad feedforward sychroizers [1]. A. Feedforward ychroizer Figure 2 shows the basic architecture of the feedforward sychroizer. Its mai compoet is the timig detector which computes directly the istataeous value of the fractioal delay ε from the icomig data. he oisy measuremets are averaged to yield the estimate ad set as cotrol sigal to a referece sigal geerator. he geerated clock is fially used by the data sampler [1, 2]. y(t,ε)

2 rasceiver i these proceedigs for a aalysis of a hybrid sychroizer. B. Feedback ychroizer Fig. 2. Feedforward (ope-loop) ychroizer he mai compoet of the feedback sychroizer is the timig error detector, which compares the icomig PAM data with the referece sigal, as show i Figure 3. Its output gives the sig ad magitude of the timig error e = ε ˆ ε. he filtered timig error is used to cotrol the data sampler. Hece, feedback sychroizers use the same priciple tha a classical PLL [1, 2]. A. All-digital architecture Figure 4 shows the architecture of a all-digital timig recovery. he A/D coverter operates with a free ruig oscillator that has a omial frequecy idetical to the D/A used at the trasmitter. However, the ratio betwee the realworld symbol rate ad the idepedet (fixed rate) samplig clock is ever ratioal (ad it will chage i time) i.e. samplig frequecy ad baud rate are icommesurate; therefore, samplig is asychroous with the icomig data. Fig. 4 Digital Architecture Fig. 3. Feedback (closed loop) ychroizer he mai differece betwee these two sychroizer implemetatios is ow evidet. he feedback sychroizer miimizes the timig error sigal, the referece sigal is used to correct itself thaks to the closed loop; the feedforward sychroizer estimates directly the timig from the icomig data ad geerates directly the referece sigal, o feedback is eeded. Besides the previous classificatio, some others ca be made. If the sychroizer uses the receiver s decisios about the trasmitted data symbols to estimate the timig, the sychroizer is said to be decisio directed, otherwise is odata aided. he sychroizer ca also work i cotiuous or discrete time. III. CDR HARDWARE ARCHIECURE We aalyzed two approaches: the hybrid sychroizer, which is partially implemeted o the digital domai ad partially o the aalogue domai; ad the digital sychroizer, which fully operates i discrete time. Eve if their hardware implemetatio is differet, both have a equivalet architecture of a feedback sychroizer; therefore, the theory for computig the loop parameters is exactly the same. I the followig we describe the digital sychroizer, please refer to the article Clock ad Data Recovery for a High peed ice the samplig clock is a free ruig clock, data sychroizatio occurs by meas of time-varyig data iterpolatio i order to create the samples that would have bee obtaied if the origial samplig had bee sychroized with the symbols. After the iterpolator, data are set to the timig error detector ad the to the loop filter. he filtered error sigal cotrols a NCO which closes the loop. he NCO s outputs give the correct parameters for iterpolatio. his architecture will be described i more detail i the followig sectio. IV. DIGIAL IMING RECOVERY ARCHIECURE he digital timig recovery architecture is better depicted i Figure 5. Let s be the asychroous samplig period of the A/D coverter icommesurate with the icomig symbol period. We might ote that eve the slightest differece betwee the trasmitter ad receiver clocks might result i cycle slips after some time. 1/s μ m s ED imig processor Loop filter Figure 5 Digital imig Recovery feedback sychroizer

3 We must obtai samples y(+εˆ ), with iteger, at symbol rate 1/ from samples take at 1/s. herefore, the trasmitter time scale (defied by ) must be expressed i terms of the receiver time scale (defied by s). Estimatio of the fractioal time delay ε is the first importat operatio i all-digital timig recovery. + ˆ ε = s + ˆ ε s L + ˆ ε + ˆ it µ s s = y + ˆ ε = y m + ˆ µ hece, ( ) ( ) Equatio 3 where m = L it (x) returs the largest iteger less tha or equal to x, ad û is the differece betwee oe samplig istat at the receiver ad the correspodig optimum sample i trasmissio; the idex m is called basepoit ad the value û is the estimatio of the fractioal delay. hese cocepts are better illustrated i Figure 6. iterpolatio, decimatio cotrol ad fractioal delay estimatio as well as their adopted implemetatio. A. imig Error Detector (ED) he timig error detector ED resembles the operatio of a Phase Detector i a aalogue PLL, i.e. it gives the error iformatio based o the phase differece betwee the icomig sigal ad the referece clock at its iput. here are several algorithms to implemet digitally a timig error detector depedig o the oversamplig factor or modulatio format [1, 3, 4]. he available hardware for this prototype, specifically the ADC, allows to have at most two samples/symbol; moreover, it would be better if its implemetatio has a good trade-off betwee complexity ad performace, hece, we selected the error detector from Garder [5, 6]. For a descriptio of this ED ad others please refer to the article Clock ad Data Recovery for a High peed rasceiver i these proceedigs. B. Digital he task of the iterpolator is to compute the optimum samples y(+εˆ ) from a set of received samples x(m ) as stated before by Equatio 3. Figure 7 shows that the iterpolatio is basically a time varyig filterig process sice ad s are icommesurate. μ o μ 1 μ 2 x(ms) a) X 1/s μ m s y() m o m 1 m 2 b) RX Figure 6 ime cale of the a) rasmitter ad b) Receiver Figure 6 ad Equatio 3 show that the correct sample at istat +ε ca be iterpolated from a set of samples defied by the basepoit m ad the estimated fractioal differece û betwee that basepoit ad the ew sample to be computed. Note that the time shift û is time variable despite ε is costat. Equatio 3 is the most importat oe i all-digital timig recovery. he timig parameters (û,m ) are calculated oce the fractioal time delay ε has bee estimated. he secod most importat fuctio i all-digital timig recovery comprises two operatios: decimatio, give by the basepoit idex, ad iterpolatio give by the fractioal delay; the values of the basepoit ad the fractioal delay are computed by the timig estimator block i Figure 5. he time-varyig iterpolator uses these values to compute the optimum sample. he followig sectios will explai i more detail the Fig. 7. Digital iterpolator filter he iterpolatig filter has a ideal impulse respose of the form of the sampled si(x) give by Equatio 4. It ca be thought as a FIR filter with ifiite taps whose values deped o the fractioal delay μ. Figure 8 shows the respose of the digital filter whe μ=0.2, ote how the respose varies from the uderlyig cotiuous respose cetered at zero. h I µ π ( µ ) h (, µ ) = si ( + ) = Equatio 4. Impulse respose of the ideal iterpolator

4 h (s,µs) cotiuous µ = 0.2, discrete fractioal delay μ k have to be computed i order to obtai the iterpolated sample y. Equatio 3 becomes ow: y(k I + ε I ) = y( L it [k I + ε I I ] +μ k ) = y( m k + μ k ) Equatio s Fig. 8. Impulse respose of the ideal iterpolatig filter For a practical implemetatio, the iterpolator ca be approximated by a fiite order FIR filter (equatio 5). Figure 9 shows a detailed diagram of the full architecture of digital timig recovery. Note that the loop filter decimates the output of the ED (at s) before the filterig process, so that the filtered error sigal is updated at symbol rate. his is a cotrolled decimatio by M I basepoit m k (k=m I ), slaved to the first oe at the iterpolator. Apart from that, sice the iterpolator works with M I samples per icomig symbol (omially), oly oe of them should be passed to the rest of the subsystem as valid recovered data; this meas aother decimatio process (by M I ) also slaved to the oe of the iterpolator. herefore, the output of the digital timig recovery block is the updated at symbol rate. H I jω (, ) = 2 e µ h ( µ ) = I1 e jω Output y(m M Is+μ M Is) Equatio 5 where I 1 ad I 2 defie respectively the lowest ad the highest samples of the discrete impulse respose aroud the cetral poit. he output of the filter is give by a liear combiatio of the (I 2 + I 1 +1) sigal samples take aroud the basepoit m k. his leads to Equatio 6, which is the fudametal equatio i digital iterpolatio. I order to obtai a uique basepoit set, there must be a eve umber of samples ad iterpolatio should be performed i the ceter iterval. 2 ( mk + µ ) = x[ ( mk ) ] I y h ( µ ) = I1 1/s μ k m ks ED imig processor Loop filter w decimate at m k slave decimatio by M I Equatio 6. Digital iterpolatio As metioed before, the coefficiets h (μ) of the filter are ot fixed ad they vary accordigly to μ. his requires limitig the possible values of μ ad, for each of them oe should precompute ad store i memory the respective coefficiets. he problems arise from the discretizatio error i μ, ad from the large complexity i a real implemetatio i hardware. A commo solutio is to approximate each coefficiet by a polyomial i μ. C. Cotrol ad NCO he iterpolator cotrol block computes the basepoit m ad the fractioal delay û based o the filtered timig error. Error detectors produce a error sigal at 1/ usig samples k I = k/m I with M I iteger (M I = 2 samples/symbol i this case). herefore, for every sample, the basepoit m k ad the Fig. 9. Detailed architecture of the all-digital timig recovery he filtered error sigal w costitutes the cotrol word of the timig processor which computes the basepoit ad the fractioal delay. As see, the timig processor cotrols every block i the digital timig recovery subsystem at every cycle ks. Its tasks are summarized i the followig. It computes the basepoit m k or decimatio, this ivolves that the timig processor selects the correct samples that go through the iterpolator. If the receiver clock is faster tha the icomig sample rate, at some poit oe extra sample is take by the ADC; the timig processor does ot pass the extra sample to the iterpolator sice it is ot useful. Note that also the rest if the blocks i the subsystem must ot operate with this sample either. O the other had, if the receiver

5 clock is slower tha the icomig data rate, at some poit oe sample is lost; i this case, there s o decimatio for the iterpolator, all the samples are valid. ice the system works with Mx oversamplig (M samples/symbol), the slaved decimatios are ot affected, they are always takig just oe every M samples. he timig processor computes also the fractioal delay μ k, so it selects the correct impulse respose of the iterpolator. he timig processor ca be carried out by a NCO [7]. he NCO register is computed iteratively as: (m k ) = [ (m k -1) + w (m k -1) ] mod 1 Equatio 8 Ad the fractioal delay is estimated by: μ k I / (m k ) Equatio 9 he prototype works with two samples/symbol at the trasmitter ad also at the receiver, so omially I / = 1. herefore, the cotet of the NCO is the fractioal delay. Istead of explicitly computig m k, overflow ad uderflow of the NCO register idicate if the receiver clock is faster or slower, respectively. D. Loop Filter he timig processor based i a NCO allows cosiderig the digital timig recovery as a equivalet PLL operatig at symbol frequecy. herefore, the loop aalysis ca be carried out usig classical PLL theory [8]. he same cosideratio applies for the hybrid CDR desig described i the article Clock ad Data Recovery for a High peed rasceiver i these proceedigs, please refer to it for a better theoretical descriptio. he aalogue loop filter F(s) must be trasformed to the digital domai F(z) i order to be implemeted i the FPGA. he desig cosiders the biliear trasformatio, which maps the etire left side of the s-plae ito the etire uit circle of the z-plae. o, ay stable trasform i the cotiuous domai s is mapped ito a stable z-trasform i the discrete time. he biliear trasformatio is achieved by the followig equatio. F 2 1 z s 1+ z 1 ( s) F( z), s = 1 Equatio 10 where s is the sample period. V. FPGA IMPLEMENAION AND REUL Figure 10 depicts the all-digital solutio implemeted. he system has successfully simulated ad a (first) stad-aloe test has bee carried out. Icomig 8-PAM sigal ADC ks (fixed) x k 2 samples/symbol (Parabolic) µ FA LOW NCO & Cotrol y ki select 1 sample Fig. 10. All digital timig recovery architecture ED (Garder) Loop Filter Note that the iterfacig of this all-digital module with the rest of the subsystems meas hadlig the cotrolled decimatio of iterpolated samples. he all-digital timig recovery block works with two samples per symbol at the iput ad, as the theory says, it should perform decimatio by 2 i order to output data at symbol rate. I this case however, the equalizer that follows at its output requires also two samples (it acts at sample rate); therefore, o slaved decimatio by 2 shall be doe. A problem arises whe the receiver clock is slower tha the trasmitted oe; usually the oly sample obtaied is passed to the output, but i this case two samples should be created ad passed to the ext stage i a sigle clock cycle. he all digital timig recovery was successfully tested i simulatios with fiite arithmetic ad a similar result was observed i the first stad-aloe tests that have bee carried out i the FPGA. Figure 11 illustrates the situatio whe the receiver clock is faster tha the trasmitted oe; i this case a flag (FLAG RX FA) idicates this situatio ad cotrol the rest of the blocks i the structure i order to ot cosider it for the computatios. he lower part of the figure shows the icremet of the fractioal delay i time. It shows that the flag is activated whe the fractioal delay recycles from the maximum (1) to the miimum value (0). o postequalizer F(s)=Kp+Ki/s FPGA

6 Boolea output Flag RX FA Fractioal delay (u) ime scale at receiver [µs] Fig. 11. All digital timig recovery, receiver clock is faster tha trasmitter clock, flag idicates that oe sample should ot be cosidered. Nomial receiver clock frequecy= MHz. Eve though a simulatio display is show here, the same behaviour has bee observed i a digital oscilloscope i a real test with the first hardware versio of the system. Nevertheless, the iterfacig of this block with the rest of the subsystems of the receiver is still uder desig. VI. ACKNOWLEDGEMEN he authors would like to ackowledge the ecoomical support of, ad the fruitful discussios with. the PhotoLab taff at IMB, orio, Italy. VIII. BIOGRAPHIE Daiel Cárdeas received the Eg. degree i telecommuicatios egieerig from Escuela Politécica Nacioal, Quito, Ecuador, ad the M.c. (optical commuicatios) ad Ph.D. (electroics egieerig) from Politecico di orio, orio, Italy i 2004 ad 2008, respectively. He is a coauthor of a patet i the field of telecommuicatios over plastic optical fibers. He collaborated with Istituto uperiore Mario Boella, orio, Italy ad he was a exteral cosultat for Fracecol, Frace, ad iemes, Germay. He is curretly with UFQ, Ecuador. His curret research activities iclude polymer-optical-fiber-based access systems, ad digital sigal processig techiques ad their implemetatio o FPGA/DP. Germá Arévalo received the Eg. degree i telecommuicatios egieerig from Escuela Politécica Nacioal, Quito, Ecuador, ad the M.c. i optical commuicatios ad photoic techologies from Politecico di orio, orio, Italy i He is ow the dea of the electroics faculty, Uiversidad Politécica alesiaa, Quito, Ecuador ad collaborates with the desig ceter of AI echologies Ltd., Ecuador. VII. REFERENCE [1] Meyr Heirich, Marc Moeeclaey, ad tefa A. Fechtel, Digital Commuicatios Receivers: sychroizatio, chael estimatio ad sigal processig. Vol : Joh Wiley & os. [2] U.Megali, A.N.D'Adrea, ychroizatio echiques for Digital Receivers. 1997, New York: Pleum Press. [3] K. H. Mueller ad M. Müller, imig Recovery i Digital ychroous Data Receivers. IEEE ras. Commu., May COM-24: p [4] M. Oerder ad H. Meyr, Digital Filter ad quare imig Recovery. IEEE ras. Commu, May COM-36: p [5] Garder, F.M., A BPK/QPK timig-error detector for sampled receivers. IEEE rasactios o Commuicatios, CM-34(5): p [6]. M. Oerder ad H. Meyr, Derivatio of Garder s imig Error Detector from the Maximum Likelihood Priciple. IEEE ras. Commu., Jue COM-35: p [7] Garder, F.M., Iterpolatio i digital modems. I. Fudametals. IEEE rasactios o Commuicatios, (3): p [8] Garder, F.M., Phaselock echiques. hird ed. 2005, New York: Wiley.

Study on the application of the software phase-locked loop in tracking and filtering of pulse signal

Study on the application of the software phase-locked loop in tracking and filtering of pulse signal Advaced Sciece ad Techology Letters, pp.31-35 http://dx.doi.org/10.14257/astl.2014.78.06 Study o the applicatio of the software phase-locked loop i trackig ad filterig of pulse sigal Sog Wei Xia 1 (College

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature. Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Domain 1: Designing a SQL Server Instance and a Database Solution

Domain 1: Designing a SQL Server Instance and a Database Solution Maual SQL Server 2008 Desig, Optimize ad Maitai (70-450) 1-800-418-6789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Domain 1 - Describe Cisco VoIP Implementations

Domain 1 - Describe Cisco VoIP Implementations Maual ONT (642-8) 1-800-418-6789 Domai 1 - Describe Cisco VoIP Implemetatios Advatages of VoIP Over Traditioal Switches Voice over IP etworks have may advatages over traditioal circuit switched voice etworks.

More information

Systems Design Project: Indoor Location of Wireless Devices

Systems Design Project: Indoor Location of Wireless Devices Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: bcm1@cec.wustl.edu Supervised

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to

More information

Chapter 10 Computer Design Basics

Chapter 10 Computer Design Basics Logic ad Computer Desig Fudametals Chapter 10 Computer Desig Basics Part 1 Datapaths Charles Kime & Thomas Kamiski 2004 Pearso Educatio, Ic. Terms of Use (Hyperliks are active i View Show mode) Overview

More information

Basic Measurement Issues. Sampling Theory and Analog-to-Digital Conversion

Basic Measurement Issues. Sampling Theory and Analog-to-Digital Conversion Theory ad Aalog-to-Digital Coversio Itroductio/Defiitios Aalog-to-digital coversio Rate Frequecy Aalysis Basic Measuremet Issues Reliability the extet to which a measuremet procedure yields the same results

More information

Convention Paper 6764

Convention Paper 6764 Audio Egieerig Society Covetio Paper 6764 Preseted at the 10th Covetio 006 May 0 3 Paris, Frace This covetio paper has bee reproduced from the author's advace mauscript, without editig, correctios, or

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

(VCP-310) 1-800-418-6789

(VCP-310) 1-800-418-6789 Maual VMware Lesso 1: Uderstadig the VMware Product Lie I this lesso, you will first lear what virtualizatio is. Next, you ll explore the products offered by VMware that provide virtualizatio services.

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030 haupt@ieee.org Abstract:

More information

Multiplexers and Demultiplexers

Multiplexers and Demultiplexers I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions

Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions Chapter 5 Uit Aual Amout ad Gradiet Fuctios IET 350 Egieerig Ecoomics Learig Objectives Chapter 5 Upo completio of this chapter you should uderstad: Calculatig future values from aual amouts. Calculatig

More information

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity

More information

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN Aalyzig Logitudial Data from Complex Surveys Usig SUDAAN Darryl Creel Statistics ad Epidemiology, RTI Iteratioal, 312 Trotter Farm Drive, Rockville, MD, 20850 Abstract SUDAAN: Software for the Statistical

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

Business Rules-Driven SOA. A Framework for Multi-Tenant Cloud Computing

Business Rules-Driven SOA. A Framework for Multi-Tenant Cloud Computing Lect. Phd. Liviu Gabriel CRETU / SPRERS evet Traiig o software services, Timisoara, Romaia, 6-10 dec 2010 www.feaa.uaic.ro Busiess Rules-Drive SOA. A Framework for Multi-Teat Cloud Computig Lect. Ph.D.

More information

Research Article Sign Data Derivative Recovery

Research Article Sign Data Derivative Recovery Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

Ekkehart Schlicht: Economic Surplus and Derived Demand

Ekkehart Schlicht: Economic Surplus and Derived Demand Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/

More information

BENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets

BENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets BENEIT-CST ANALYSIS iacial ad Ecoomic Appraisal usig Spreadsheets Ch. 2: Ivestmet Appraisal - Priciples Harry Campbell & Richard Brow School of Ecoomics The Uiversity of Queeslad Review of basic cocepts

More information

76 SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME 9 - NUMBER 1 - YEAR 2011 ISSN: 1690-4524

76 SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME 9 - NUMBER 1 - YEAR 2011 ISSN: 1690-4524 The Fuzzy ad Compartmet System Cocept for the Commuicatio System takig accout of the Hadicapped situatio M asahiroaruga DepartmetofHuma ad Iformatio Sciece,School ofiformatio Sciecead Techology,TokaiUiversity

More information

Institute of Actuaries of India Subject CT1 Financial Mathematics

Institute of Actuaries of India Subject CT1 Financial Mathematics Istitute of Actuaries of Idia Subject CT1 Fiacial Mathematics For 2014 Examiatios Subject CT1 Fiacial Mathematics Core Techical Aim The aim of the Fiacial Mathematics subject is to provide a groudig i

More information

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is 0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values

More information

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

Normal Distribution.

Normal Distribution. Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PERFORMANCE COUNCIL (IPC) INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

More information

Engineering Data Management

Engineering Data Management BaaERP 5.0c Maufacturig Egieerig Data Maagemet Module Procedure UP128A US Documetiformatio Documet Documet code : UP128A US Documet group : User Documetatio Documet title : Egieerig Data Maagemet Applicatio/Package

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

Escola Federal de Engenharia de Itajubá

Escola Federal de Engenharia de Itajubá Escola Federal de Egeharia de Itajubá Departameto de Egeharia Mecâica Pós-Graduação em Egeharia Mecâica MPF04 ANÁLISE DE SINAIS E AQUISÇÃO DE DADOS SINAIS E SISTEMAS Trabalho 02 (MATLAB) Prof. Dr. José

More information

Multi-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu

Multi-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu Multi-server Optimal Badwidth Moitorig for QoS based Multimedia Delivery Aup Basu, Iree Cheg ad Yizhe Yu Departmet of Computig Sciece U. of Alberta Architecture Applicatio Layer Request receptio -coectio

More information

SYSTEM INFO. MDK - Multifunctional Digital Communications System. Efficient Solutions for Information and Safety

SYSTEM INFO. MDK - Multifunctional Digital Communications System. Efficient Solutions for Information and Safety Commuicatios Systems for Itercom, PA, Emergecy Call ad Telecommuicatios MDK - Multifuctioal Digital Commuicatios System SYSTEM INFO ms NEUMANN ELEKTRONIK GmbH Efficiet Solutios for Iformatio ad Safety

More information

Factors of sums of powers of binomial coefficients

Factors of sums of powers of binomial coefficients ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the

More information

Baan Service Master Data Management

Baan Service Master Data Management Baa Service Master Data Maagemet Module Procedure UP069A US Documetiformatio Documet Documet code : UP069A US Documet group : User Documetatio Documet title : Master Data Maagemet Applicatio/Package :

More information

Overview on S-Box Design Principles

Overview on S-Box Design Principles Overview o S-Box Desig Priciples Debdeep Mukhopadhyay Assistat Professor Departmet of Computer Sciece ad Egieerig Idia Istitute of Techology Kharagpur INDIA -721302 What is a S-Box? S-Boxes are Boolea

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

HCL Dynamic Spiking Protocol

HCL Dynamic Spiking Protocol ELI LILLY AND COMPANY TIPPECANOE LABORATORIES LAFAYETTE, IN Revisio 2.0 TABLE OF CONTENTS REVISION HISTORY... 2. REVISION.0... 2.2 REVISION 2.0... 2 2 OVERVIEW... 3 3 DEFINITIONS... 5 4 EQUIPMENT... 7

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

Tradigms of Astundithi and Toyota

Tradigms of Astundithi and Toyota Tradig the radomess - Desigig a optimal tradig strategy uder a drifted radom walk price model Yuao Wu Math 20 Project Paper Professor Zachary Hamaker Abstract: I this paper the author iteds to explore

More information

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics

More information

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

Bio-Plex Manager Software

Bio-Plex Manager Software Multiplex Suspesio Array Bio-Plex Maager Software Extract Kowledge Faster Move Your Research Forward Bio-Rad cotiues to iovate where it matters most. With Bio-Plex Maager 5.0 software, we offer valuable

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the

More information

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTI-TRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial

More information

LECTURE 13: Cross-validation

LECTURE 13: Cross-validation LECTURE 3: Cross-validatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Three-way data partitioi Itroductio to Patter Aalysis Ricardo Gutierrez-Osua Texas A&M

More information

Automatic Tuning for FOREX Trading System Using Fuzzy Time Series

Automatic Tuning for FOREX Trading System Using Fuzzy Time Series utomatic Tuig for FOREX Tradig System Usig Fuzzy Time Series Kraimo Maeesilp ad Pitihate Soorasa bstract Efficiecy of the automatic currecy tradig system is time depedet due to usig fixed parameters which

More information

Determining the sample size

Determining the sample size Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

More information

Cantilever Beam Experiment

Cantilever Beam Experiment Mechaical Egieerig Departmet Uiversity of Massachusetts Lowell Catilever Beam Experimet Backgroud A disk drive maufacturer is redesigig several disk drive armature mechaisms. This is the result of evaluatio

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

1 Correlation and Regression Analysis

1 Correlation and Regression Analysis 1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

More information

Chapter 7: Confidence Interval and Sample Size

Chapter 7: Confidence Interval and Sample Size Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

Statistical inference: example 1. Inferential Statistics

Statistical inference: example 1. Inferential Statistics Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either

More information

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics

More information

Performance Evaluation of the MSMPS Algorithm under Different Distribution Traffic

Performance Evaluation of the MSMPS Algorithm under Different Distribution Traffic Paper Performace Evaluatio of the MSMPS Algorithm uder Differet Distributio Traffic Grzegorz Dailewicz ad Marci Dziuba Faculty of Electroics ad Telecommuicatios, Poza Uiversity of Techology, Poza, Polad

More information

Now here is the important step

Now here is the important step LINEST i Excel The Excel spreadsheet fuctio "liest" is a complete liear least squares curve fittig routie that produces ucertaity estimates for the fit values. There are two ways to access the "liest"

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

, a Wishart distribution with n -1 degrees of freedom and scale matrix.

, a Wishart distribution with n -1 degrees of freedom and scale matrix. UMEÅ UNIVERSITET Matematisk-statistiska istitutioe Multivariat dataaalys D MSTD79 PA TENTAMEN 004-0-9 LÖSNINGSFÖRSLAG TILL TENTAMEN I MATEMATISK STATISTIK Multivariat dataaalys D, 5 poäg.. Assume that

More information

Fast Fourier Transform and MATLAB Implementation

Fast Fourier Transform and MATLAB Implementation Fast Fourier Trasform ad MATLAB Implemetatio by aju Huag for Dr. Duca L. MacFarlae Sigals I the fields of commuicatios, sigal processig, ad i electrical egieerig moregeerally, a sigalisay time varyig or

More information

Plug-in martingales for testing exchangeability on-line

Plug-in martingales for testing exchangeability on-line Plug-i martigales for testig exchageability o-lie Valetia Fedorova, Alex Gammerma, Ilia Nouretdiov, ad Vladimir Vovk Computer Learig Research Cetre Royal Holloway, Uiversity of Lodo, UK {valetia,ilia,alex,vovk}@cs.rhul.ac.uk

More information

Permutations, the Parity Theorem, and Determinants

Permutations, the Parity Theorem, and Determinants 1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

More information

Estimating Probability Distributions by Observing Betting Practices

Estimating Probability Distributions by Observing Betting Practices 5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,

More information

Evaluating Model for B2C E- commerce Enterprise Development Based on DEA

Evaluating Model for B2C E- commerce Enterprise Development Based on DEA , pp.180-184 http://dx.doi.org/10.14257/astl.2014.53.39 Evaluatig Model for B2C E- commerce Eterprise Developmet Based o DEA Weli Geg, Jig Ta Computer ad iformatio egieerig Istitute, Harbi Uiversity of

More information

APPLICATION NOTE 30 DFT or FFT? A Comparison of Fourier Transform Techniques

APPLICATION NOTE 30 DFT or FFT? A Comparison of Fourier Transform Techniques APPLICATION NOTE 30 DFT or FFT? A Compariso of Fourier Trasform Techiques This applicatio ote ivestigates differeces i performace betwee the DFT (Discrete Fourier Trasform) ad the FFT(Fast Fourier Trasform)

More information

LOCATIONAL MARGINAL PRICING FRAMEWORK IN SECURED DISPATCH SCHEDULING UNDER CONTINGENCY CONDITION

LOCATIONAL MARGINAL PRICING FRAMEWORK IN SECURED DISPATCH SCHEDULING UNDER CONTINGENCY CONDITION IJRET: Iteratioal Joural of Research i Egieerig ad Techology eissn: 2319-1163 pissn: 2321-7308 LOCATIONAL MARGINAL PRICING FRAMEWORK IN SECURED DISPATCH SCHEDULING UNDER CONTINGENCY CONDITION R.Maiamda

More information

Quantitative Computer Architecture

Quantitative Computer Architecture Performace Measuremet ad Aalysis i Computer Quatitative Computer Measuremet Model Iovatio Proposed How to measure, aalyze, ad specify computer system performace or My computer is faster tha your computer!

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

NEW HIGH PERFORMANCE COMPUTATIONAL METHODS FOR MORTGAGES AND ANNUITIES. Yuri Shestopaloff,

NEW HIGH PERFORMANCE COMPUTATIONAL METHODS FOR MORTGAGES AND ANNUITIES. Yuri Shestopaloff, NEW HIGH PERFORMNCE COMPUTTIONL METHODS FOR MORTGGES ND NNUITIES Yuri Shestopaloff, Geerally, mortgage ad auity equatios do ot have aalytical solutios for ukow iterest rate, which has to be foud usig umerical

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

More information

Lesson 17 Pearson s Correlation Coefficient

Lesson 17 Pearson s Correlation Coefficient Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) -types of data -scatter plots -measure of directio -measure of stregth Computatio -covariatio of X ad Y -uique variatio i X ad Y -measurig

More information

Finding the circle that best fits a set of points

Finding the circle that best fits a set of points Fidig the circle that best fits a set of poits L. MAISONOBE October 5 th 007 Cotets 1 Itroductio Solvig the problem.1 Priciples............................... Iitializatio.............................

More information