EE 505. Lecture 28. ADC Design SAR
|
|
- Frederick Walton
- 6 years ago
- Views:
Transcription
1 EE 505 Lecture 28 ADC Desig SAR
2 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 <b 1 > <b 2 > <b k > Pipelied Assembler (Shift Register Array) <b m > X OUT C LK X IN Stage 1 r 1 Stage 2 r 2 Stage k r k Stage m r m 1 2 k m <b 1 > <b 2 > <b k > Pipelied Assembler (Shift Register Array) <b m > X OUT Advace samplig clock a little so that sample is take at quiet time but ot too much to loose over-rage protectio 2
3 Review from Last Lecture Pipelied Data Coverter Desig Issue 1. ADC offsets, Amp Offsets, Fiite Op Amp Gai, errors, Fiite Gai Errors all cause amplifiers to saturate 2. Correct iterpretatio of α k s is critical Guidelies Strategy 1. Out-rage protectio circuitry will remove this problem ad ca make pipelie robust to these effects if α k s correctly iterpreted a) Use Extra Comparators b) Use sub-radix structures 2. a) Accurately set α k values b) Use aalog or digital calibratio 3. Op Amp Gai causes fiite gai errors ad itroduces oiearity 4. Op amp settlig must ca cause errors 5. Power dissipatio strogly depedet upo GB of Op Amps 6. Choice of FB Amplifier Architecture seriously impacts performace 3. a) Select op amp architecture that has acceptable sigal swig b) Select gai large eough at boudary of rage to miimize oliearity ad gai errors 4. Select GB to meet settlig requiremets (degrade modestly to accout for slewig) 5. Miimize C L, use eergy efficiet op amps, share or shut dow op amp whe ot used,scale power i latter stages, elimiate iput S/H if possible, iterleave at high frequecies 6. Bottom plate samplig, bootatrappig, clock advace to reduce aperature ucertaity,critical GB, parasitic isesitivity eeded, β depedet upo architecture ad phase, compesatio for worst-case β, TG if eeded 3
4 Pipelied Data Coverter Desig Guidelies Issue 7. Samplig operatio iheretly itroduces a sampled-oise due to oise i resistors Strategy 7. Select the capacitor sizes to meet oise requiremets. Cotiuous-time oise ca also be preset but is ofte domiated by sampled oise. Size switches to meet settlig ad oise requiremets. Excessive GB will cause oise degradatio i some applicatios, iclude oise from all stages (ot just first stage). 8. Sigal-depedet trackig errors at iput itroduce liearity degradatio 8. Bootstrapped switches almost always used at iput stage. Must avoid stressig oxide o bootstrapped switches 9. Aperature ucertaity ca cause serious errors 10. Iput S/H major cotributor to oliearity ad power dissipatio 9. Sice latecy usually of little cocer, be sure that a clea clock is used to cotrol all samplig. 10. Elimiate S/H but provide adequate over-rage protectio for this removal. Reduces power dissipatio ad improves liearity! 4
5 Review from Last Lecture Cyclic (Algorithmic) ADCs C LK X IN S/H Stage 1 r 1,r 2,.r m-1 1, 1,... 1 <b 1 > <b 2 > <b m > Pipelied Assembler (Shift Register Array) C LK C LK X IN S/H Stage 1 1 r X IN Stage 1 r 1 Pipelied Assembler (Shift Register Array) Pipelied Assembler (Shift Register Array) 5
6 Sample Hold SAR ADC C LK Cotroller Cotroller stores estimates of iput i Successive Approximatio Register (SAR) At ed of successive approximatio process, ADC output is i SAR Elimiates the power-cosumig amplifiers of the pipelied ADC Much slower tha pipelied ADC S/H at the iput is essetial Ca have excellet power performace Widely used structure with reewed attetio i recet years 6
7 Sample Hold C LK Cotroller Ay structure ca be used I basic structure, sigle comparator ca be used Performace etirely determied by S/H,, ad comparator Very simple structure ad relatively fast desig procedure If offset voltage of comparator is fixed, comparator offset will ot itroduce ay oliearity 7
8 Sample Hold C LK Cotroller Ay structure ca be used I basic structure, sigle comparator ca be used Performace etirely determied by S/H,, ad comparator Very simple structure ad relatively fast desig procedure If offset voltage of comparator is fixed, comparator offset will ot itroduce ay oliearity 8
9 C LK Typical Operatio (show for 5 bits) Sample Hold Cotroller T CLK t Requires +1 clock cycles Ca be exteded to large umber of bits (16 or more) Comparator requires large CM rage Speed limited by S/H S/H Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 S/H SOC EOC 9
10 C LK Typical Operatio (show for 5 bits) Sample Hold Cotroller t T CLK S/H Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 S/H SOC EOC Two or more bit periods ca be added to S/H Slows overall operatio proportioally but overhead small for large 10
11 Sample Hold CLK Does ot recover from errors Particularly problematic whe errors occur o earlier bits Over-rage protectio ca be added but at expese of additioal clock periods Cotroller Output t Error o First Coversio Output t T CLK T CLK S/H Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 S/H S/H Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 S/H SOC EOC SOC EOC 11
12 Sample Hold C LK Cotroller Charge Redistributio could be used i SAR ADCs V OUT C 1 C 2 C 3 C C R ST S 1 S 2 S 3 S V RFF Capacitors usually biary weighted With this, typical commo-mode iput required for comparator Stadard S/H also required 12
13 Sample Hold C LK Alterate Charge Redistributio Cotroller V C C 1 C 2 C 3 C -1 C 2-1 C 2-2 C 2-3 C 2C C C φ S φ S φ S φ S φ S φ S φ S g 1 g 2 g 3 g -1 d 1 d 2 d 3 d -1 g d φ X Cotroller g = d i i Durig samplig phase, iput is sampled o all capacitors Durig successive approximatio process, capacitors are alterately coected to groud or Voltage o commo ode will coverge to 0 Comparator is always comparig to groud thus reducig commo-mode oliearity errors Note iput sample is ot held idepedetly throughout the etire coversio process Bootstrapped switch is critical durig samplig phase Parasitic capacitaces o V C ode do ot affect fial output (Bottom plate) Major source of power dissipatio is i the charge redistributio process 13
14 Sample Hold C LK Alterate Charge Redistributio Cotroller V C C 1 C 2 C 3 C -1 C 2-1 C 2-2 C 2-3 C 2C C C φ S φ S φ S φ S φ S φ S φ S g 1 g 2 g 3 g -1 d 1 d 2 d 3 d -1 g d φ X Cotroller C 2 i i C 1 i Q SAMP 2 CV IN i 1 Q C d V V CV i i REF C C i i i Q C2 divref VC CVC CVREF di 2 CVC 2 1 i 1 i 1 i 1 i REF i C i 1 Q CV d 2 CV 2 14
15 Alterate Charge Redistributio V C SAR ADC C 1 C 2 C 3 C -1 C 2-1 C 2-2 C 2-3 C 2C C C φ S φ S φ S φ S φ S φ S φ S g 1 g 2 g 3 g -1 d 1 d 2 d 3 d -1 g d φ X Cotroller i REF i 2 C 2 2 IN i 1 CV d CV CV i 2 V V d V IN REF i C i 1 2 i IN REF i 2 C i 1 V V d V If the SAR output is adjusted so that VREF VREF VC 2 2 It follows that i VREF i V VREF di 2 VIN VREF di i1 i1 REF 15
16 Alterate Charge Redistributio V C SAR ADC C 1 C 2 C 3 C -1 C 2-1 C 2-2 C 2-3 C 2C C C φ S φ S φ S φ S φ S φ S φ S g 1 g 2 g 3 g -1 d 1 d 2 d 3 d -1 g d φ X Cotroller Biary Search Process Descriptio 1. After samplig with φ S, evisio closig all g switches ad φ X V C will be Close d 1 It follows that 1 C V V CV CV CV CV REF C i C C i VIN IN i2 i1 C V V CV CV 1 REF C i C C i2 i1 1 solvig obtai VC 2 VREF VIN 1 2 CVREF VC 2 C VIN 2 C thus VC 0 d CVREF VIN 2 C VC 2 C 3. Sice d 1 =0, close g 1 ad ow close d 2. It follows that 1 2 CVREF VINC VCC 2 VC 2 VREF VIN 1 VC 2 VREF VIN thus VC 0 d2 1 V 0 d 0 C V 2 V V 2 C REF IN 1 16
17 Alterate Charge Redistributio V C SAR ADC C 1 C 2 C 3 C -1 C 2-1 C 2-2 C 2-3 C 2C C C φ S φ S φ S φ S φ S φ S φ S g 1 g 2 g 3 g -1 d 1 d 2 d 3 d -1 g d φ X Cotroller Biary Search Process Descriptio 4. Sice d 2 =1, leave d 2 closed ad ow close d 3. It follows that V 2 V 2 V V 3 2 C REF REF IN thus VC 0 d Sice d 3 =0, ope d 3 ad ow close d 4. It follows that 4 2 V 2 V 2 V V C REF REF IN thus VC 0 d Sice d 4 =1, keep d 4 closed ad ow close d 5. It follows that V 2 V 2 V 2 V V thus VC 0 d C REF REF REF IN 17
18 Output Alterate Charge Redistributio VC C1 C2 C3 C-1 C 2-1 C 2-2 C 2-3 C 2C C C φs φs φs φs φs φs φs g1 g2 g3 g-1 φx d1 d2 d3 d-1 g d Cotroller VREF VIN t - T CLK S/H Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 S/H SOC EOC 18
19 C-2C Array for Charge Redistributio V C C 1 C 2 C 3 C -1 C 2-1 C 2-2 C 2-3 C 2C C C φ S φ S φ S φ S φ S φ S φ S g 1 g 2 g 3 g -1 d 1 d 2 d 3 d -1 g d φ X Cotroller Ca a C-2C array be used for the charge-redistributio? Yes but iteral odes would all eed to settle! Ca a couter be used rather tha a biary search to obtai the SAR code? Yes but coversio time would be log with worst-case requirig 2 periods
20 Iput Rage Iput Rage Iput Rage SAR ADC Cocepts are ofte expressed i sigle-eded structures Fully differetial structures widely used Distictio betwee referece voltages ofte ot clearly stated 1 2 V CM V CM VIN VREF V CM V 2 REF Sigle Eded V V V REF1 IN REF1 VCM 0 Sigle Eded Symmetric 2V V 2V REF 2 IND REF 2 Fully Differetial Is Commo-Mode iput 0 or /2? Is maximum iput, 2 or 4 : Sigle-eded Sigle-eded Differetial Iput +, - Differetial Iput
21 Example of Fully Differetial Implemetatio 23
22 Aother example of Fully Differetial Implemetatio with differet switchig sequece ad differet refereces. 24
23 Charge Redistributio ADC with reduced charge redistributio eergy Goal: Reduce uecessary switchig iheret i the origial process by first switchig all capacitors to ad the returig to groud if test fails. Goal: Oly switch if eeded! Stadard Switchig Samples iput o array coected betwee ad Oly chage state if output must be decreased For 10-bit ADC, reported switchig eergy ad total capacitace reduced by about 81% ad 50%, respectively Reduced Switchig Does ot cosider kt/c oise sice resolutio is small
24 Charge Redistributio ADC with reduced charge redistributio eergy Goal: Oly switch if eeded!
25
26 Charge Sharig ADC with reduced charge redistributio eergy Goal: Have oly passive switchig
27 Charge Sharig ADC with reduced charge redistributio eergy Goal: Have oly passive switchig
28 Lots of ogoig activity i SAR ADCs
29 Lots of ogoig activity i SAR ADCs
30 Lots of ogoig activity i SAR ADCs
31 Ed of Lecture 28
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 informationEE 435. Lecture 25. Data Converters
EE 435 Lecture 5 Data Coverters . Review from last lecture. Basic Operatio of CMFB Block V DD V FB V O1 V O CMFB Circuit V FB V OUT C L M 3 M 4 V OUT V IN M 1 M V IN C L V OXX CMFB Circuit V B M 9 V OXX
More informationEE 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 informationEE 505. Lecture 13. String DACs
EE 505 Lecture 13 Strig DACs -Strig DAC V FF S 1 S 2 Simple structure Iheretly mootoe Very low DNL Challeges: S N-2 S N-1 S N S k d k Maagig INL Large umber of devices for large outig thermometer/bubble
More informationEE 505. Lecture 27. ADC Design Pipeline
EE 505 Lecture 7 AD Design Pipeline Review Sampling Noise V n5 R S5 dv REF V n4 R S4 V ns V ns β= + If the ON impedance of the switches is small and it is assumed that = =, it can be shown that Vˆ IN-RMS
More informationEE 505. Lecture 14. Offset Voltages DAC Design
EE 505 Lecture 14 Offset Voltages DAC Desig Review from previous lecture: Cosider First Offset i Operatioal Amplifiers Iput-referred Offset Voltage: Differetial Voltage that must be applied to the iput
More informationNOISE IN SC CIRCUITS. NLCOTD: Gain Booster CMFB. Highlights (i.e. What you will learn today) Review. Course Goals. ECE1371 Advanced Analog Circuits
EE37 Advaced Aalog ircuits Lecture 0 NIE IRUIT Richard chreier richard.schreier@aalog.com Trevor aldwell trevor.caldwell@utoroto.ca ourse Goals Deepe Uderstadig o M aalog circuit desig through a top-dow
More informationAccuracy assessment methods and challenges
Accuracy assessmet methods ad challeges Giles M. Foody School of Geography Uiversity of Nottigham giles.foody@ottigham.ac.uk Backgroud Need for accuracy assessmet established. Cosiderable progress ow see
More informationPhysics 310 Lecture 9a DAC and ADC
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 373-374 (Samplig Frequecy); 1.6: & More of the same Lab 9: & More of the same; Quiz h 14 Project: ompoet
More informationEE / 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 informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive
More informationCMOS. Dynamic Logic Circuits. Chapter 9. Digital Integrated Circuits Analysis and Design
MOS Digital Itegrated ircuits Aalysis ad Desig hapter 9 Dyamic Logic ircuits 1 Itroductio Static logic circuit Output correspodig to the iput voltage after a certai time delay Preservig its output level
More informationChapter 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 information6.111 Lecture 6 Today: 1.Blocking vs. non-blocking assignments 2.Single clock synchronous circuits 3.Finite State Machines
6. Lecture 6 Today:.Blockig vs. o-blockig assigmets 2.Sigle clock sychroous circuits 3.Fiite State Machies 6. Fall 25 Lecture 6, Slide I. Blockig vs. Noblockig Assigmets Coceptual eed for two kids of assigmet
More information4.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 informationPipelined and Parallel Recursive and Adaptive Filters
VLSI Digital Sigal Processig Systems Pipelied ad Parallel Recursive ad Adaptive Filters La-Da Va 范倫達, Ph. D. Departmet of Computer Sciece Natioal Chiao ug Uiversity aiwa, R.O.C. Fall, 05 ldva@cs.ctu.edu.tw
More informationOPTIMAL 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 information1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.
.3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(
More informationOBJECTIVES. 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 informationOlli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5
Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4
More informationEE260: 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 informationDESCRIPTION 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 informationMCT242: 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 informationANALYSIS 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 informationDiscrete-Time System Properties. Discrete-Time System Properties. Terminology: Implication. Terminology: Equivalence. Reference: Section 2.
Professor Deepa Kudur Uiversity of oroto Referece: Sectio 2.2 Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms, ad Applicatios, 4th editio, 2007. Professor Deepa Kudur
More informationInteger Programming (IP)
Iteger Programmig (IP) The geeral liear mathematical programmig problem where Mied IP Problem - MIP ma c T + h Z T y A + G y + y b R p + vector of positive iteger variables y vector of positive real variables
More informationSignals & 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 informationChapter 12 - Quality Cotrol Example: The process of llig 12 ouce cas of Dr. Pepper is beig moitored. The compay does ot wat to uderll the cas. Hece, a target llig rate of 12.1-12.5 ouces was established.
More informationL = n i, i=1. dp p n 1
Exchageable sequeces ad probabilities for probabilities 1996; modified 98 5 21 to add material o mutual iformatio; modified 98 7 21 to add Heath-Sudderth proof of de Fietti represetatio; modified 99 11
More informationSubstantiation of the Water Filling Theorem Using Lagrange Multipliers
J.A. Crawford U048 Water Fillig o Multiple Gaussia Chaels.doc Substatiatio of the Water Fillig heorem Usig Lagrage Multipliers Shao s capacity theorem states that i the case of parallel statistically idepedet
More informationJitter Transfer Functions For The Reference Clock Jitter In A Serial Link: Theory And Applications
Jitter Trasfer Fuctios For The Referece Clock Jitter I A Serial Lik: Theory Ad Applicatios Mike Li, Wavecrest Ady Martwick, Itel Gerry Talbot, AMD Ja Wilstrup, Teradye Purposes Uderstad various jitter
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationChapter 7 z-transform
Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time
More informationChapter 22. Comparing Two Proportions. Copyright 2010 Pearson Education, Inc.
Chapter 22 Comparig Two Proportios Copyright 2010 Pearso Educatio, Ic. Comparig Two Proportios Comparisos betwee two percetages are much more commo tha questios about isolated percetages. Ad they are more
More informationData Assimilation. Alan O Neill University of Reading, UK
Data Assimilatio Ala O Neill Uiversity of Readig, UK he Kalma Filter Kalma Filter (expesive Use model equatios to propagate B forward i time. B B(t Aalysis step as i OI Evolutio of Covariace Matrices (
More informationAdvanced AD/DA converters. ΔΣ Toolbox; Example of DT ΔΣ Modulator. Overview. synthesizentf II. synthesizentf
Advaced AD/DA coverters Overview Delta-Sigma Toolbox some of the key fuctios ΔΣ Toolbox; Example of DT ΔΣ Modulator d -order DT modulator Pietro Adreai Dept. of Electrical ad Iformatio Techology Lud Uiversity,
More informationAdvanced Course of Algorithm Design and Analysis
Differet complexity measures Advaced Course of Algorithm Desig ad Aalysis Asymptotic complexity Big-Oh otatio Properties of O otatio Aalysis of simple algorithms A algorithm may may have differet executio
More informationCDS 101: Lecture 8.2 Tools for PID & Loop Shaping
CDS : Lecture 8. Tools for PID & Loop Shapig Richard M. Murray 7 November 4 Goals: Show how to use loop shapig to achieve a performace specificatio Itroduce ew tools for loop shapig desig: Ziegler-Nichols,
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationThe Discrete Fourier Transform
The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital
More informationCHAPTER XI DATAPATH ELEMENTS
CHAPTER XI- CHAPTER XI CHAPTER XI READ REE-DOC ON COURSE WEBPAGE CHAPTER XI-2 INTRODUCTION -INTRODUCTION So far we have discussed may small compoets ad buildig blocks. Oe fial step i our buildig blocks
More informationBipolar 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 informationELEC1200: 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 informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationEntropies & Information Theory
Etropies & Iformatio Theory LECTURE I Nilajaa Datta Uiversity of Cambridge,U.K. For more details: see lecture otes (Lecture 1- Lecture 5) o http://www.qi.damtp.cam.ac.uk/ode/223 Quatum Iformatio Theory
More informationSpectral Analysis. This week in lab. Next classes: 3/26 and 3/28. Your next experiment Homework is to prepare
Spectral Aalysis This week i lab Your ext experimet Homework is to prepare Next classes: 3/26 ad 3/28 Aero Testig, Fracture Toughess Testig Read the Experimets 5 ad 7 sectios of the course maual Spectral
More informationECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220
ECE 564/645 - Digital Commuicatio Systems (Sprig 014) Fial Exam Friday, May d, 8:00-10:00am, Marsto 0 Overview The exam cosists of four (or five) problems for 100 (or 10) poits. The poits for each part
More informationHashing 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 informationData Converters. Nyquist-rate D/A Converters. Overview. Introduction (II) Introduction
Data Coverters Overview Nyquist-rate D/A Coverters Pietro Adreai Dept. of Electrical ad Iformatio Techology ud Uiversity, Swede Itroductio Type of coverters Architectures based o resistors Architectures
More informationCHEE 221: Chemical Processes and Systems
CHEE 221: Chemical Processes ad Systems Module 3. Material Balaces with Reactio Part a: Stoichiometry ad Methodologies (Felder & Rousseau Ch 4.6 4.8 ot 4.6c ) Material Balaces o Reactive Processes What
More informationSequences 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 informationChapter 7: The z-transform. Chih-Wei Liu
Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability
More informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationChapter 22. Comparing Two Proportions. Copyright 2010, 2007, 2004 Pearson Education, Inc.
Chapter 22 Comparig Two Proportios Copyright 2010, 2007, 2004 Pearso Educatio, Ic. Comparig Two Proportios Read the first two paragraphs of pg 504. Comparisos betwee two percetages are much more commo
More informationData Converters. Nyquist-rate D/A Converters. Overview. Introduction I. DAC applications
Data Coverters Overview Nyquist-rate D/A Coverters Pietro Adreai Dept. of Electrical ad Iformatio Techology ud Uiversity, Swede Itroductio Type of coverters Architectures based o resistors Architectures
More information10.6 ALTERNATING SERIES
0.6 Alteratig Series Cotemporary Calculus 0.6 ALTERNATING SERIES I the last two sectios we cosidered tests for the covergece of series whose terms were all positive. I this sectio we examie series whose
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationReview of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk
Review of Discrete-time Sigals ELEC 635 Prof. Siripog Potisuk 1 Discrete-time Sigals Discrete-time, cotiuous-valued amplitude (sampled-data sigal) Discrete-time, discrete-valued amplitude (digital sigal)
More informationOptimization Methods MIT 2.098/6.255/ Final exam
Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short
More informationChapter 2: Numerical Methods
Chapter : Numerical Methods. Some Numerical Methods for st Order ODEs I this sectio, a summar of essetial features of umerical methods related to solutios of ordiar differetial equatios is give. I geeral,
More informationSeries: Infinite Sums
Series: Ifiite Sums Series are a way to mae sese of certai types of ifiitely log sums. We will eed to be able to do this if we are to attai our goal of approximatig trascedetal fuctios by usig ifiite degree
More informationECE 422/522 Power System Operations & Planning/Power Systems Analysis II : 6 - Small Signal Stability
ECE 4/5 Power System Operatios & Plaig/Power Systems Aalysis II : 6 - Small Sigal Stability Sprig 014 Istructor: Kai Su 1 Refereces Kudur s Chapter 1 Saadat s Chapter 11.4 EPRI Tutorial s Chapter 8 Power
More informationVoltage controlled oscillator (VCO)
Voltage cotrolled oscillator (VO) Oscillatio frequecy jl Z L(V) jl[ L(V)] [L L (V)] L L (V) T VO gai / Logf Log 4 L (V) f f 4 L(V) Logf / L(V) f 4 L (V) f (V) 3 Lf 3 VO gai / (V) j V / V Bi (V) / V Bi
More informationClassification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)
Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:
More informationMechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter
Time Respose & Frequecy Respose d -Order Dyamic System -Pole, Low-Pass, Active Filter R 4 R 7 C 5 e i R 1 C R 3 - + R 6 - + e out Assigmet: Perform a Complete Dyamic System Ivestigatio of the Two-Pole,
More informationSNAP 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 informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More informationCharge Recycling in MTCMOS Circuits: Concept and Analysis Ehsan Pakbaznia University of Southern California
Charge Recyclig i MTCMOS Circuits: Cocept ad Aalysis hsa akbazia Uiversity of Souther Califoria pakbazi@usc.edu Farza Fallah Fujitsu Labs of America farza@us.fujitsu.com Massoud edram Uiversity of Souther
More informationMinimum Source/Drain Area AS,AD = (0.48µm)(0.60µm) - (0.12µm)(0.12µm) = µm 2
UNIERSITY OF CALIFORNIA College of Egieerig Departmet of Electrical Egieerig ad Computer Scieces Last modified o February 1 st, 005 by Chris Baer (crbaer@eecs Adrei ladimirescu Homewor #3 EECS141 Due Friday,
More informationPH 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 informationMath 312 Lecture Notes One Dimensional Maps
Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,
More informationx 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 informationIntroduction to Signals and Systems, Part V: Lecture Summary
EEL33: Discrete-Time Sigals ad Systems Itroductio to Sigals ad Systems, Part V: Lecture Summary Itroductio to Sigals ad Systems, Part V: Lecture Summary So far we have oly looked at examples of o-recursive
More informationMaterial Balances on Reactive Processes F&R
Material Balaces o Reactive Processes F&R 4.6-4.8 What does a reactio do to the geeral balace equatio? Accumulatio = I Out + Geeratio Cosumptio For a reactive process at steady-state, the geeral balace
More informationRecursive 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 informationDiscrete-Time Systems, LTI Systems, and Discrete-Time Convolution
EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [
More informationNUMERICAL 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 informationChapter 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 informationA New Solution Method for the Finite-Horizon Discrete-Time EOQ Problem
This is the Pre-Published Versio. A New Solutio Method for the Fiite-Horizo Discrete-Time EOQ Problem Chug-Lu Li Departmet of Logistics The Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog Phoe: +852-2766-7410
More informationA 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 information6.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 informationLecture 8: Solving the Heat, Laplace and Wave equations using finite difference methods
Itroductory lecture otes o Partial Differetial Equatios - c Athoy Peirce. Not to be copied, used, or revised without explicit writte permissio from the copyright ower. 1 Lecture 8: Solvig the Heat, Laplace
More information10.2 Infinite Series Contemporary Calculus 1
10. Ifiite Series Cotemporary Calculus 1 10. INFINITE SERIES Our goal i this sectio is to add together the umbers i a sequece. Sice it would take a very log time to add together the ifiite umber of umbers,
More informationLecture 10: Universal coding and prediction
0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationProbability, 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 informationThe z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j
The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.
More informationModule 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation
Module 8 Discrete Time Sigals ad Z-Trasforms Objective:To uderstad represetig discrete time sigals, apply z trasform for aalyzigdiscrete time sigals ad to uderstad the relatio to Fourier trasform Itroductio
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationGUIDELINES ON REPRESENTATIVE SAMPLING
DRUGS WORKING GROUP VALIDATION OF THE GUIDELINES ON REPRESENTATIVE SAMPLING DOCUMENT TYPE : REF. CODE: ISSUE NO: ISSUE DATE: VALIDATION REPORT DWG-SGL-001 002 08 DECEMBER 2012 Ref code: DWG-SGL-001 Issue
More informationData Converters. Nyquist-rate D/A Converters. Overview. Introduction I. DAC applications
Data Coverters Overview Nyquist-rate D/ Coverters Pietro dreai Dept. of Electrical ad Iformatio Techology ud Uiversity, Swede Itroductio Type of coverters rchitectures based o resistors rchitectures based
More informationExam II Covers. STA 291 Lecture 19. Exam II Next Tuesday 5-7pm Memorial Hall (Same place as exam I) Makeup Exam 7:15pm 9:15pm Location CB 234
STA 291 Lecture 19 Exam II Next Tuesday 5-7pm Memorial Hall (Same place as exam I) Makeup Exam 7:15pm 9:15pm Locatio CB 234 STA 291 - Lecture 19 1 Exam II Covers Chapter 9 10.1; 10.2; 10.3; 10.4; 10.6
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 22
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig
More informationLecture 11: Decision Trees
ECE9 Sprig 7 Statistical Learig Theory Istructor: R. Nowak Lecture : Decisio Trees Miimum Complexity Pealized Fuctio Recall the basic results of the last lectures: let X ad Y deote the iput ad output spaces
More informationSTA Learning Objectives. Population Proportions. Module 10 Comparing Two Proportions. Upon completing this module, you should be able to:
STA 2023 Module 10 Comparig Two Proportios Learig Objectives Upo completig this module, you should be able to: 1. Perform large-sample ifereces (hypothesis test ad cofidece itervals) to compare two populatio
More informationApplications of Distributed Arithmetic to Digital Signal Processing: A Tutorial Review
pplicatios of Distriuted rithmetic to Digital Sigal Processig: Tutorial Review Ref: Staley. White, pplicatios of Distriuted rithmetic to Digital Sigal Processig: Tutorial Review, IEEE SSP Magazie, July,
More informationChapter 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