EE 435. Lecture 25. Data Converters

Size: px
Start display at page:

Download "EE 435. Lecture 25. Data Converters"

Transcription

1 EE 435 Lecture 5 Data Coverters

2 . 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 CMFB Block V O1 Averager V AVG A V FB V O V +V V FB= 01 0 A s V OXX V OXX is the desired quiescet voltage at the stabilizatio ode (irrespective of where V FB goes)

3 . Review from last lecture. Commo-mode offset voltage V DD M 5 M 4 V O1 V 0XX V COFF V 0XX V O C 1 V B1 C M 1 M V C1 V C1 V YY M 3 Defiitio: The commo-mode offset voltage is the voltage that must be applied to the biasig ode at the CMFB poit to obtai the desired operatig poit at the stabilizatio ode

4 . Review from last lecture. Commo-mode gais V DD V DD M 5 M 4 V C M 4 V O1 C 1 V C1 V 0XX V 0XX V COFF V B1 M 1 M V C1 C V O V O V YY M 3 M V C1 M 3 V C3 V0 g 01+g 03 / ACOM - VC1 sc+g05 V0 gm5 ACOM - V sc+g V0 g m3 / ACOM3 - V sc+g C 05 C3 05 C g 01+g 03 / IT 1 ACOM0 - g I / g 05 m5 5 ACOM0 - T EB g 05 IT / VEB5 T I / V 4 IT / g / V m3 EB3 A COM30 = - g05 I T / VEB3 Although the commo-mode gai A COM0 is very small, A C0M0 is very large! Shift i V 0Q from V OXX is the product of the commo-mode offset voltage ad A COM0

5 . Review from last lecture. How much gai is eeded i the CMFB amplifier? VDD VFB V DD VOUT M3 M4 VOUT V C1 X V C3 M 4 M M 3 Y V C1 V O C V AVG V OXX A V FB VIN VIN M1 M CL VB M9 V =V 0UT-ACCEPTABLE COFF CL VOXX A 1-AA CMFB Circuit COM COM The CMFB Loop This does ot require a particularly large gai This is the loop that must be compesated sice A ad A COMP will be frequecy depedet Miller compesatio capacitor for compesatio of differetial loop will ofte appear i shut with C Ca create this half-circuit loop (without CM iputs o a fully differetial structure) for simulatios Results exted readily to two-stage structures with o big surprises Capacitaces o odes X ad Y create poles for CMFB circuit Reasoably high closed-loop CMFB badwidth eeded to miimize shifts i output due to high-frequecy commo-mode oise

6 . Review from last lecture. CMFB Circuits Several (but ot too may) CMFB circuits exist Ca be classified as either cotiuous-time or discrete-time V DD I B I B + V o - V o V OXX V 01 M 1 M M 3 M 4 V 0 N 1 N N C S C 1 C 1 C S N 1 V FB M 5 V SS V 01 V 0 N 1 N V FB N N 1 M 7 M 6 V SS

7 . Review from last lecture. CMFB Circuits Several (but ot too may) CMFB circuits exist Ca be classified as either cotiuous-time or discrete-time V DD I B I B V OXX I B + V o - V o V 01 M 1 M M 3 M 4 V 0 N 1 N C S C 1 C 1 C S N N 1 V FB M 5 V 01 V 0 N 1 N N N 1 V SS V FB M 7 M 6 V SS Circuit i blue ca be added to double CMFB gai

8 Types: Data Coverters A/D (Aalog to Digital) Coverts Aalog Iput to a Digital Output D/A (Digital to Aalog) Coverts a Digital Iput to a Aalog Output A/D is the world s most widely used mixed-sigal compoet D/A is ofte icluded i a FB path of a A/D A/D ad D/A fields will remai hot idefiitely techology advaces make data coverter desig more challegig embedded applicatios desigs ofte very applicatio depedet

9 D/A Coverters Basic structure: X IN DAC Basic structure with differetial outputs:: X IN DAC X + OUT X - OUT X + REF X - REF

10 D/A Coverters Notatio: DAC X IN DAC DAC

11 D/A Coverters DAC =<b -1,b -1,...b 1,b 0> b 0 is the Least Sigificat Bit (LSB) b -1 is the Most Sigificat Bit (MSB) Note: some authors use differet idex otatio A Ideal DAC is characterized at low frequecies by its static performace

12 D/A Coverters DAC =<b -1,b -1,...b 1,b 0> A Ideal DAC trasfer characteristic (3-bits) X - REF <0 0 0> <0 0 1> <0 1 0> <0 11> <1 0 0> <1 010> <1 1 0> <1 1 1> C 0 C 1 C C 3 C 4 C 5 C 6 C 7 Code C k is used to represet the decimal equivalet of the biary umber <b -1.. b 0 )>

13 D/A Coverters DAC =<b -1,b -1,...b 1,b 0> A Ideal DAC trasfer characteristic (3-bits) 7 8 C 0 C 1 C C 3 C 4 C 5 C 6 C 7

14 D/A Coverters DAC =<b -1,b -1,...b 1,b 0> A Ideal DAC trasfer characteristic (3-bits) X - REF C 0 C 1 C C 3 C 4 C 5 C 6 C 7 All poits of this ideal DAC lie o a straight lie

15 D/A Coverters X DAC IN C 0 C 1 C C 3 C 4 C 5 C 6 C 7 Most D/A ideally have a liear relatioship betwee biary iput ad aalog output Output represets a discrete set of cotiuous variables Typically this umber is a itegral power of, i.e. X is always dimesioless IN could have may differet dimesios A ideal oliear characteristic is also possible (waveform geeratio ad compadig) Will assume a liear trasfer characteristic is desired uless specifically stated to the cotrary

16 D/A Coverters X DAC IN C 0 C 1 C C 3 C 4 C 5 C 6 C 7 For this ideal DAC X X b b b b b OUT= b -j OUT=XREF j j=1 Number of outputs gets very large for large Spacig betwee outputs is / ad gets very small for large

17 D/A Coverters X DAC IN X LSB C 0 C 1 C C 3 C 4 C 5 C 6 C 7 Ideal steps all equal ad termed the LSB X LSB gets very small for small ad large e.g. If =1V ad =16, the N= 16 =65,536, X LSB =15.5μV

18 D/A Coverters X DAC IN A alterate ideal 3-bit DAC C 0 C 1 C C 3 C4 C5 C6 C7 Irrespective of which form is cosidered, the icremet i the output for oe Boolea bit chage i the iput is X LSB ad the total rage is 1LSB less tha

19 Applicatios of DACs Waveform Geeratio Voltage Geeratio Aalog Trim or Calibratio Idustrial Cotrol Systems Feedback Elemet i ADCs.

20 Waveform Geeratio with DACs Ramp (Saw-tooth) Geerator Period CLK Geerator -bit Biary Couter D/A A Example: For =3 t Example: For large t

21 Waveform Geeratio with DACs Sie Wave Geerator Period CLK Geerator -bit Biary or Couter D/A A m ROM RAM Example: For =3 t Distortio of the desired waveforms occurs due to both time ad amplitude quatizatio Ofte a filter precedes or follows the buffer amplifier to smooth the output waveform

22 A/D Coverters Basic structure: ADC Iput rage is Basic structure with differetial iputs/refereces: ADC X + IN ADC X - IN X + REF X - REF X + REF X - REF Iput rage is X + REF - X - REF Iput rage is (X + REF - X - REF)

23 A/D Coverters Notatio: ADC ADC ADC

24 A/D Coverters ADC =<d -1,d -,...d 0> d 0 is the Least Sigificat Bit (LSB) d -1 is the Most Sigificat Bit (MSB) Note: some authors use differet idex otatio A Ideal ADC is characterized at low frequecies by its static performace

25 A/D Coverters A Ideal ADC trasfer characteristic (3-bits) ADC =<d -1,d -,...d 0> C 7 <1 1 1> C 6 <1 1 0> C 5 <1 01> C 4 C 3 C C 1 C 0 <1 0 0> <0 11> <0 1 0> <0 0 1> <0 0 0> X LSB X LSB X = REF -X LSB

26 A/D Coverters A Ideal ADC trasfer characteristic (3-bits) ADC =<d -1,d -,...d 0> X LSB X = REF 7X LSB C 7 6X LSB C 6 5X LSB C 5 4X LSB 3X LSB C 4 C 3 X LSB X LSB C X LSB C 1 C 0 -X LSB The secod vertical axis, labeled,is the iterpreted value of

27 A/D Coverters ADC C 7 C 6 C 5 C 4 C 3 C C 1 C 0 For this ideal ADC X REF d-1 d- d-3 d1 d = -1 IN ε 4 8 X where ε is small (typically less tha 1LSB) d -j XREF = X j IN+ ε j=1 Number of bis gets very large for large Spacig betwee break poits is / ad gets very small for large ε is the quatizatio error ad is iheret i ay ADC

28 A/D Coverters ADC C 7 C 6 C 5 C 4 C 3 C C 1 C 0 Trasitio Poits X T1 X T X T3 X T4 X T5 X T6 X T7 Actual values of where trasitios occur are termed trasitio poits or break poits For a ideal -bit ADC, there are -1 trasitio poits Ideally the trasitio poits are all separated by 1 LSB -- X LSB = / Ideally the trasitio poits are uiformly spaced I a actual ADC, the trasitio poits will deviate a little from their ideal locatio Labelig Covetio: We will defie the trasitio poit X Tk to be the break poit where the trasitio i the code output to code C k occurs. This seemigly obvious orderig of break poits becomes ambiguous, though, whe more tha oe break poits cause a trasitio to code C k which ca occur i some oideal ADCs

29 A/D Coverters Quatizatio Errors ADC X T1 =X LSB C 7 C 6 C 5 C 4 C 3 C C 1 C 0 X LSB X LSB 3X LSB 4X LSB 5X LSB 6X LSB 7X LSB - ε Q X T1 X T X T3 X T4 X T5 X T6 X T7 Q X T1 X T X T3 X T4 X T5 X T6 X T7 -X LSB Magitude of ε Q bouded by X LSB for a ideal A/D

30 A/D Coverters Quatizatio Errors ADC Aother Ideal ADC C 7 X T1 =X LSB / C 6 C 5 C 4 C 3 C C 1 C 0 X LSB X LSB 3X LSB 4X LSB 5X LSB 6X LSB 7X LSB Q X - X OUT IN ε Q X T1 X T X T3 X T4 X T5 X T6 X T7.5 X LSB X T1 X T X T3 X T4 X T5 X T6 X T7 -.5 X LSB Magitude of ε Q bouded by ½ X LSB Is the performace of this ideal ADC really better tha that of the previous ideal ADC?

31 Data Coverter Architectures ADC DAC Large umber of differet circuits have bee proposed for buildig data coverters Ofte a dramatic differece i performace from oe structure to aother Performace of almost all structures are idetical if ideal compoets are used Much of data coverter desig ivolves idetifyig the problems associated with a give structure ad figurig out ways to reduce the effects of these problems Critical that all problems that are sigificat be idetified ad solved May of the problems are statistical i ature ad implicatios of ot solvig problems are i a yield loss that may be dramatic

32 Data Coverter Architectures ADC DAC Strategy for discussig data coverters Briefly look at some differet data coverter architectures Detailed discussio of performace parameters for data coverters More detailed discussio of data coverter architectures

33 Data Coverter Architectures ADC DAC Nyquist Rate Flash Charge Redistributio Pipelie Two-step ad Multi-Step Iterpolatig Algorithmic/Cyclic Successive Approximatio (Register) SAR Sigle Slope / Dual Slope Subragig Folded Iterleaved Over-Sampled (Delta-Sigma) Discrete-time First-order/Higher Order Cotiuous-time Curret Steerig R-strig Charge Redistributio Algorithmic R-R (ladder) Pipelied Subragig Discrete-time First-order/Higher Order Cotiuous-time

34 Data Coverter Architectures ADC Flash V REF V IN R R R R Thermometer to Biary Decoder R

35 Data Coverter Architectures ADC Successive Approximatio Register (SAR) C LK V IN V REF DAC DAC Cotroller

36 Data Coverter Architectures Charge Redistributio ADC V ICOMP C -1 C - C -3 C C -4 C C C C C C C 0 S 1 f A d-1 φb d-1 φb f f A d d -1 φb -1 φb A f A d- φb d - φ B f A d-3 φb d-3 φb f A d0 φb d 0 φ B f A φ B f A V IN V REF Successive Approximatio Block f A t 1 1 ' C C QSAM VIN Ci C 0 VIN V i INC i0 i0 1 C Q V d REDIS REF i i i0 f B d -1 VCOMP=0 T CONV t Q SAM Q REDIS d - T CLK VCOMP=1 VCOMP=0 t 1 C V d V C V REF i i IN i0 d 1 i IN VREF i i0 d 0 VCOMP=1 VCOMP=0 VCOMP=1 t t

37 Data Coverter Architectures Sigle Slope ADC R S R S C LK V REF Itegrator V OUT V IN V E E Biary Couter c Comparator Chages States whe t TR V I V dt I t V IN 0 REF 0 TR REF 0 V Couter stops whe VIN ttrvref I0 ; COUNT TCLK VREF I IN fclk 0 COUNT ; VREF I0 If calibrate so that f CLK I0 V ; IN V COUNT COUNT ; IN ; VREF V REF

38 Data Coverter Architectures DAC R-Strig V RFF R R S 1 S R V OUT R S N- R S N-1 S N is decoded to close oe switch

39 Data Coverter Architectures DAC Curret Steerig V RFF I 1 I I k S 1 S S k R V OUT

40 Data Coverter Architectures DAC R-R (4-bits) R R R R V OUT R R R R R d 3 d d 1 d 0 V REF By superpositio: d V =V d +V d +V d +V d = V V 3 4 k 4-k OUT REF 3 REF REF 1 REF 0 REF 4-k REF k k=0 k=1 d

41 Data Coverter Architectures Charge Redistributio DAC C -1 C - C -3 C C -4 C C C C C C C 0 S 1 f A f B d-1 φa d-1 φa f B d-1 φa d-1 φa f B d- φ d - φ A A f B d d-3 φ -3 φa A f B d0 φa d 0 φ A φ B f A f A V OUT V REF Successive Approximatio Block 1 Q V d C SET REF i i i0 1 1 ' C C QRDIS VOUT Ci C 0 VOUT V i OUTC i0 i0 f A t Q SET Q RDIS T CONV f B 1 C V d V C V REF i i OUT i0 d 1 i OUT VREF i i0 t

42 Performace Characterizatio of Data Coverters ADC DAC A very large umber of parameters ( ) characterize the static performace of a ADC! Ad eve more parameters eeded to characterize the dyamic performace of a ADC A large (but much smaller) umber of parameters are ivariably used to characterize a data coverter Performace parameters of iterest deped strogly o the applicatio Very small umber of parameters of iterest i may/most applicatios Catalog data coverters are geerally iteded to satisfy a wide rage of applicatios ad thus have much more striget requiremets placd o their performace Custom applicatio-specific data coverter will geerally perform much better tha a catalog part i the same applicatio

43 Ed of Lecture 5

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

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

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

EE 505 Lecture 9. Statistical Circuit Modeling

EE 505 Lecture 9. Statistical Circuit Modeling EE 505 Lecture 9 Statistical Circuit Modelig eview from previous lecture: Statistical Aalysis Strategy Will first focus o statistical characterizatio of resistors, the exted to capacitors ad trasistors

More information

EE 505. Lecture 14. Offset Voltages DAC Design

EE 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 information

EE 435. Lecture 23. Common Mode Feedback Data Converters

EE 435. Lecture 23. Common Mode Feedback Data Converters EE 435 Lecture 3 Common Mode Feedback Data Converters Review from last lecture Offset Voltage Distribution Pdf of zero-mean Gaussian distribution f(x) -kσ kσ x Percent between: ±σ 68.3% ±σ 95.5% ±3σ 99.73%

More information

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter

Mechatronics. 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 information

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Run-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 information

Introduction to Signals and Systems, Part V: Lecture Summary

Introduction 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 information

1.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.

1.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 information

Voltage controlled oscillator (VCO)

Voltage 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 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

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

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

Math 312 Lecture Notes One Dimensional Maps

Math 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 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

EE 505. Lecture 13. String DACs

EE 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 information

Crash course part 2. Frequency compensation

Crash course part 2. Frequency compensation Crash course part Frequecy compesatio Ageda Frequecy depedace Feedback amplifiers Frequecy depedace of the Trasistor Frequecy Compesatio Phatom Zero Examples Crash course part poles ad zeros I geeral a

More information

Chapter 7: The z-transform. Chih-Wei Liu

Chapter 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 information

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B.

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B. Amme 3500 : System Dyamics ad Cotrol Root Locus Course Outlie Week Date Cotet Assigmet Notes Mar Itroductio 8 Mar Frequecy Domai Modellig 3 5 Mar Trasiet Performace ad the s-plae 4 Mar Block Diagrams Assig

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

2.004 Dynamics and Control II Spring 2008

2.004 Dynamics and Control II Spring 2008 MIT OpeCourseWare http://ocw.mit.edu 2.004 Dyamics ad Cotrol II Sprig 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Massachusetts Istitute of Techology

More information

EE Control Systems

EE Control Systems Copyright FL Lewis 7 All rights reserved Updated: Moday, November 1, 7 EE 4314 - Cotrol Systems Bode Plot Performace Specificatios The Bode Plot was developed by Hedrik Wade Bode i 1938 while he worked

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

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

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Olli 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 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

EE 435. Lecture 26. Data Converters. Data Converter Characterization

EE 435. Lecture 26. Data Converters. Data Converter Characterization EE 435 Lecture 26 Data Converters Data Converter Characterization . Review from last lecture. Data Converter Architectures Large number of different circuits have been proposed for building data converters

More information

ECEN620: Network Theory Broadband Circuit Design Fall 2014

ECEN620: Network Theory Broadband Circuit Design Fall 2014 ECE60: etwork Theory Broadbad Circuit Deig Fall 04 Lecture 3: PLL Aalyi Sam Palermo Aalog & Mixed-Sigal Ceter Texa A&M Uiverity Ageda & Readig PLL Overview & Applicatio PLL Liear Model Phae & Frequecy

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

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

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

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-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 information

Jitter Transfer Functions For The Reference Clock Jitter In A Serial Link: Theory And Applications

Jitter 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 information

Lecture 19: Convergence

Lecture 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 information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Chapter 9: Numerical Differentiation

Chapter 9: Numerical Differentiation 178 Chapter 9: Numerical Differetiatio Numerical Differetiatio Formulatio of equatios for physical problems ofte ivolve derivatives (rate-of-chage quatities, such as velocity ad acceleratio). Numerical

More information

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios

More information

ECEN 655: Advanced Channel Coding Spring Lecture 7 02/04/14. Belief propagation is exact on tree-structured factor graphs.

ECEN 655: Advanced Channel Coding Spring Lecture 7 02/04/14. Belief propagation is exact on tree-structured factor graphs. ECEN 655: Advaced Chael Codig Sprig 014 Prof. Hery Pfister Lecture 7 0/04/14 Scribe: Megke Lia 1 4-Cycles i Gallager s Esemble What we already kow: Belief propagatio is exact o tree-structured factor graphs.

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

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

Classification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)

Classification 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 information

Chapter 7 z-transform

Chapter 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 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

EE C245 - ME C218 Introduction to MEMS Design Fall Today s Lecture

EE C245 - ME C218 Introduction to MEMS Design Fall Today s Lecture EE C45 ME C8 Itroductio to MEMS Desig Fall 003 Roger Howe ad Thara Sriiasa Lecture 3 Capacitie Positio Sesig: Electroic ad Mechaical Noise EE C45 ME C8 Fall 003 Lecture 3 Today s Lecture Basic CMOS buffer

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

Chapter 2 Feedback Control Theory Continued

Chapter 2 Feedback Control Theory Continued Chapter Feedback Cotrol Theor Cotiued. Itroductio I the previous chapter, the respose characteristic of simple first ad secod order trasfer fuctios were studied. It was show that first order trasfer fuctio,

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

CS 332: Algorithms. Linear-Time Sorting. Order statistics. Slide credit: David Luebke (Virginia)

CS 332: Algorithms. Linear-Time Sorting. Order statistics. Slide credit: David Luebke (Virginia) 1 CS 332: Algorithms Liear-Time Sortig. Order statistics. Slide credit: David Luebke (Virgiia) Quicksort: Partitio I Words Partitio(A, p, r): Select a elemet to act as the pivot (which?) Grow two regios,

More information

7. Modern Techniques. Data Encryption Standard (DES)

7. Modern Techniques. Data Encryption Standard (DES) 7. Moder Techiques. Data Ecryptio Stadard (DES) The objective of this chapter is to illustrate the priciples of moder covetioal ecryptio. For this purpose, we focus o the most widely used covetioal ecryptio

More information

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University. Sigal Processig Lecture 02: Discrete Time Sigals ad Systems Ahmet Taha Koru, Ph. D. Yildiz Techical Uiversity 2017-2018 Fall ATK (YTU) Sigal Processig 2017-2018 Fall 1 / 51 Discrete Time Sigals Discrete

More information

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals Itroductio to Digital Sigal Processig Chapter : Itroductio Aalog ad Digital Sigals aalog = cotiuous-time cotiuous amplitude digital = discrete-time discrete amplitude cotiuous amplitude discrete amplitude

More information

Solution of EECS 315 Final Examination F09

Solution of EECS 315 Final Examination F09 Solutio of EECS 315 Fial Examiatio F9 1. Fid the umerical value of δ ( t + 4ramp( tdt. δ ( t + 4ramp( tdt. Fid the umerical sigal eergy of x E x = x[ ] = δ 3 = 11 = ( = ramp( ( 4 = ramp( 8 = 8 [ ] = (

More information

THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS

THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS R775 Philips Res. Repts 26,414-423, 1971' THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS by H. W. HANNEMAN Abstract Usig the law of propagatio of errors, approximated

More information

School of Mechanical Engineering Purdue University. ME375 Frequency Response - 1

School of Mechanical Engineering Purdue University. ME375 Frequency Response - 1 Case Study ME375 Frequecy Respose - Case Study SUPPORT POWER WIRE DROPPERS Electric trai derives power through a patograph, which cotacts the power wire, which is suspeded from a cateary. Durig high-speed

More information

Describing Function: An Approximate Analysis Method

Describing Function: An Approximate Analysis Method Describig Fuctio: A Approximate Aalysis Method his chapter presets a method for approximately aalyzig oliear dyamical systems A closed-form aalytical solutio of a oliear dyamical system (eg, a oliear differetial

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

Lecture 11: Channel Coding Theorem: Converse Part

Lecture 11: Channel Coding Theorem: Converse Part EE376A/STATS376A Iformatio Theory Lecture - 02/3/208 Lecture : Chael Codig Theorem: Coverse Part Lecturer: Tsachy Weissma Scribe: Erdem Bıyık I this lecture, we will cotiue our discussio o chael codig

More information

Frequency Domain Filtering

Frequency Domain Filtering Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform

More information

CHM 424 EXAM 2 - COVER PAGE FALL

CHM 424 EXAM 2 - COVER PAGE FALL CHM 44 EXAM - COVER PAGE FALL 007 There are six umbered pages with five questios. Aswer the questios o the exam. Exams doe i ik are eligible for regrade, those doe i pecil will ot be regraded. coulomb

More information

11 Correlation and Regression

11 Correlation and Regression 11 Correlatio Regressio 11.1 Multivariate Data Ofte we look at data where several variables are recorded for the same idividuals or samplig uits. For example, at a coastal weather statio, we might record

More information

NOISE IN SC CIRCUITS. NLCOTD: Gain Booster CMFB. Highlights (i.e. What you will learn today) Review. Course Goals. ECE1371 Advanced Analog Circuits

NOISE 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 information

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

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

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

CHAPTER XI DATAPATH ELEMENTS

CHAPTER 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 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

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4

More information

Sinusoidal Steady-state Analysis

Sinusoidal Steady-state Analysis Siusoidal Steady-state Aalysis Complex umber reviews Phasors ad ordiary differetial equatios Complete respose ad siusoidal steady-state respose Cocepts of impedace ad admittace Siusoidal steady-state aalysis

More information

IP Reference guide for integer programming formulations.

IP 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 information

6.111 Lecture 6 Today: 1.Blocking vs. non-blocking assignments 2.Single clock synchronous circuits 3.Finite State Machines

6.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 information

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

Module 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 information

1. Linearization of a nonlinear system given in the form of a system of ordinary differential equations

1. Linearization of a nonlinear system given in the form of a system of ordinary differential equations . Liearizatio of a oliear system give i the form of a system of ordiary differetial equatios We ow show how to determie a liear model which approximates the behavior of a time-ivariat oliear system i a

More information

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said

More information

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.

THE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0. THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of

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

Chapter Vectors

Chapter Vectors Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it

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

Vector Quantization: a Limiting Case of EM

Vector Quantization: a Limiting Case of EM . Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

: Transforms and Partial Differential Equations

: Transforms and Partial Differential Equations Trasforms ad Partial Differetial Equatios 018 SUBJECT NAME : Trasforms ad Partial Differetial Equatios SUBJECT CODE : MA 6351 MATERIAL NAME : Part A questios REGULATION : R013 WEBSITE : wwwharigaeshcom

More information

Quantum Annealing for Heisenberg Spin Chains

Quantum Annealing for Heisenberg Spin Chains LA-UR # - Quatum Aealig for Heiseberg Spi Chais G.P. Berma, V.N. Gorshkov,, ad V.I.Tsifriovich Theoretical Divisio, Los Alamos Natioal Laboratory, Los Alamos, NM Istitute of Physics, Natioal Academy of

More information

6.867 Machine learning, lecture 7 (Jaakkola) 1

6.867 Machine learning, lecture 7 (Jaakkola) 1 6.867 Machie learig, lecture 7 (Jaakkola) 1 Lecture topics: Kerel form of liear regressio Kerels, examples, costructio, properties Liear regressio ad kerels Cosider a slightly simpler model where we omit

More information

ENGI Series Page 6-01

ENGI Series Page 6-01 ENGI 3425 6 Series Page 6-01 6. Series Cotets: 6.01 Sequeces; geeral term, limits, covergece 6.02 Series; summatio otatio, covergece, divergece test 6.03 Stadard Series; telescopig series, geometric series,

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

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

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

Abstract Vector Spaces. Abstract Vector Spaces

Abstract Vector Spaces. Abstract Vector Spaces Astract Vector Spaces The process of astractio is critical i egieerig! Physical Device Data Storage Vector Space MRI machie Optical receiver 0 0 1 0 1 0 0 1 Icreasig astractio 6.1 Astract Vector Spaces

More information

Lecture 11: Pseudorandom functions

Lecture 11: Pseudorandom functions COM S 6830 Cryptography Oct 1, 2009 Istructor: Rafael Pass 1 Recap Lecture 11: Pseudoradom fuctios Scribe: Stefao Ermo Defiitio 1 (Ge, Ec, Dec) is a sigle message secure ecryptio scheme if for all uppt

More information

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors. Quiz November 4th, 23 Sigals & Systems (5-575-) P. Reist & Prof. R. D Adrea Solutios Exam Duratio: 4 miutes Number of Problems: 4 Permitted aids: Noe. Use oly the prepared sheets for your solutios. Additioal

More information

The Discrete Fourier Transform

The 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 information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

Physics 310 Lecture 9a DAC and ADC

Physics 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 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

ECE 564/645 - Digital Communication Systems (Spring 2014) Final Exam Friday, May 2nd, 8:00-10:00am, Marston 220

ECE 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 information

Lecture 33: Bootstrap

Lecture 33: Bootstrap Lecture 33: ootstrap Motivatio To evaluate ad compare differet estimators, we eed cosistet estimators of variaces or asymptotic variaces of estimators. This is also importat for hypothesis testig ad cofidece

More information

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the

More information

Statistics 511 Additional Materials

Statistics 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 information

PC5215 Numerical Recipes with Applications - Review Problems

PC5215 Numerical Recipes with Applications - Review Problems PC55 Numerical Recipes with Applicatios - Review Problems Give the IEEE 754 sigle precisio bit patter (biary or he format) of the followig umbers: 0 0 05 00 0 00 Note that it has 8 bits for the epoet,

More information