Physics 310 Lecture 9a DAC and ADC

Size: px
Start display at page:

Download "Physics 310 Lecture 9a DAC and ADC"

Transcription

1 Lecture 9a ad Mo. 3/19 Wed. 3/1 Thurs. 3/ Fri. 3/3 Mo. 3/6 Wed. 3/8 Thurs. 3/9 h 14.1,.6-.10; pp (Samplig Frequecy); 1.6: & More of the same Lab 9: & More of the same; Quiz h 14 Project: ompoet Shoppig eview Exam Sr. Semiar Presetatios(quiz poits) Project Proposal HW 9: * & h 14 Pr 13*, 17* Lab 9 Notebook Project Progress eport (due at the begiig of class) oucemets: Project Proposals due Today Study List for Quiz #9: alog-to-digital coversio () How aalog iput ad digital output are related oversio times Nyquist criterio samplig rate igital-to-aalog coversio () Equatio List: Nyquist criterio: f sample f max Hadout: Lab #9 circuits Flash ( bit) Project order list 14.1 Itro: emember the very first readig for this class, it was about the array of measuremet devices ad actuators thigs that traslate a physical property like a legth, a time, a temperature, a pressure, ito a voltage, or traslate a voltage ito a force, a displacemet, ll of these devices deal with iheretly cotiuous properties ad so produce or respod to a cotiuum of voltages. alog circuitry is called for. O the other had, I do t have to sell you o the power of computers ad other digital devices whe it come to aalyzig iformatio, ad these are iheretly digital. So, if you wat to brig the power of a computer to bear o a measuremet or maipulatio task, the you eed to either covert the alog iformatio to igital iformatio or vice versa. That s the use of s (igital to alog overters) ad s (alog to igital overters). The mai poit of today s readig is that these thigs ca be doe, but you geerally wo t desig a circuit to do them istead you ll use I s. Still, it s importat to kow basically how they work, so you use them correctly / choose the right oes for your applicatios.

2 Lecture 9a ad You might imagie that s ad s are pretty mysterious ad sophisticated thigs. I actuality, most operate o pretty simple priciples. For digital to aalog essetially a adder where each bit lie s value cotrols a gate that does/does ot add i the correspodig voltage. For aalog to digital essetially comparators are used to determie whether each bit should be o or off. igital (iary) ackgroud from h 11 While it was i the readig for h 11, we did t really discuss biary, ad a appreciatio of it is ecessary for a appreciatio of what follows. So we ll pause to catch up o that Numberig Systems It s quite obvious that our old cotiuous-math circuits could represet ad maipulate a cotiuous rage of umeric values: the sigal ca be a voltage of or or That s particularly importat for smooth operatios like itegratio ad differetiatio. There are dowsides though; for example, adders ad itegrators ca t distiguish betwee sigal ad oise they add / itegrate whatever their iput is. log those lies, if you wat to represet umber to seve digits, you eed to have a sigal-to-oise ratio of 10 7! Now, it s quite obvious that our ew discrete-math circuits ca represet ad maipulate 0 s ad 1 s, but what may ot be immediately obvious is that, with 1 s ad 0 s they ca represet ay discrete umber to however may digits you re willig to hadle; the catch is that rather tha beig able to ecode the value i oe cotiuously varyig sigal, you ecode it i N discretely varyig sigals. We just have to represet that value i iary. ecimal a.k.a. ase 10 First let s quickly look at how we represet umbers i ecimal, the we ll see that it s ot so very differet i iary. The two freedoms we have for represetig differet umbers are symbols ad placemet of those symbols. First we step through our basis of te available symbols, 0-9, ad the, if that s ot eough, we add a place ad do it agai. So, whe we write 1,45 we ve ecoded the umeric value i the specific placemet of specific symbols 10 4 Te-thousads place 10 3 Thousads place 10 Hudreds place 10 1 Tes place 10 0 Oes place N M L K J meas N 10 4 M 10 3 L 10 K 10 1 J 10 0 where N,M,L,K,J ca be ay umeral from 0 to 9

3 Lecture 9a ad iary a.k.a. ase gai, we ve got the freedoms of symbols ad placemet with which to ecode a umber. Now, i iary we oly have a basis of two symbols, 0 ad 1. So rather tha havig to move up to the ext place after every 10 th symbol, we have to do it after every d symbol. 4 Sixtees place 3 Eights place Fours place 1 Twos place 0 Oes place N M L K J meas N 4 M 3 L K 1 J 0 Where N, M, L, K, J ca be 0 or 1. So, for example = = = 19 ocabulary it = oe biary digit (which meas oe electroic lie carryig oe sigal) yte = eight biary digits (which meas eight electroic lies, each carryig oe sigal) With eight places, largest value is = = =55 ad of course the smallest is From 0 up to 55, there are 56= 8 discrete possible values. You may have ecoutered this laguage 8 bit, 16 bit, 3bit ad 64bit whe people talk about computers. For example, you ca set your moitor to 16bit or 3bit color: 16 =65,536 shades or 3 =4,94,967,96 shades. 64bit logic meas that a value ca be represeted across 64 discrete lies. We ll get more experiece with this later, but just to relate this biary stuff back to our logic gates, here s a really simple operatio: addig two oe-bit umbers ad ecodig that as a twobit umber: s 1 s 0 Say = 0 ad = 0,the = zero Say = 1 ad = 0, or the other way aroud, the = oe

4 Lecture 9a ad Say = 1 ad = = two 14.6 igital to-alog overters: s Weighted urret Source Here s a very simple. Say you have a 4-bit sigal that s supposed to represet a umeric value i biary with four lies:. 1 s place s place 4 s place 8 s place oceptually, whe we traslate from a biary represetatio to a decimal represetatio, of, say That would represet 9. We add 1 8 (because those are the two lies that are Hi) to get 9. The the simple circuitry aalog is to have a adder that, usig some switches, decides whether or ot to add 1 to to 4 to 8: -10 1k k 800 4k - 8k The little boxes represet trasistor switches. For example, whe is Hi, the bottom switch is coected. So, if we have The the circuit is essetially

5 Lecture 9a ad k 8k So, out 8 10 i.1 1 f i. f Practical isadvatage: wide rage of resistors must be balaced ad a wide rage of currets pass through the switches which are, i practice, trasistors. The curret through the switch for the least sigificat bit (lie i this example) may be fairly large ad thus the capacitace across that switch could be fairly large which meas the switch could be slow. other issue is that resistors of differet values have to be balaced just right, ad that s hard to achieve. related approach would be usig curret sources istead of resistors. Of course, that s i effect what we re doig i the example above. - 8i 4i i i - f out f i f where i f is the sum of whichever currets are switched i. Note that my versio has a egative voltage supply; that s so out will be positive. lteratively, if the voltage supply is positive, out will be egative. The book gives a practical realizatio of a similar circuit (but with a positive voltage lie) usig trasistors ad diodes for the switches. Oe of the switched curret sources is essetially i Equivalet to 1. - Ladder Method Here s a variatio o the theme we re workig with; it addresses oe of the key issues the difficulty of balacig umptee differet resistors. This circuit maages to use just two differet resistor values: ad. Note: I ve tried to make the geometry more similar to that which we ve already see i our adders, but the logic is the same as i the book s versio.

6 Lecture 9a ad ref (d) (c) (b) - (a) So, how does this work? (Followig Faissler p ) 1) egardless of the positio of the switch, the right ed of each coects to groud (or a virtual groud thaks to the op-amp.) So the amout of curret passig through ay oe of these resistors is isesitive to the positio of ay of the switches. ) Just cosider the bottom braches, below ad to the right of poit (a). These two resistor are i parallel to each other, both coect (a) to groud. So, from the perspective of poit (a), there might as well just be a sigle resistor to groud. (a) Equivalet to (a) ut if that s true, the from poit (b) s perspective the circuit below ad to the right of it is equivalet to (b) d thus equivalet to (b)

7 Lecture 9a ad itto for poits (c) ad (d) ad, should we exted this circuit by addig more ad more braches, it would be true for their poits (e), (f), The moral is that each of these juctio poits sees itself as beig just 1 above groud whe it looks dowstream. Now, what does each poit see whe it looks up stream? 3) Now, poit (d) s voltage is clearly d = ref. a. The, from the perspective of poit (c), it s i the middle of a voltage divider so c= ½ d = ½ ref ref d = re (d) f (c) b. Similarly, from the perspective of poit (b), it s i the middle of a voltage divider so b = ½ c = ½½ ref = ¼ ref. c =1/ ref (c) (b) c. d the, of course, from the perspective of poit (a), it s i the middle of a voltage divider so a = ½ b =½ ¼ ref = 1 / 8 ref. b =1/4 ref (b) (a) Okay, labelig these poits with their voltage values, we ca see that we have somethig fairly simple.

8 Lecture 9a ad ref ref ½ ref ¼ ref - 1 / 8 ref The output is the just that of a adder with the appropriate iput voltages switched i ( ) ( ) ( ) ( out out ref ref ref 4 ref 8 ref ) Where,,, ad are either 1 or 0, depedig o whether their switches make the coectios. If ref = -16, the out has the value equivalet to the biary umber represeted by. out.max. For future referece, otice what the maximum output value is: out.max More geerally, if we had data lies / bits, the maximum output would be 1 out. max ref Multiplyig ad e-glitchig s The format of my fial expressio for out gives you a sese of why the - Ladder is classified as a multiplyig the output is the product of a referece voltage ad the logic ecoded i the digital sigal. eglitchig s are relatively expesive they largely compesate for dips i the sigal that occur whe a switch is switched.

9 Lecture 9a ad Summary: ommercial s feature the ecessary resistor etworks, the feedback resistor, f, ad sometimes the referece voltage source, but they do ot geerally cotai the op-amp. For example, ref L K J I H G F E igital gd fb f alog gd OUT1 - p.s. the i this part s ame are the iitials of the compay that makes it, alogue evices, ot a referece to the fuctio it performs that iformatio is mysteriously coveyed by the oversio: If a has digital lies, i.e. bits, comig i, the the largest value it ca represet is with all of them high. I simple biary, that correspods to a value of -1. Where does the -1 come from? osider this example: we have 4 bits so the largest biary umber is = 148=15=16-1= 4-1. The same thig happes i decimal: what s the largest umber that a - digit decimal display ca represet? 99 = = o yway, if this value would yield a full-scale output, the we ve got a coversio factor of out.max out Itegeri Itegeri.max Now, as we saw for the ladder scheme, out.max out Itegeri 1 1 out. max ref that meas that ref out Itegeri Two key qualities by which differet s are distiguished from each other are their resolutio ad their speed. esolutio: Ofte oe says that the resolutio of a or of a is the umber of bits it hadles,. This largely determies how smoothly the output of a ca vary or how small a differece a ca resolve. Sice the possible digital values are

10 Lecture 9a ad itegers, (1,, 3, ), obviously the steps i cosecutive digital values are size 1. The correspodig steps i the aalog output values are out.mi Itegeri.mi 1 out.mi o So that s the smallest differece this ca resolve. To put a value to that, a 1-bit with a 10 referece could output values i steps of.4m. For may purposes, that s as good as zero; it s as good as beig able to output a cotiuum of values. Settlig Time: This is the time it takes for a iput value to propagate through to the iteded output value. Geerally, it s o the order of s to s.

EE 505. Lecture 28. ADC Design SAR

EE 505. Lecture 28. ADC Design SAR EE 505 Lecture 28 ADC Desig SAR Review from Last Lecture Elimiatio of Iput S/H C LK X IN S/H Stage 1 r 1 Stage 2 r 2 Stage k r k Stage m r m 1 2 k m Pipelied Assembler (Shift Register

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the

More information

Number Representation

Number Representation Number Represetatio 1 Number System :: The Basics We are accustomed to usig the so-called decimal umber system Te digits :: 0,1,2,3,4,5,6,7,8,9 Every digit positio has a weight which is a power of 10 Base

More information

Signals & Systems Chapter3

Signals & Systems Chapter3 Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of

More information

EE260: Digital Design, Spring n MUX Gate n Rudimentary functions n Binary Decoders. n Binary Encoders n Priority Encoders

EE260: Digital Design, Spring n MUX Gate n Rudimentary functions n Binary Decoders. n Binary Encoders n Priority Encoders EE260: Digital Desig, Sprig 2018 EE 260: Itroductio to Digital Desig MUXs, Ecoders, Decoders Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Overview of Ecoder ad Decoder MUX Gate

More information

EE 505. Lecture 29. ADC Design. Oversampled

EE 505. Lecture 29. ADC Design. Oversampled EE 505 Lecture 29 ADC Desig Oversampled Review from Last Lecture SAR ADC V IN Sample Hold C LK V REF DAC DAC Cotroller DAC Cotroller stores estimates of iput i Successive Approximatio Register (SAR) At

More information

DESCRIPTION OF THE SYSTEM

DESCRIPTION OF THE SYSTEM Sychroous-Serial Iterface for absolute Ecoders SSI 1060 BE 10 / 01 DESCRIPTION OF THE SYSTEM TWK-ELEKTRONIK GmbH D-001 Düsseldorf PB 1006 Heirichstr. Tel +9/11/6067 Fax +9/11/6770 e-mail: ifo@twk.de Page

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES Peter M. Maurer Why Hashig is θ(). As i biary search, hashig assumes that keys are stored i a array which is idexed by a iteger. However, hashig attempts to bypass

More information

EE260: Digital Design, Spring n Binary Addition. n Complement forms. n Subtraction. n Multiplication. n Inputs: A 0, B 0. n Boolean equations:

EE260: Digital Design, Spring n Binary Addition. n Complement forms. n Subtraction. n Multiplication. n Inputs: A 0, B 0. n Boolean equations: EE260: Digital Desig, Sprig 2018 EE 260: Itroductio to Digital Desig Arithmetic Biary Additio Complemet forms Subtractio Multiplicatio Overview Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

OBJECTIVES. Chapter 1 INTRODUCTION TO INSTRUMENTATION FUNCTION AND ADVANTAGES INTRODUCTION. At the end of this chapter, students should be able to:

OBJECTIVES. Chapter 1 INTRODUCTION TO INSTRUMENTATION FUNCTION AND ADVANTAGES INTRODUCTION. At the end of this chapter, students should be able to: OBJECTIVES Chapter 1 INTRODUCTION TO INSTRUMENTATION At the ed of this chapter, studets should be able to: 1. Explai the static ad dyamic characteristics of a istrumet. 2. Calculate ad aalyze the measuremet

More information

ADVANCED DIGITAL SIGNAL PROCESSING

ADVANCED DIGITAL SIGNAL PROCESSING ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE

More information

MCT242: Electronic Instrumentation Lecture 2: Instrumentation Definitions

MCT242: Electronic Instrumentation Lecture 2: Instrumentation Definitions Faculty of Egieerig MCT242: Electroic Istrumetatio Lecture 2: Istrumetatio Defiitios Overview Measuremet Error Accuracy Precisio ad Mea Resolutio Mea Variace ad Stadard deviatio Fiesse Sesitivity Rage

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

Analysis of Experimental Measurements

Analysis of Experimental Measurements Aalysis of Experimetal Measuremets Thik carefully about the process of makig a measuremet. A measuremet is a compariso betwee some ukow physical quatity ad a stadard of that physical quatity. As a example,

More information

Shannon s noiseless coding theorem

Shannon s noiseless coding theorem 18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio

More information

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

EECE 301 Signals & Systems

EECE 301 Signals & Systems EECE 301 Sigals & Systems Prof. Mark Fowler Note Set #8 D-T Covolutio: The Tool for Fidig the Zero-State Respose Readig Assigmet: Sectio 2.1-2.2 of Kame ad Heck 1/14 Course Flow Diagram The arrows here

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

The Phi Power Series

The Phi Power Series The Phi Power Series I did this work i about 0 years while poderig the relatioship betwee the golde mea ad the Madelbrot set. I have fially decided to make it available from my blog at http://semresearch.wordpress.com/.

More information

Internal Information Representation and Processing

Internal Information Representation and Processing Iteral Iformatio Represetatio ad Processig CSCE 16 - Fudametals of Computer Sciece Dr. Awad Khalil Computer Sciece & Egieerig Departmet The America Uiversity i Cairo Decimal Number System We are used to

More information

x a x a Lecture 2 Series (See Chapter 1 in Boas)

x a x a Lecture 2 Series (See Chapter 1 in Boas) Lecture Series (See Chapter i Boas) A basic ad very powerful (if pedestria, recall we are lazy AD smart) way to solve ay differetial (or itegral) equatio is via a series expasio of the correspodig solutio

More information

Fourier Series and the Wave Equation

Fourier Series and the Wave Equation Fourier Series ad the Wave Equatio We start with the oe-dimesioal wave equatio u u =, x u(, t) = u(, t) =, ux (,) = f( x), u ( x,) = This represets a vibratig strig, where u is the displacemet of the strig

More information

SNAP Centre Workshop. Basic Algebraic Manipulation

SNAP Centre Workshop. Basic Algebraic Manipulation SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)

More information

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

FIR Filter Design: Part II

FIR Filter Design: Part II EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak

More information

ELE B7 Power Systems Engineering. Symmetrical Components

ELE B7 Power Systems Engineering. Symmetrical Components ELE B7 Power Systems Egieerig Symmetrical Compoets Aalysis of Ubalaced Systems Except for the balaced three-phase fault, faults result i a ubalaced system. The most commo types of faults are sigle liegroud

More information

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3 ELEC2: A System View of Commuicatios: from Sigals to Packets Lecture 3 Commuicatio chaels Discrete time Chael Modelig the chael Liear Time Ivariat Systems Step Respose Respose to sigle bit Respose to geeral

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity

More information

SYDE 112, LECTURE 2: Riemann Sums

SYDE 112, LECTURE 2: Riemann Sums SYDE, LECTURE : Riema Sums Riema Sums Cosider the problem of determiig the area below the curve f(x) boud betwee two poits a ad b. For simple geometrical fuctios, we ca easily determie this based o ituitio.

More information

ANALYSIS OF EXPERIMENTAL ERRORS

ANALYSIS OF EXPERIMENTAL ERRORS ANALYSIS OF EXPERIMENTAL ERRORS All physical measuremets ecoutered i the verificatio of physics theories ad cocepts are subject to ucertaities that deped o the measurig istrumets used ad the coditios uder

More information

Part I: Covers Sequence through Series Comparison Tests

Part I: Covers Sequence through Series Comparison Tests Part I: Covers Sequece through Series Compariso Tests. Give a example of each of the followig: (a) A geometric sequece: (b) A alteratig sequece: (c) A sequece that is bouded, but ot coverget: (d) A sequece

More information

The Binomial Theorem

The Binomial Theorem The Biomial Theorem Robert Marti Itroductio The Biomial Theorem is used to expad biomials, that is, brackets cosistig of two distict terms The formula for the Biomial Theorem is as follows: (a + b ( k

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

Hashing and Amortization

Hashing and Amortization Lecture Hashig ad Amortizatio Supplemetal readig i CLRS: Chapter ; Chapter 7 itro; Sectio 7.. Arrays ad Hashig Arrays are very useful. The items i a array are statically addressed, so that isertig, deletig,

More information

HOMEWORK #10 SOLUTIONS

HOMEWORK #10 SOLUTIONS Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous

More information

EE 435. Lecture 25. Data Converters. Architectures. Characterization

EE 435. Lecture 25. Data Converters. Architectures. Characterization EE 435 Lecture 5 Data Coverters Architectures Characterizatio . eview from last lecture. Data Coverters Types: A/D (Aalog to Digital) Coverts Aalog Iput to a Digital Output D/A (Digital to Aalog) Coverts

More information

Exponents. Learning Objectives. Pre-Activity

Exponents. Learning Objectives. Pre-Activity Sectio. Pre-Activity Preparatio Epoets A Chai Letter Chai letters are geerated every day. If you sed a chai letter to three frieds ad they each sed it o to three frieds, who each sed it o to three frieds,

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

The Scattering Matrix

The Scattering Matrix 2/23/7 The Scatterig Matrix 723 1/13 The Scatterig Matrix At low frequecies, we ca completely characterize a liear device or etwork usig a impedace matrix, which relates the currets ad voltages at each

More information

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded

More information

Probability, Expectation Value and Uncertainty

Probability, Expectation Value and Uncertainty Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such

More information

NUMERICAL METHODS COURSEWORK INFORMAL NOTES ON NUMERICAL INTEGRATION COURSEWORK

NUMERICAL METHODS COURSEWORK INFORMAL NOTES ON NUMERICAL INTEGRATION COURSEWORK NUMERICAL METHODS COURSEWORK INFORMAL NOTES ON NUMERICAL INTEGRATION COURSEWORK For this piece of coursework studets must use the methods for umerical itegratio they meet i the Numerical Methods module

More information

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics: Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals (which is what most studets

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5 CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio

More information

UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 17 Lecturer: David Wagner April 3, Notes 17 for CS 170

UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 17 Lecturer: David Wagner April 3, Notes 17 for CS 170 UC Berkeley CS 170: Efficiet Algorithms ad Itractable Problems Hadout 17 Lecturer: David Wager April 3, 2003 Notes 17 for CS 170 1 The Lempel-Ziv algorithm There is a sese i which the Huffma codig was

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the

More information

Arithmetic Circuits. (Part I) Randy H. Katz University of California, Berkeley. Spring 2007

Arithmetic Circuits. (Part I) Randy H. Katz University of California, Berkeley. Spring 2007 rithmetic Circuits (Part I) Rady H. Katz Uiversity of Califoria, erkeley prig 27 Lecture #23: rithmetic Circuits- Motivatio rithmetic circuits are excellet examples of comb. logic desig Time vs. pace Trade-offs

More information

Induction: Solutions

Induction: Solutions Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For

More information

Lecture 6: Integration and the Mean Value Theorem. slope =

Lecture 6: Integration and the Mean Value Theorem. slope = Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech 202 The Mea Value Theorem The Mea Value Theorem abbreviated MVT is the followig result: Theorem. Suppose

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

Kinetics of Complex Reactions

Kinetics of Complex Reactions Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet

More information

Chapter 7: Numerical Series

Chapter 7: Numerical Series Chapter 7: Numerical Series Chapter 7 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals

More information

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0. MAS6: Sigals, Systems & Iformatio for Media Techology Problem Set 5 DUE: November 3, 3 Istructors: V. Michael Bove, Jr. ad Rosalid Picard T.A. Jim McBride Problem : Uit-step ad ruig average (DSP First

More information

Complex Numbers Primer

Complex Numbers Primer Before I get started o this let me first make it clear that this documet is ot iteded to teach you everythig there is to kow about complex umbers. That is a subject that ca (ad does) take a whole course

More information

The Born-Oppenheimer approximation

The Born-Oppenheimer approximation The Bor-Oppeheimer approximatio 1 Re-writig the Schrödiger equatio We will begi from the full time-idepedet Schrödiger equatio for the eigestates of a molecular system: [ P 2 + ( Pm 2 + e2 1 1 2m 2m m

More information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

More information

NUMERICAL METHODS FOR SOLVING EQUATIONS

NUMERICAL METHODS FOR SOLVING EQUATIONS Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:

More information

mx bx kx F t. dt IR I LI V t, Q LQ RQ V t,

mx bx kx F t. dt IR I LI V t, Q LQ RQ V t, Lecture 5 omplex Variables II (Applicatios i Physics) (See hapter i Boas) To see why complex variables are so useful cosider first the (liear) mechaics of a sigle particle described by Newto s equatio

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

Overview EECS Components and Design Techniques for Digital Systems. Lec 15 Addition, Subtraction, and Negative Numbers. Positional Notation

Overview EECS Components and Design Techniques for Digital Systems. Lec 15 Addition, Subtraction, and Negative Numbers. Positional Notation Overview EEC 5 Compoets ad Desig Techiques for Digital ystems Lec 5 dditio, ubtractio, ad Negative Numbers David Culler Electrical Egieerig ad Computer cieces Uiversity of Califoria, erkeley Recall basic

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

100m m 01.0

100m m 01.0 EKT Priciples of Measureet ad struetatio Se. 0/0 Solutio Tutorial (Chapter ) Q. (a) Briefly discuss the operatio of a Peraet Maget Movig Coil (PMMC) oveet ad also describe TWO() advatages of PMMC. PMMC

More information

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

if j is a neighbor of i,

if j is a neighbor of i, We see that if i = j the the coditio is trivially satisfied. Otherwise, T ij (i) = (i)q ij mi 1, (j)q ji, ad, (i)q ij T ji (j) = (j)q ji mi 1, (i)q ij. (j)q ji Now there are two cases, if (j)q ji (i)q

More information

Number of fatalities X Sunday 4 Monday 6 Tuesday 2 Wednesday 0 Thursday 3 Friday 5 Saturday 8 Total 28. Day

Number of fatalities X Sunday 4 Monday 6 Tuesday 2 Wednesday 0 Thursday 3 Friday 5 Saturday 8 Total 28. Day LECTURE # 8 Mea Deviatio, Stadard Deviatio ad Variace & Coefficiet of variatio Mea Deviatio Stadard Deviatio ad Variace Coefficiet of variatio First, we will discuss it for the case of raw data, ad the

More information

Complex Numbers Primer

Complex Numbers Primer Complex Numbers Primer Complex Numbers Primer Before I get started o this let me first make it clear that this documet is ot iteded to teach you everythig there is to kow about complex umbers. That is

More information

Quantum Information & Quantum Computation

Quantum Information & Quantum Computation CS9A, Sprig 5: Quatum Iformatio & Quatum Computatio Wim va Dam Egieerig, Room 59 vadam@cs http://www.cs.ucsb.edu/~vadam/teachig/cs9/ Admiistrivia Do the exercises. Aswers will be posted at the ed of the

More information

Lecture 6: Integration and the Mean Value Theorem

Lecture 6: Integration and the Mean Value Theorem Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech - Fall, 2011 1 Radom Questios Questio 1.1. Show that ay positive ratioal umber ca be writte as the sum of

More information

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer. SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

DISTRIBUTION LAW Okunev I.V.

DISTRIBUTION LAW Okunev I.V. 1 DISTRIBUTION LAW Okuev I.V. Distributio law belogs to a umber of the most complicated theoretical laws of mathematics. But it is also a very importat practical law. Nothig ca help uderstad complicated

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

Chapter 6 Part 5. Confidence Intervals t distribution chi square distribution. October 23, 2008

Chapter 6 Part 5. Confidence Intervals t distribution chi square distribution. October 23, 2008 Chapter 6 Part 5 Cofidece Itervals t distributio chi square distributio October 23, 2008 The will be o help sessio o Moday, October 27. Goal: To clearly uderstad the lik betwee probability ad cofidece

More information

( ) = p and P( i = b) = q.

( ) = p and P( i = b) = q. MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces

More information

Let us consider the following problem to warm up towards a more general statement.

Let us consider the following problem to warm up towards a more general statement. Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math

More information

Activity 3: Length Measurements with the Four-Sided Meter Stick

Activity 3: Length Measurements with the Four-Sided Meter Stick Activity 3: Legth Measuremets with the Four-Sided Meter Stick OBJECTIVE: The purpose of this experimet is to study errors ad the propagatio of errors whe experimetal data derived usig a four-sided meter

More information

U8L1: Sec Equations of Lines in R 2

U8L1: Sec Equations of Lines in R 2 MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie

More information

INTEGRATION BY PARTS (TABLE METHOD)

INTEGRATION BY PARTS (TABLE METHOD) INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary

More information

PROPERTIES OF AN EULER SQUARE

PROPERTIES OF AN EULER SQUARE PROPERTIES OF N EULER SQURE bout 0 the mathematicia Leoard Euler discussed the properties a x array of letters or itegers ow kow as a Euler or Graeco-Lati Square Such squares have the property that every

More information

PH 425 Quantum Measurement and Spin Winter SPINS Lab 1

PH 425 Quantum Measurement and Spin Winter SPINS Lab 1 PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured

More information

R is a scalar defined as follows:

R is a scalar defined as follows: Math 8. Notes o Dot Product, Cross Product, Plaes, Area, ad Volumes This lecture focuses primarily o the dot product ad its may applicatios, especially i the measuremet of agles ad scalar projectio ad

More information

CS161: Algorithm Design and Analysis Handout #10 Stanford University Wednesday, 10 February 2016

CS161: Algorithm Design and Analysis Handout #10 Stanford University Wednesday, 10 February 2016 CS161: Algorithm Desig ad Aalysis Hadout #10 Staford Uiversity Wedesday, 10 February 2016 Lecture #11: Wedesday, 10 February 2016 Topics: Example midterm problems ad solutios from a log time ago Sprig

More information

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io Chapter 9 - CD compaio CHAPTER NINE CD-9.2 CD-9.2. Stages With Voltage ad Curret Gai A Geeric Implemetatio; The Commo-Merge Amplifier The advaced method preseted i the text for approximatig cutoff frequecies

More information

Bipolar Junction Transistors

Bipolar Junction Transistors ipolar Juctio Trasistors ipolar juctio trasistor (JT) was iveted i 948 at ell Telephoe Laboratories Sice 97, the high desity ad low power advatage of the MOS techology steadily eroded the JT s early domiace.

More information

Recitation 4: Lagrange Multipliers and Integration

Recitation 4: Lagrange Multipliers and Integration Math 1c TA: Padraic Bartlett Recitatio 4: Lagrage Multipliers ad Itegratio Week 4 Caltech 211 1 Radom Questio Hey! So, this radom questio is pretty tightly tied to today s lecture ad the cocept of cotet

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information