Quantization and Analog to Digital Conversion
|
|
- Arnold Webster
- 7 years ago
- Views:
Transcription
1 Chapter 10 Quatizatio ad Aalog to Digital Coverio I all thi cla we have examied dicrete-time equece repreeted a a equece of complex (ifiite preciio) umber. Clearly we have bee dicuig implemetatio of may of thee method o a computer. However, to repreet thee equece o a computer, we ca oly do o with fiite preciio uig bit. herefore we would eed to repreet thee (ifiite preciio) complex umber approximately uig a fiite umber of bit. hi repreetatio i called quatizatio ad i fudametal to the implemetatio of ay igal proceig techique o a digital computer Quatizer he quatizer i a o-liear ytem whoe repoe i illutrated i Figure It traform the (ifiite preciio) iput ito a fiite et of precribed value. he quatizer illutrated i Figure 10.1 i called a uiform quatizer, but oe ca alo have o-uiformly paced quatizatio level. We repreet the quatizatio operatio by ˆx[] = Q(x[]), (10.1) where ˆx[] i the quatized ample. For a uiform quatizer, we ca divide the iterval [ A,A] ito 2 b ub-iterval to be able to repreet iput i the rage [ A,A] through b bit a follow. We defie k th ub-iterval a, [ I k = A + ka (k + 1)A 2b 1, A + 2 b 1 he we ca defie the quatizatio fuctio Q( ) a, ˆx[] = Q(x[]) = A + ), k = 0,,2 b 1 (10.2) (k + 1/2)A 2 b 1, (10.3) 143
2 144 Chapter 10. Figure 10.1: ypical quatizer for aalog-to-digital (A/D) coverio. Coverio of iput x ito 8 level repreetable by 3 bit. where x[] I k. Clearly the error icurred i uch a repreetatio if = A/2 b 1 i i.e., or e[] = ˆx[] x[] [ /2, /2), (10.4) /2 e[] < /2, e[] /2 = A 2b. (10.5) Example 10.1 If a igal x[] [ 1,1], i.e. A = 1, ad b = 8, i.e. we have 2 b = 256 ub-iterval, the [ I k = 1 + k 128, 1 + k + 1 ), k = 0,, Alo = = yieldig e[]
3 10.2. Digital-to-Aalog coverio ad iterpolatio Digital-to-Aalog coverio ad iterpolatio Give that we repreet equece uig a quatizer, the repreetatio of x[] i replaced by ˆx[] = Q(x[]). Now if we wat to recotruct the cotiuou-time igal, we kow from optimal iterpolatio that, x r (t) = ( ) t x[] ic, where ic(x) = i(πx) πx, ad i the amplig period. If we oly have acce to the quatized dicrete-time igal, a atural recotructio would be x DA (t) = ( ) t ˆx[] ic (10.6) = ( ) t x[] ic + ( ) t e[] ic. } {{ } } {{ } x r(t) e r(t) Clearly the recotructio error igal due to quatizatio i e r (t). Aother apect of importace to A/D ad D/A coverio i to limit the amplitude of the iput igal to the iterval to which the quatizer operate. hi idea i illutrated i Figure 10.2 where the ampled igal i clipped to lie i iterval [ A,A]. Figure 10.2: Aalog-to-digital coverio with iput clippig Applicatio of quatizatio to compreio Beide the repreetatio of dicrete-time igal i a digital computer for igal proceig operatio, quatizatio could alo be ued for repreetig (efficietly) phyical igal for torage ad tramiio. For example, we had ee the perceptual model for the auditory ytem where the huma
4 146 Chapter 10. ear wa le tolerat to diturbace i the lower frequecy rage tha at higher frequecy rage. hi could be ued to more efficietly repreet a phyical audio igal digitally while reducig the effect of quatizatio error i huma perceptio. Example 10.2 Suppoe we ample the audio igal at 44.1kHz ad each ample i quatized uig a 16-bit quatizer. he we eed for oe ecod of audio, which ha ample, = 705,600 = bit, which form a baelie of compario. Itead, oe ca utilize the perceptual model ad plit the audio igal ito ub-bad a illutrated i Figure I thi cae, we ca allocate differet umber of bit for each of the output of the ub-bad to get a more compact (compreed) repreetatio of the audio igal. hi idea i called ub-bad codig ad form the bai for digital audio uch a MP3. Figure 10.3: Sub-bad codig of audio igal Example 10.3 For the ub-bad ytem repreeted i Figure 10.3, let H 0 ( e jω ) be a ideal low-pa filter with badwidth π/2, i.e. H 0 ( e jω ) = 0, ω > π/2 ( ad H 1 e jω ) ( i a ideal high-pa filter with H 1 e jω ) = 0, ω < π/2. he phyically thee filter focu o the bad kHz ad kHz repectively. Now, if we allocate a 16-bit quatizer to v 0 [] ad a 4-bit quatizer to v 1 [], we ee the followig repreetatio i bit. We have for oe ecod of audio ample of x[]. After dowamplig we have ample each of v 0 [] ad v 1 []. herefore the repreetatio ˆv 0 [] ad ˆv 1 [] would eed, = = = bit,
5 10.4. Overampled aalog-to-digital coverio 147 which i a reductio over jut quatizig the origial audio igal. hi repreet a avig i torage with little perceptual error ice we utilize the auditory model for huma ear. he baic priciple illutrated i the above example form the bai for mot moder digital audio coder. Such a ub-bad coder i implemeted uig may more ub-bad alog with careful choice of filter ad quatizer i digital audio tadard uch a i MP Overampled aalog-to-digital coverio We had ee i oe of the motivatio for multirate igal proceig that amplig at a rate higher tha the miimum rate eeded, (i.e. amplig at a rate larger tha twice the igal badwidth) might have ueful practical applicatio. I particular, we aw that amplig at a higher rate tha eceary (alo called overamplig) make it poible to ue a le triget aalog ati-aliaig filter. Moreover, oe ca do dowamplig ad filterig i the dicrete-time domai which i eaier to implemet i practice. I thi ectio we explore aother ue of overamplig which i i combiatio with quatizatio. We will ee that overamplig ad ubequet dicrete-time filterig ad dowamplig permit a icreae i the tepize of the quatizer, or, equivaletly, a reductio i the umber of bit required i the aalog-to-digital coverio. o explore the relatiohip betwee overamplig ad quatizatio tepize, we coider the ytem i Figure Aalog to digital coverio amplig rate coverio cut-off: ω c = π N x c(t) Cotiuou to Dicrete time x[] Qatizer Low pa filter N amplig rate = Figure 10.4: Sub-bad codig of audio igal We aume that the igal badwidth of x c (t) i Ω N, ad hece the miimum amplig rate eeded accordig to amplig theorem i 2Ω N. We aume that we ample at N time the required rate, i.e. ( 2π = 2Ω N ) 1 N. (10.7)
6 148 Chapter 10. hi cotat N i called the overamplig ratio ad i aumed to be a iteger. he aalyi of uch a ytem i o-trivial, though the ituitio i clear. If the quatizatio error i radom, the ome of it effect will be removed through thi procedure. Aother way to udertad the advatage i through decribig the cotiuoutime igal through differece. Whe we did quatizatio, we imply repreeted the dicrete-time igal at a give time itat, i.e. ˆx[] = Q(x[]). herefore, the umber of bit eeded for the ame maximal quatizatio error depeded o the rage of value take by x[], i.e. it dyamic rage. If x[] [ A, A], the for a maximal error of /2, i.e. x[] ˆx[] /2 we eeded 2 b = 2A/ or ( ) 2A b = log 2 bit. herefore, if we are able to reduce the dyamic rage A, we ca reduce the umber of bit b, eeded for the ame maximal error i quatizatio. he baic idea of reducig the dyamic rage lead u to coider a differetial quatizatio, i.e. itead of quatizig x[] we quatize d[] = x[] x[ 1]. Now it i clear that if we ample at a higher rate, the dyamic rage of d[] i maller.
Confidence Intervals for Linear Regression Slope
Chapter 856 Cofidece Iterval for Liear Regreio Slope Itroductio Thi routie calculate the ample ize eceary to achieve a pecified ditace from the lope to the cofidece limit at a tated cofidece level for
More informationTopic 5: Confidence Intervals (Chapter 9)
Topic 5: Cofidece Iterval (Chapter 9) 1. Itroductio The two geeral area of tatitical iferece are: 1) etimatio of parameter(), ch. 9 ) hypothei tetig of parameter(), ch. 10 Let X be ome radom variable with
More informationInfinite 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 informationCooley-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 informationCHAPTER 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 informationTI-89, TI-92 Plus or Voyage 200 for Non-Business Statistics
Chapter 3 TI-89, TI-9 Plu or Voyage 00 for No-Buie Statitic Eterig Data Pre [APPS], elect FlahApp the pre [ENTER]. Highlight Stat/Lit Editor the pre [ENTER]. Pre [ENTER] agai to elect the mai folder. (Note:
More information4.3. The Integral and Comparison Tests
4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece
More informationOn Formula to Compute Primes. and the n th Prime
Applied Mathematical cieces, Vol., 0, o., 35-35 O Formula to Compute Primes ad the th Prime Issam Kaddoura Lebaese Iteratioal Uiversity Faculty of Arts ad cieces, Lebao issam.kaddoura@liu.edu.lb amih Abdul-Nabi
More informationHANDOUT E.17 - EXAMPLES ON BODE PLOTS OF FIRST AND SECOND ORDER SYSTEMS
Lecture 7,8 Augut 8, 00 HANDOUT E7 - EXAMPLES ON BODE PLOTS OF FIRST AND SECOND ORDER SYSTEMS Example Obtai the Bode plot of the ytem give by the trafer fuctio ( We covert the trafer fuctio i the followig
More informationProperties 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 informationTI-83, TI-83 Plus or TI-84 for Non-Business Statistics
TI-83, TI-83 Plu or TI-84 for No-Buie Statitic Chapter 3 Eterig Data Pre [STAT] the firt optio i already highlighted (:Edit) o you ca either pre [ENTER] or. Make ure the curor i i the lit, ot o the lit
More informationYour 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 informationTHE 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 informationMultiplexers 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 informationBasic 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 informationA 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 informationSection 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 informationTheorems 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 informationChair 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 informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More informationRunning 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 informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
More informationAll Digital Timing Recovery and FPGA Implementation
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
More informationSAMPLE 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 informationOn k-connectivity and Minimum Vertex Degree in Random s-intersection Graphs
O k-coectivity ad Miimum Vertex Degree i Radom -Iterectio Graph Ju Zhao Oma Yağa Virgil Gligor CyLab ad Dept. of ECE Caregie Mello Uiverity Email: {juzhao, oyaga, virgil}@adrew.cmu.edu Abtract Radom -iterectio
More information0.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 informationDomain 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 informationTaking 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 informationEkkehart 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 informationLecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular
More informationCS100: Introduction to Computer Science
Review: History of Computers CS100: Itroductio to Computer Sciece Maiframes Miicomputers Lecture 2: Data Storage -- Bits, their storage ad mai memory Persoal Computers & Workstatios Review: The Role of
More informationOutput 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 informationOur aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the
More information3. Greatest Common Divisor - Least Common Multiple
3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More informationChapter 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 informationMaximum Likelihood Estimators.
Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio
More informationMathematical Needs for Behavioral Modeling of Telecommunication Circuits and Systems (First Part Model Formulation)
Mathematical Need for Behavioral Modelig of Telecommuicatio Circuit ad Sytem Firt Part Model Formulatio Joé Carlo Pedro Itituto de Telecomuicaçõe Uiveridade de Aveiro Portugal Mathematical Techiue ad Problem
More information3D BUILDING MODEL RECONSTRUCTION FROM POINT CLOUDS AND GROUND PLANS
3D BUILDING MODEL RECONSTRUCTION FROM POINT CLOUDS AND GROUND PLANS George Voelma ad Sader Dijkma Departmet of Geodey Delft Uiverity of Techology The Netherlad g.voelma@geo.tudelft.l KEY WORDS: Buildig
More informationConfidence 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 informationChapter 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 informationIn 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 informationResearch 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 informationMeasures of Spread and Boxplots Discrete Math, Section 9.4
Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,
More informationLecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationDiscrete 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 informationCHAPTER 11 Financial mathematics
CHAPTER 11 Fiacial mathematics I this chapter you will: Calculate iterest usig the simple iterest formula ( ) Use the simple iterest formula to calculate the pricipal (P) Use the simple iterest formula
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationTHE PRINCIPLE OF THE ACTIVE JMC SCATTERER. Seppo Uosukainen
THE PRINCIPLE OF THE ACTIVE JC SCATTERER Seppo Uoukaie VTT Buildig ad Tapot Ai Hadlig Techology ad Acoutic P. O. Bo 1803, FIN 02044 VTT, Filad Seppo.Uoukaie@vtt.fi ABSTRACT The piciple of fomulatig the
More informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least
More informationhp 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 informationLecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The
More informationDomain 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 informationCantilever 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 informationCHAPTER 7: Central Limit Theorem: CLT for Averages (Means)
CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:
More informationLesson 15 ANOVA (analysis of variance)
Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi
More informationGCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.
GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea - add up all
More informationSequences 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 informationAn Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function
A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;
More informationNormal 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 informationStudy 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 informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More information1 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 informationModified 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 informationData Layout Optimization for Petascale File Systems
Data Layout Optimizatio for Petacale File Sytem Xia-He Su Illioi Ititute of Techology u@iit.edu Yog Che Illioi Ititute of Techology yog.che@iit.edu Yalog Yi Illioi Ititute of Techology yyi@iit.edu ABSTRACT
More informationThe following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles
The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio
More informationOverview 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 information5 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 informationAsymptotic 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 informationSoving 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 informationTrigonometric 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 informationPartial Di erential Equations
Partial Di eretial Equatios Partial Di eretial Equatios Much of moder sciece, egieerig, ad mathematics is based o the study of partial di eretial equatios, where a partial di eretial equatio is a equatio
More informationTradigms 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 informationOn the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions
O the Geeraliatio Ability of Olie Learig Algorithm for Pairwie Lo Fuctio Puruhottam Kar puruhot@ce.iitk.ac.i Departmet of Computer Sciece ad gieerig, Idia Ititute of Techology, Kapur, UP 208 06, INDIA.
More information1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
More informationProject Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please
More informationAPPLICATION 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 informationwhere: 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.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth
Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,
More informationA Secure Implementation of Java Inner Classes
A Secure Implemetatio of Java Ier Classes By Aasua Bhowmik ad William Pugh Departmet of Computer Sciece Uiversity of Marylad More ifo at: http://www.cs.umd.edu/~pugh/java Motivatio ad Overview Preset implemetatio
More informationVladimir 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 informationSECTION 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 informationCS100: Introduction to Computer Science
I-class Exercise: CS100: Itroductio to Computer Sciece What is a flip-flop? What are the properties of flip-flops? Draw a simple flip-flop circuit? Lecture 3: Data Storage -- Mass storage & represetig
More informationRainbow options. A rainbow is an option on a basket that pays in its most common form, a nonequally
Raibow optios INRODUCION A raibow is a optio o a basket that pays i its most commo form, a oequally weighted average of the assets of the basket accordig to their performace. he umber of assets is called
More information5.3. Generalized Permutations and Combinations
53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible
More informationNATIONAL SENIOR CERTIFICATE GRADE 12
NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS
More informationUniversal coding for classes of sources
Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric
More informationMath C067 Sampling Distributions
Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters
More information1. 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 informationExample 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 informationSampling Distribution And Central Limit Theorem
() Samplig Distributio & Cetral Limit Samplig Distributio Ad Cetral Limit Samplig distributio of the sample mea If we sample a umber of samples (say k samples where k is very large umber) each of size,
More informationEstimating 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 informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationSubject CT5 Contingencies Core Technical Syllabus
Subject CT5 Cotigecies Core Techical Syllabus for the 2015 exams 1 Jue 2014 Aim The aim of the Cotigecies subject is to provide a groudig i the mathematical techiques which ca be used to model ad value
More information, 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 informationPOWER ANALYSIS OF INDEPENDENCE TESTING FOR CONTINGENCY TABLES
ZESZYTY NAUKOWE AKADEMII MARYNARKI WOJENNEJ SCIENTIFIC JOURNAL OF POLISH NAVAL ACADEMY 05 (LVI) (00) Piotr Sulewki, Ryzard Motyka DOI: 0.5604/0860889X.660 POWER ANALYSIS OF INDEPENDENCE TESTING FOR CONTINGENCY
More informationCHAPTER 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 informationTHE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE
THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE JAVIER CILLERUELO Abstract. We obtai, for ay irreducible quadratic olyomial f(x = ax 2 + bx + c, the asymtotic estimate log l.c.m. {f(1,..., f(} log. Whe
More informationBuilding Blocks Problem Related to Harmonic Series
TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite
More information