The starting phase of each symbol is determined by past bits. This memory can improve detection by giving additional hints about past symbol values.
|
|
- Robyn Copeland
- 5 years ago
- Views:
Transcription
1 8.2 Start With CPFSK CPFSK Sigals Three pictures of the same CPFSK sigal: istataeous frequecy istataeous phase trajectory Trajectory is a circle with radius A = P. CPFSK moves at a steady speed aroud the circle, with reversals. The startig phase of each symbol is determied by past bits. This memory ca improve detectio by givig additioal hits about past symbol values
2 Relatio betwee badpass sigal ad complex basebad: () 2Re 2 cos 2 () ( π +φ ) jφ() t j2πfct s t = Ae e = A fct t st () o Istataeous values: total phase: 2 π f t+φ ( t) c frequecy (rad/s): 2 π fc +φ ( t) = 2π fc ± 2πfd frequecy (Hz): fc ± f d o To shift frequecy up or shift frequecy dow: phase icreases liearly s() t rotates i positive directio, costat speed or phase decreases liearly or s() t rotates i egative directio, costat speed 8.2-2
3 PSK carries iformatio i phase, FSK i the directio of travel: PSK FSK The product fdt has a strog effect o power spectrum: o Geerally, a greater max frequecy deviatio f d produces a wider spectrum. o Multiples of 1/2 create discrete spectral compoets (toes). Cosider the value 1 ft= d cycle : 2 Oe half-cycle (half-circle) forward or backward i each bit. Start o the same phase, ed o the same phase. No phase memory
4 o Cotiuig with the fc The 1 ft= d cycle example, suppose the carrier is = 1 T (for illustratio oly, f c is ot relevat to presece of toes). 1 3 fc fd = ad fc + f d =, ad the badpass sigal is 2T 2T A tued circuit will rig at fc f c + f, hece there are toes i the sigal. d f ad aother oe will rig at d o Rigig occurs if the total phase π f t+φ ( t) (the cosie argumet) is 2 c the same at the ed of a symbol (i.e., the start of the ext symbol), o matter which data value was set: ( ) ( ) 2π f + f T = 2π f f T + 2 π, a iteger So we get toes if c d c d ft d = 2 fd ft d = = is a iteger multiple of 1 R 2 2. This exteds to multilevel (i.e., o-biary) FSK, too. s 8.2-4
5 o Why we do t like toes: They mix i oliearities to produce uexpected ad uwelcome images. They cosume power without carryig iformatio. Formalize all these observatios as expressios defiig CPFSK. o Use I = 2m 1 M, for m= 1,, M as the data at symbol time. Odd itegers from M + 1 to M 1 (e.g., -5, -3, -1, +1, +3, +5) o Alterative possibilities for the symbol (if M = 2): frequecy phase The modulatio idex h is the accumulated phase differece (i cycles) betwee the alteratives over oe symbol. It is dimesioless. Iteger h causes toes
6 8.2-6 The modulatio idex h is related to the spacig Δ f of CPFSK sigal frequecies ad the symbol rate R: o Waveforms: Istataeous frequecy is a rectagular pulse of height f I, but we d like to use h ( f = h 2T ). So ormalize, by defiig a d frequecy pulse g() t with area 1/2. d The istataeous frequecy is f () t = hi g() t = 2 f T I g() t. Larger h greater frequecy swig. d Extedig this to a sequece of pulses, f () t = h I g( t T)
7 Next, the istataeous phase φ () t = 2 π f( α) dα (radias): t T φ () t = 2 πh I q( t kt) = 4 π f T I q( t k ) k k d k k where the phase pulse qt () = g( α) dα: t The saturatio value of 1/2 meas that the phase shift caused by I has a cotiuig effect i the future; i.e., the modulatio has memory. The usual CPFSK defiig equatio writes phase i iterval as φ (, t I) = 2 πh I q( t kt) + φ, T t ( + 1) T where φ o k = k o is the phase at the begiig of time (but is zero if the receiver s phase trackig works) ad I is the symbol sequece. But all qt ( kt) up to k = 1 have already saturated at 1/2, so t T φ ( t, I) =θ + 2 πh I i T t ( + 1) T 2T θ =πh 1 k = I k 8.2-7
8 8.2-8 Examples of phase trajectories: Above: biary ( M = 2) CPFSK Right: quaterary ( M = 4 ) CPFSK Note phase states. Looks like a tree, but 8.2-8
9 8.2-9 the phases are modulo 2π, so the sigals wrap aroud a cylider i time. If h= 2 f d T is ratioal, the phase state values recur, ad we have a fiite set of phase state values. If h = m p (ad m, p are coprime), the o for eve m, we get p differet phase states πm πm πm θ 0,, 2,,( p 1) p p p o for odd m, we get 2 p differet phase states, alteratig eve ad odd πm πm πm θ 0,, 2,,(2 p 1) p p p 8.2-9
10 Fially, ote that CPFSK is ot a liear modulatio The phase is liear i the trasmitted symbols φ () t = 2 πh I q( t T ) but the actual sigal is st (, I ) = Pe φ j (, t I )
11 8.2.2 CPFSK Sigal Space, States ad Trellis A set of basis fuctios for CPFSK: o I iterval, the complex lowpass sigal is jθ t T s() t = Pe exp j2 πhi, T t < ( + 1) T 2T o Therefore, a basis set is the time traslates of ( ( ) ) g () t = exp jπh 2i M 1 t T,0 t < T, i = 1,, M i These basis fuctios are ot orthogoal, except for some choices of h, but they are liearly idepedet. For example, for M = 4 ad h = 12: o The coefficiets j P e θ with respect to this basis carry the memory of past data values, so the curret waveform sheds light o the past. Igore this memory durig detectio (e.g., by use of a differetial detector) ad you pay a price of several db i lost SNR margi
12 o Implemetatios either use a set of filters matched to the gi () t or they compute those ier products implicitly, as part the metric calculatios i tree or trellis search. The ifluece of the past o the respose of a system is summarized i its state. Here θ acts as the state: θ + 1 =θ +πhi jθ t T st () = Pe exp j2πhi 2T state trasitio equatio output equatio i iterval o If h is ratioal, the there is a fiite set of values for the phase state, ad we ca summarize the recurrece with a state diagram. For example, for h = 12ad M = 2 or 4,
13 The state trasitio diagram ca be urolled to form a trellis. Use the same example ( h = 12ad M = 2 or 4) For M = 2 (biary sigals): compacted or startig from a kow state ad for M = 4 (quaterary sigals): alteratig subsets, eve ad odd Show startig from state 0 at time 0. Note the parallel trasitios. o For M=2, the sequece of states σ uiquely determies the data sequece I. o For M = 4, the parallel trasitios mea the state sequece oly partially determies the data. Also, which of the two I values i a (e.g.) +1, -3 trasitio leaves o trace i the memory (the state), so o help from cotext (the future ad past) i decidig which it was
14 8.2.3 MSK A Special Case FSK ad QPSK are quite differet or are they? For oe selectio of parameters MSK CPFSK is equivalet to precodig applied to offset QPSK (OQPSK). MSK (miimum shift keyig): M = 2 ad h = 12. [ ] Re s( t) = P J p( t T) [ ] eve Im s( t) = P J p( t T) odd where the { 1, 1} J +, too. Looks like 2PAM o each axis idepedetly
15 It ca also be cosidered as offset QPSK, i which the imagiary compoet is delayed by half a symbol. If s() t = P Jp( t T) + j Jkp( t kt) eve k odd the s() t is like 4QAM (or QPSK) of symbol duratio 2 T P bpt ( T), b = J + jj + eve but with the imagiary part delayed by half a symbol (i.e., by T), so it s offset QPSK (OQPSK). QPSK 1 Offset QPSK If the receiver is coheret, it ca tell Re [ s( t )] from Im [ s( t )], ad it s easy to detect the J values, as the sigs of the matched filter output samples. But what is the relatio betwee these J values ad the I values of the MSK sequece, the oes we wat to detect?
16 How to get the I values from the J values? Recall that I =+ 1 is aticlockwise rotatio, I = 1 is clockwise. So: o for eve, I = JJ + 1 ; o for odd, I = JJ + 1 ; o hece, I = ( 1) JJ + 1. o It s differetial decodig with a alteratig sig flip. Easy. From this, the BER follows as Pb 2Q( 2Eb N0) 2Q( 2PT N0) = =. If we had detected I usig the sigal i iterval oly, it would have bee 2FSK with o-orthogoal sigals, with the two alterative sigals startig from the same ukow phase. See Assigmet 2 from 2005 for its BER: b ( b 0 ) P = Q E N (MSK detectio without makig use of memory)
17 The similarity with QPSK also gives us a easy calculatio of the MSK power spectrum: they are the same. See Sectio
Frequency Response of FIR Filters
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state
More informationEGR 544 Communication Theory
EGR 544 Commuicaio heory 7. Represeaio of Digially Modulaed Sigals II Z. Aliyazicioglu Elecrical ad Compuer Egieerig Deparme Cal Poly Pomoa Represeaio of Digial Modulaio wih Memory Liear Digial Modulaio
More informationCh3 Discrete Time Fourier Transform
Ch3 Discrete Time Fourier Trasform 3. Show that the DTFT of [] is give by ( k). e k 3. Determie the DTFT of the two sided sigal y [ ],. 3.3 Determie the DTFT of the causal sequece x[ ] A cos( 0 ) [ ],
More information1.0 Probability of Error for non-coherent BFSK
Probability of Error, Digital Sigalig o a Fadig Chael Ad Equalizatio Schemes for ISI Wireless Commuicatios echologies Sprig 5 Lectures & R Departmet of Electrical Egieerig, Rutgers Uiversity, Piscataway,
More informationSignal 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 informationDiscrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.
Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms,
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 information1. Hydrogen Atom: 3p State
7633A QUANTUM MECHANICS I - solutio set - autum. Hydroge Atom: 3p State Let us assume that a hydroge atom is i a 3p state. Show that the radial part of its wave fuctio is r u 3(r) = 4 8 6 e r 3 r(6 r).
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.34 Discrete Time Sigal Processig Fall 24 BACKGROUND EXAM September 3, 24. Full Name: Note: This exam is closed
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationFig. 2. Block Diagram of a DCS
Iformatio source Optioal Essetial From other sources Spread code ge. Format A/D Source ecode Ecrypt Auth. Chael ecode Pulse modu. Multiplex Badpass modu. Spread spectrum modu. X M m i Digital iput Digital
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 informationFIR 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 informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationPolynomial Functions and Their Graphs
Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively
More informationOrthogonal transformations
Orthogoal trasformatios October 12, 2014 1 Defiig property The squared legth of a vector is give by takig the dot product of a vector with itself, v 2 v v g ij v i v j A orthogoal trasformatio is a liear
More informationLecture 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 informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationMa 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5
Ma 42: Itroductio to Lebesgue Itegratio Solutios to Homework Assigmet 5 Prof. Wickerhauser Due Thursday, April th, 23 Please retur your solutios to the istructor by the ed of class o the due date. You
More information1 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 informationx c the remainder is Pc ().
Algebra, Polyomial ad Ratioal Fuctios Page 1 K.Paulk Notes Chapter 3, Sectio 3.1 to 3.4 Summary Sectio Theorem Notes 3.1 Zeros of a Fuctio Set the fuctio to zero ad solve for x. The fuctio is zero at these
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-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 informationx[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.
x[ ] x[ ] x[] x[] x[] x[] 9 8 7 6 5 4 3 3 4 5 6 7 8 9 Figure. Graphical represetatio of a discrete-time sigal. From Discrete-Time Sigal Processig, e by Oppeheim, Schafer, ad Buck 999- Pretice Hall, Ic.
More informationProperties and Hypothesis Testing
Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationLecture 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(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationFilter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and
Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy
More information5.1. Periodic Signals: A signal f(t) is periodic iff for some T 0 > 0,
5. Periodic Sigals: A sigal f(t) is periodic iff for some >, f () t = f ( t + ) i t he smallest value that satisfies the above coditios is called the period of f(t). Cosider a sigal examied over to 5 secods
More informationECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations
ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows
More informationLecture 1: Channel Equalization 1 Advanced Digital Communications (EQ2410) 1. Overview. Ming Xiao CommTh/EES/KTH
: 1 Advaced Digital Commuicatios (EQ2410) 1 Tuesday, Ja. 20, 2015 8:15-10:00, D42 1 Textbook: U. Madhow, Fudametals of Digital Commuicatios, 2008 1 / 1 Overview 2 / 1 Chael Model Itersymbol iterferece
More informationLecture Chapter 6: Convergence of Random Sequences
ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite
More informationSignal 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 informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationPractical 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 informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015
ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],
More informationRay Optics Theory and Mode Theory. Dr. Mohammad Faisal Dept. of EEE, BUET
Ray Optics Theory ad Mode Theory Dr. Mohammad Faisal Dept. of, BUT Optical Fiber WG For light to be trasmitted through fiber core, i.e., for total iteral reflectio i medium, > Ray Theory Trasmissio Ray
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationA COMBINED STOCHASTIC/DECISION-AIDED SNR ESTIMATOR. Witthaya Panyaworayan and Rolf Matzner
A COMBINED STOCHASTIC/DECISION-AIDED SNR ESTIMATOR Witthaya Payaworaya ad Rolf Matzer Istitute for Commuicatios Egieerig Federal Armed Forces Uiversity Muich, Germay tpaya@daisy.et.uibw-mueche.de, rolf@ieee.org
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 informationEECE 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 informationUNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 116C. Problem Set 4. Benjamin Stahl. November 6, 2014
UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 6C Problem Set 4 Bejami Stahl November 6, 4 BOAS, P. 63, PROBLEM.-5 The Laguerre differetial equatio, x y + ( xy + py =, will be solved
More informationR 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 informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationAnalog 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 informationSequences of Definite Integrals, Factorials and Double Factorials
47 6 Joural of Iteger Sequeces, Vol. 8 (5), Article 5.4.6 Sequeces of Defiite Itegrals, Factorials ad Double Factorials Thierry Daa-Picard Departmet of Applied Mathematics Jerusalem College of Techology
More information3. 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 informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More information1 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 informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationChapter 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 informationA 2nTH ORDER LINEAR DIFFERENCE EQUATION
A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy
More informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio
More informationChapter 5 Vibrational Motion
Fall 4 Chapter 5 Vibratioal Motio... 65 Potetial Eergy Surfaces, Rotatios ad Vibratios... 65 Harmoic Oscillator... 67 Geeral Solutio for H.O.: Operator Techique... 68 Vibratioal Selectio Rules... 7 Polyatomic
More informationMathematical Statistics - MS
Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios
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 informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationTopic 5 [434 marks] (i) Find the range of values of n for which. (ii) Write down the value of x dx in terms of n, when it does exist.
Topic 5 [44 marks] 1a (i) Fid the rage of values of for which eists 1 Write dow the value of i terms of 1, whe it does eist Fid the solutio to the differetial equatio 1b give that y = 1 whe = π (cos si
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 informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
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 informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about
More informationTime-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 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 informationMath 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 informationPrinciple 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 informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
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-Time Fourier Transform (DTFT)
EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) The Discrete-Time Fourier Trasorm (DTFT). Itroductio I these otes, we itroduce the discrete-time Fourier trasorm (DTFT) ad
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
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 information6.003 Homework #3 Solutions
6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationUnbiased Estimation. February 7-12, 2008
Ubiased Estimatio February 7-2, 2008 We begi with a sample X = (X,..., X ) of radom variables chose accordig to oe of a family of probabilities P θ where θ is elemet from the parameter space Θ. For radom
More informationDiversity Combining Techniques
Diversity Combiig Techiques Whe the required sigal is a combiatio of several waves (i.e, multipath), the total sigal amplitude may experiece deep fades (i.e, Rayleigh fadig), over time or space. The major
More informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More information1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y
Questio (a) A square matrix A= A is called positive defiite if the quadratic form waw > 0 for every o-zero vector w [Note: Here (.) deotes the traspose of a matrix or a vector]. Let 0 A = 0 = show that:
More informationFinite-length Discrete Transforms. Chapter 5, Sections
Fiite-legth Discrete Trasforms Chapter 5, Sectios 5.2-50 5.0 Dr. Iyad djafar Outlie The Discrete Fourier Trasform (DFT) Matrix Represetatio of DFT Fiite-legth Sequeces Circular Covolutio DFT Symmetry Properties
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 informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
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 informationA Slight Extension of Coherent Integration Loss Due to White Gaussian Phase Noise Mark A. Richards
A Slight Extesio of Coheret Itegratio Loss Due to White Gaussia Phase oise Mark A. Richards March 3, Goal I [], the itegratio loss L i computig the coheret sum of samples x with weights a is cosidered.
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationMath 2784 (or 2794W) University of Connecticut
ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really
More informationSigma notation. 2.1 Introduction
Sigma otatio. Itroductio We use sigma otatio to idicate the summatio process whe we have several (or ifiitely may) terms to add up. You may have see sigma otatio i earlier courses. It is used to idicate
More informationA. Basics of Discrete Fourier Transform
A. Basics of Discrete Fourier Trasform A.1. Defiitio of Discrete Fourier Trasform (8.5) A.2. Properties of Discrete Fourier Trasform (8.6) A.3. Spectral Aalysis of Cotiuous-Time Sigals Usig Discrete Fourier
More informationMTH Assignment 1 : Real Numbers, Sequences
MTH -26 Assigmet : Real Numbers, Sequeces. Fid the supremum of the set { m m+ : N, m Z}. 2. Let A be a o-empty subset of R ad α R. Show that α = supa if ad oly if α is ot a upper boud of A but α + is a
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
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 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 2112 Solutions Assignment 5
Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More information10-701/ Machine Learning Mid-term Exam Solution
0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it
More informationAH Checklist (Unit 3) AH Checklist (Unit 3) Matrices
AH Checklist (Uit 3) AH Checklist (Uit 3) Matrices Skill Achieved? Kow that a matrix is a rectagular array of umbers (aka etries or elemets) i paretheses, each etry beig i a particular row ad colum Kow
More informationNumber 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