Some notes on the Power Spectral Density of Random Processes. S. Tubaro July 4, 2011
|
|
- James Victor Wood
- 7 years ago
- Views:
Transcription
1 Some notes on the Power Spectral Density of Random Processes S. Tubaro July 4, 20
2 Contents Energy/Power Spectral Density for Continuous Deterministic Signals 3 2 Energy/Power Spectral Density for Discrete Deterministic Signals 4 3 Energy/Power Spectral Density for Deterministic Signals through LTI systems 5 4 Random Processes 6 5 Random Processes and LTI systems 8 6 Power Spectral Density for Continuous Random Processes 8 7 Power Spectral Density for Discrete Random Processes 2
3 Energy/Power Spectral Density for Continuous Deterministic Signals Given a generic signal x(t) its normalized instantaneous power is defined as x(t) 2. If x(t) is a voltage x(t) 2 represents the instantaneous power dissipated applying x(t) to a resistor of Ω. The normalized energy over the period T is defined (considering T centered around x(t) 2 dt. 0) as x(t) 2 dt, while the normalized mean power is given by T Considering T, for a signal with finite normalized energy, we have E x(t) x(t) 2 dt. In this case the mean normalized power is, obviously, null. A signal has finite mean normalized power if the following limit exists: lim T T x(t) 2 dt. In this case the normalized energy does not exists (or in informal words is infinite). In the following the terms normalized and mean with reference to energy and power will be discharged for notation simplicity. For a finite energy signal x(t) the following expression of its energy (Parseval theorem) holds: E x(t) x(t) 2 dt X(f) 2 df where X(f) is the Fourier transform of x(t): X(f) F(x(t)). X(f) 2 is called the Energy Spectral Density of the signal x(t) and it describes how the energy of x(t) is distributed at the various frequencies. Consider a linear system characterized by an impulse response h(t) to which corresponds a transfer function H(f) F(h(t)) that is 0 every where except in a very small frequency interval f centered around f 0 in which it is equal to. The Fourier transform of the system output will be Y (f) X(f)H(f). For the Parseval theorem E y(t) Y (f) 2 df X(f) 2 H(f) 2 df f 0+ f f 0 f X(f) 2 df f 0 X(f 0 ) 2 f. Therefore X(f 0 ) 2 is the Energy Spectral Density of x(t) at f f 0 (the unique frequency component that is not zeroed by the considered system). We can write X(f) 2 as X(f) X(f) F(x(t) x ( t) therefore the Energy Spectral Density of the deterministic signal x(t) can be seen as the Fourier Transform of the deterministic autocorrelation of the signal: R x(t) (τ) x (t)x(t + τ)dt. Given a signal with finite power (characterized by infinite energy) we can consider a truncated version of it (between e T/2): x T (t). This new signal has finite energy and it is possible to evaluate its Energy Spectral Density: X T (f) 2 where X T (f) F(x T (t)). We can define the Power Spectral Density of x T (t) as S xt (t) T X T (f) 2 T x(t)e j2πft dt Increasing T till infinite we obtain the Power Spectral Density of x(t): S x(t) lim S x T (t) lim x(t)e j2πft dt T T T Also the Power Spectral Density can be seen as the Fourier Transform of the autocorrelation function of the considered deterministic signal, but it is necessary to define the autocorrelation in a slightly different way with respect to what defined before: 2 2 3
4 T R x(t) (τ) lim T T T x (t)x(t + τ)dt. This new definition is in any case necessary because the signal has now finite power and not finite energy. 2 Energy/Power Spectral Density for Discrete Deterministic Signals It is interesting to define the energy and power associate do a discrete deterministic signal given by the sequence x(nt ) with n that spans from to, where nt are the time instants at which the samples are available. The energy and power of this discrete signal can be defined as the energy of the continuous signal that can interpolated from x(nt ) by using an ideal reconstruction filter (that has impulse response ψ(t) sin( π T t) π T t : the energy of this signal results: x(t) x(t) 2 dt n x(nt )ψ(t nt ) n 2 x(nt )ψ(t nt ) dt to evaluate this integral it is necessary to solve integrals of the type: ψ(t it )ψ(t mt )dt The Fourier transform of ψ(t) is a box function in the frequency domain centered in the origin with /T width and T height. Applying the Parseval theorem in its general formulation: it is possible to write: x(t)y(t)dt ψ(t it )ψ(t mt )dt T 2 X( f)y (f)df e j2πf(m i)t df T 2 X(f)Y ( f)df (T e j2πfit ) (T e j2πfmt )df cos(2πf(m i)t ) the considered integral has value T 2 /T T per i m and 0 for i m. Therefore we may write: x(t ) 2 dt n 2 x(nt )ψ(t nt ) dt T n x(nt ) 2 4
5 The energy of x(t) is equal to the energy of a step-wise signal where each step has value x(nt ). In the case that T n x(nt ) 2 assumes a finite value we consider this as the energy of the discrete signal x(nt ). When x(nt ) has no finite energy, we can try to evaluate its power. At first we evaluate t0 t 0 x(t) 2 dt T t 0/T n t 0 /T x(nt ) 2 with t 0 KT where K is very big. This condition on K is necessary to ensure that the area of the square values of the tails of the sinc functions associated to each sample that fall outside t 0 /2) and t 0 /2 is negligible with respect to t 0 t 0 x(t) 2 dt. Obviously it is also true 2t 0 t0 t 0 x(t) 2 dt T 2t 0 t 0/T n t 0/T x(nt ) 2 The previous relation may be written also as x(t) 2 x(nt ) 2 that is valid also for t 0. Therefore the power of x(t) is equal to the mean of the square values of the samples used to generate it. The mean of the sample square values is defined also as the power of the discrete signal x(nt ). Note that the power of a sample sequence is independent from to the sampling rate. Considering a discrete deterministic signal x(nt ) with finite energy (T n x(nt ) 2 ), in coherence with what shown for continuous signal, we have an Energy Spectral Density (ESD) that is X(f) 2 where X(f) is the Discrete Time Fourier Transform (DTFT) of x(nt ): X(f) T n x(nt )e j2πfnt. The ESD can be seen as the DTFT of the autocorrelation function of the signal: R x(nt ) (kt ) T n x (nt )x((n+k)t ) x(kt ) x ( kt ). X(f) is a periodic function, with period /T. The Inverse DTFT (IDTFT) is therefore defined as: x(nt ) X(f)e j2πfnt df. The energy of x(nt ) can be evaluated integrating the ESD in the same frequency interval: X(f) 2 df. If we work with normalized time/frequency axes (t n t/t, f n ft ) the scaling factor T disappears in the DTFT definition and the ESD must be integrated between /2 and /2 to evaluate the total energy, but it is necessary to multiply the ESD by T to obtain the correct result is the real sampling rate is T. 3 Energy/Power Spectral Density for Deterministic Signals through LTI systems It is easy to show that for both continuous and discrete deterministic signal the ESD and PSD resoect the following relationship when the signals are applied to an LTI system with transfer function H(f) or H(e j2πf ): ESD/P SD output (f) ESD/P SD input (f) H(f) 2 ESD/P SD output (e j2πf ) ESD/P SD input (e j2πf ) H(e j2πf ) 2 5
6 4 Random Processes As known a real random variable x is a mapping between the sample space S and the real line R. That is, x : S R. A real continuous random process (also known as stochastic process) is a mapping from the sample space into an ensemble of time functions (known as sample functions). To every ρ S there corresponds a function of time (a sample function) x(t; ρ). Often, from the notation, we drop the ρ variable, and write just x(t). However, the sample space ρ variable is always there, even if it is not shown explicitly. For a random process x(t) the first-order probability distribution function is defined as F x(t) (a; t) P [x(t) a] and the first-order density function is defined as f x(t) (a; t) df (a; t) da These definition can be generalized to n-th order case. distribution function is: In particular the n-th order F x(t) (a, a 2,... a n ; t, t 2,..., t n ) P [x(t ) a, x(t 2 ) a 2,..., x(t n ) a n ] and the n-th order density function is f x(t) (a, a 2,..., a n ; t, t 2,..., t n ) F x(t)(a, a 2,... a n ; t, t 2,..., t n ) a a 2... a n In general a complete statistical description of a random process requires knowledge of all order distribution function. A process is said to be stationary if its statistical properties do not change with time. More precisely x(t) is stationary if: F x(t) (a, a 2,... a n ; t, t 2,..., t n ) F x(t) (a, a 2,... a n ; t + c, t 2 + c,..., t n + c) For a random process it is possible to define also statistical averages. The first order statistical average is µ(t) E[x(t)] af x(t) (a; t)da the autocorrelation function is defined for a real process as R(t, t 2 ) E[x(t )x(t 2 )] A process x(t) is said to be wide-sense stationary if: a a 2 f x(t) (a, a 2 ; t, t 2 )da da 2 the mean µ(t) E[x(t)] is a constant, it does not depend on t; 6
7 the autocorrelation function R(t, t + τ) E[x(t)x(t + τ)] depends only on the time difference (τ): R(t, t + τ) R(τ) The stationarity of a process implies the wide-sense stationarity, however the converse is not true. A process is said to be ergodic if all orders os statistical and time averages are interchangeable. For these processes the mean, autocorrelation and other statistics can be computed by using any sample function of the process. That is, for the mean and autocorrelation: µ x(t) E[x(t)] T af x(t) (a; t)da lim x(t; ρ)dt T T R(τ) E[x(t)x(t+τ)] a a 2 f x(t) (a, a 2 ; t, t+τ)da da 2 lim T T x(t; ρ)x(t+τ; ρ)dt T where x(t; ρ) is a process sample function. What has been said for real continuous random processes can be easily extended to complex and discrete processes. In particular for a complex continuous process the autocorrelation function is defined as R(t, t + τ) E[x(t) x(t + τ)] where x(t) indicates the process that is the complex conjugate of x(t) (each sample function of x(t) is the complex conjugate of the correspondent sample function of x(t)). And for a complex discrete process the autocorrelation function becomes: R(n, n + k) E[x(n) x(n + k)] For a complex process that is stationary al least in the wide-sense it is possible to define the statistical power as: P x(t) E[ x(t) 2 ] E[x(t) x(t)] R x(t) (0) The extension of the definition for a complex discrete wide sense stationary process is straightforward. The principal properties of the autocorrelation function can summarized as: R x(t) (0) P x(t) 0 R x(t) (τ) R x(t) (0) R x(t) (τ) R x(t) ( τ) for discrete processes the same properties can be written as R x(n) (0) P x(n) 0 R x(n) (k) R x(n) (0) 7
8 R x(n) (k) R x(n) ( k) Due to the wide-sense stationarity of the considered processes the statistical power can be seen also defined (in the continuous case) as: T P x(t) (ρ) lim x(t; ρ) x(t; ρ)dt T T P x(t) E[P x(t) (ρ)] where ρ is used to select a specific sample function of the process. Therefore the statistical power of a process can be interpreted as a statistical mean of the deterministic power associated to each sample function. In several situations it could be useful to know (in a statistical way) what fraction of the total statistical power of a process is associated to a specific range of frequencies. 5 Random Processes and LTI systems A Linear Time Invariant (LTI) system, with one input and one output, is characterized by its impulse response (h(t) or h(n)) that is, in the more general case, a complex function. Each sample function of a random process x(t) applied to a LTI system generates an output signal that can be seen as a sample function of another random process y(t). In the case that the input process x(t) is WSS also the output process y(t) will be WSS. The following expressions hold for the continuous case: µ y(t) µ x(t) h(t)dt µ x(t) H(0) H(f) F(h(t)) R y(t) (τ) R x(t) (τ) h(τ) h ( τ) R x(t) (τ) R h(t) (τ) where H(f) F(h(t)) is the Fourier transform of the impulse response and R h(t) (τ) h (α)h(τ + α)dα is the deterministic autocorrelation of the impulse response. Analogous considerations can be made for discrete WSS processes. 6 Power Spectral Density for Continuous Random Processes Let x(t) be a continuous wide-sense stationary random process with autocorrelation function: R x(t) (τ) E[x (t)x(t + τ)] for each sample function of the process x(t; ρ) we can define the truncated Fourier transform: X T (f) x(t)e j2πft dt 8
9 The corresponding truncated power spectral density is T X T (f) 2. Since x(t) is a random process, for each f, T X T (f) 2 is a random variable. Let us denote its expectation by S x(t),t (f) E[ T X T (f) 2 ] and a natural definition of the power spectral density of the process is therefore S x(t) (f) lim T S x(t),t (f) The Wiener-Khintchine asserts that the limit indicated in the previous formula exists for all f and its value is S x(t) (f) R x(t) (τ)e j2πfτ dτ The unique required condition is that the Fourier Transform of the autocorrelation function exists. Proof: [ E X T (f) 2] E E [ 2 x(t)e j2πft dt x(t)x(τ) e j2π(t τ) dtdτ E [x(t)x(τ) ] e j2π(t τ) dtdτ R x(t) (t τ)e j2π(t τ) dtdτ ] We have to solve and integral of the type: f(t τ)dtdτ with the change of variable α t τ the integral becomes: τ τ f(α)dαdτ The domain over which the integral is evaluated is reported in figure. Following the previous expression the integral is made along vertical strips (along which f(α) is not a constant). It is more useful to revert the order of the two integral (in this case the integration is made along horizontal strips, for which f(α) is constant). Therefore it is 9
10 T d -T/2 d T/2 -T Figure : Integration domain of τ τ f(α)dαdτ possible to write: 0 T 0 T α f(α) α 0 T f(α)dτdα + dτdα + τ τ T α 0 T 0 (T + α)f(α)dα + α f(α) T 0 T f(α)dαdτ f(α)dτdα dτdα (T α)f(α)dα T (T α )f(α)dα This result is obvious looking at figure and remembering that along horizontal strips f(α) cost. Therefore [ E X T (f) 2] R x(t) (t τ)e j2π(t τ) dtdτ T T (T α )R x(t) (α)e j2πfτ dα normally the independent variable of the autocorrelation function of a WSS process is τ, and so changing α in τ: [ ] T E T X T (f) 2 ( τ T T )R x(t)(τ)e j2πfτ dτ R x(t),t (τ)e j2πfτ dτ 0
11 where we have defined R x(t),t (τ) { ( τ T )R x(t) τ < T 0 τ T From an intuitive point of view considering the previous formula it is therefore easy to accept that S x(t) (f) lim S x(t),t (f) lim E[ T T T X T (f) 2 ] T lim ( τ T T T )R x(t)(τ)e j2πfτ dτ R x(τ) e j2πfτ dτ in fact for T the term ( τ T ) for each significant value of τ. Formally we can use the Lebesgue-dominated-convergence theorem to prove the previous expression. The theorem says that: let (f n ) be a sequence of complex-valued measurable functions which converges almost everywhere to a complex-valued measurable function f. If there exists an integrable function g such that f n g for all n, then f is integrable and, in fact, fdµ lim f n dµ n If we take the f n s as the complex-valued functions R x(t),t (τ)e j2πfτ, then the corresponding limit is f R x(t) (τ)e j2πfτ. Moreover, we can take the integrable function to be g R x(t) (τ). Then from the definition of R x(t),t (τ) it is straightforward to see that R x(t),t (τ)e j2πfτ R x(t) (τ) and the Lebesgue-dominated-convergence theorem applies. Therefore S x(t) (f) lim E[ T T X T (f) 2 ] T lim ( τ T T T )R x(t)(τ)e j2πfτ dτ R x(τ) e j2πfτ dτ 7 Power Spectral Density for Discrete Random Processes Let x(n) be a discrete wide-sense stationary random process with autocorrelation function: R x(n) (k) E[x (n)x(n + k)] for each sample function of the process x(n; ρ) we can define the truncated Fourier transform: X T (e j2πf ) n N x(n)e j2πfn
12 The corresponding truncated power spectral density is 2N+ X N(f) 2. Since x(n) is a random process, for each e j2πf, 2N+ X T (e j2πf ) 2 is a random variable. Let us denote its expectation by [ ] S x(t),n (e j2πf ) E 2N + X N(e j2πf 2 and also in this case a natural definition of the power spectral density of the process is therefore S x(n) (e j2πf ) lim N S x(n),n (e j2πf The Wiener-Khintchine asserts that the limit indicated in the previous formula exists for all e j2πf and its value, for a discrete process, is S x(n) (e j2πf ) k R x(n) (k)e j2πfk The unique required condition is that the Fourier Transform of the autocorrelation function exists. 2
13 Proof S x(n) (e j2πf ) lim N E lim N [ ] 2N + X N (e j2πf 2 [( N ) ( 2N + E x(n)e j2πn n N [ N lim N 2N + E lim N 2N + lim N 2N + lim lim N M lim N 2N + lim N 2N + ( k ( k n N m N n N m N n N m N 2N + n N m M lim N m N x(n)x(m) e j2π(n m) ] E[x(n)x(m) ]e j2π(n m) R x (n m)e j2π(n m) M M M n N m M n N R x (k)e j2πk ) R x (k)e j2πk ) ( k lim N R x (n m)e j2π(n m) x(m)e j2πm ) ] R x (n m)e j2π(n m) kn m R x (k)e j2πk ) 2N + n N In coherence with the definition of the Discrete Time Fourier Transform: X(e j2πf ) x(n) n /2 /2 x(n)e j2πfn X(f)e j2πfm df it is P x(n) R x(n) (0) /2 /2 S x(n) (e j2πf )df 3
14 In all the previous discussions on the PSD associated to discrete processes it has been assumed that the sampling rate of x(n) was unitary. In the case that the sampling time is T (and not ) the previous relations hold considering to work with normalized time and frequency axes (t n t/t, f n ft ). On the basis of what shown in the section 5 it is immediate to understand how is modified the PSD of a WSS process (continuous or discrete) when it is applied as input to a LTI system: S output (f) S input (f) H(f) 2 S output (e j2πf ) S input (e j2πf ) H(e j2πf ) 2 this result is exactly the same obtained for deterministic signals. 4
Lecture 8 ELE 301: Signals and Systems
Lecture 8 ELE 3: Signals and Systems Prof. Paul Cuff Princeton University Fall 2-2 Cuff (Lecture 7) ELE 3: Signals and Systems Fall 2-2 / 37 Properties of the Fourier Transform Properties of the Fourier
More informationProbability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
More informationChapter 8 - Power Density Spectrum
EE385 Class Notes 8/8/03 John Stensby Chapter 8 - Power Density Spectrum Let X(t) be a WSS random process. X(t) has an average power, given in watts, of E[X(t) ], a constant. his total average power is
More information5 Signal Design for Bandlimited Channels
225 5 Signal Design for Bandlimited Channels So far, we have not imposed any bandwidth constraints on the transmitted passband signal, or equivalently, on the transmitted baseband signal s b (t) I[k]g
More informationEE 179 April 21, 2014 Digital and Analog Communication Systems Handout #16 Homework #2 Solutions
EE 79 April, 04 Digital and Analog Communication Systems Handout #6 Homework # Solutions. Operations on signals (Lathi& Ding.3-3). For the signal g(t) shown below, sketch: a. g(t 4); b. g(t/.5); c. g(t
More informationPower Spectral Density
C H A P E R 0 Power Spectral Density INRODUCION Understanding how the strength of a signal is distributed in the frequency domain, relative to the strengths of other ambient signals, is central to the
More informationFrom Fundamentals of Digital Communication Copyright by Upamanyu Madhow, 2003-2006
Chapter Introduction to Modulation From Fundamentals of Digital Communication Copyright by Upamanyu Madhow, 003-006 Modulation refers to the representation of digital information in terms of analog waveforms
More informationUNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2009 Linear Systems Fundamentals
UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2009 Linear Systems Fundamentals MIDTERM EXAM You are allowed one 2-sided sheet of notes. No books, no other
More informationReview of Fourier series formulas. Representation of nonperiodic functions. ECE 3640 Lecture 5 Fourier Transforms and their properties
ECE 3640 Lecture 5 Fourier Transforms and their properties Objective: To learn about Fourier transforms, which are a representation of nonperiodic functions in terms of trigonometric functions. Also, to
More informationmin ǫ = E{e 2 [n]}. (11.2)
C H A P T E R 11 Wiener Filtering INTRODUCTION In this chapter we will consider the use of LTI systems in order to perform minimum mean-square-error (MMSE) estimation of a WSS random process of interest,
More informationThe continuous and discrete Fourier transforms
FYSA21 Mathematical Tools in Science The continuous and discrete Fourier transforms Lennart Lindegren Lund Observatory (Department of Astronomy, Lund University) 1 The continuous Fourier transform 1.1
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationSGN-1158 Introduction to Signal Processing Test. Solutions
SGN-1158 Introduction to Signal Processing Test. Solutions 1. Convolve the function ( ) with itself and show that the Fourier transform of the result is the square of the Fourier transform of ( ). (Hints:
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationConvolution, Correlation, & Fourier Transforms. James R. Graham 10/25/2005
Convolution, Correlation, & Fourier Transforms James R. Graham 10/25/2005 Introduction A large class of signal processing techniques fall under the category of Fourier transform methods These methods fall
More informationDigital Transmission (Line Coding)
Digital Transmission (Line Coding) Pulse Transmission Source Multiplexer Line Coder Line Coding: Output of the multiplexer (TDM) is coded into electrical pulses or waveforms for the purpose of transmission
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationUNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2010 Linear Systems Fundamentals
UNIVERSITY OF CALIFORNIA, SAN DIEGO Electrical & Computer Engineering Department ECE 101 - Fall 2010 Linear Systems Fundamentals FINAL EXAM WITH SOLUTIONS (YOURS!) You are allowed one 2-sided sheet of
More informationTCOM 370 NOTES 99-4 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS
TCOM 370 NOTES 99-4 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS 1. Bandwidth: The bandwidth of a communication link, or in general any system, was loosely defined as the width of
More informationNRZ Bandwidth - HF Cutoff vs. SNR
Application Note: HFAN-09.0. Rev.2; 04/08 NRZ Bandwidth - HF Cutoff vs. SNR Functional Diagrams Pin Configurations appear at end of data sheet. Functional Diagrams continued at end of data sheet. UCSP
More informationOverview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationFrequency Response of FIR Filters
Frequency Response of FIR Filters Chapter 6 This chapter continues the study of FIR filters from Chapter 5, but the emphasis is frequency response, which relates to how the filter responds to an input
More informationLecture 7 ELE 301: Signals and Systems
Lecture 7 ELE 3: Signals and Systems Prof. Paul Cuff Princeton University Fall 2-2 Cuff (Lecture 7) ELE 3: Signals and Systems Fall 2-2 / 22 Introduction to Fourier Transforms Fourier transform as a limit
More informationClass Note for Signals and Systems. Stanley Chan University of California, San Diego
Class Note for Signals and Systems Stanley Chan University of California, San Diego 2 Acknowledgement This class note is prepared for ECE 101: Linear Systems Fundamentals at the University of California,
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More information3.5.1 CORRELATION MODELS FOR FREQUENCY SELECTIVE FADING
Environment Spread Flat Rural.5 µs Urban 5 µs Hilly 2 µs Mall.3 µs Indoors.1 µs able 3.1: ypical delay spreads for various environments. If W > 1 τ ds, then the fading is said to be frequency selective,
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More information(Refer Slide Time: 01:11-01:27)
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 6 Digital systems (contd.); inverse systems, stability, FIR and IIR,
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationLecture 18: The Time-Bandwidth Product
WAVELETS AND MULTIRATE DIGITAL SIGNAL PROCESSING Lecture 18: The Time-Bandwih Product Prof.Prof.V.M.Gadre, EE, IIT Bombay 1 Introduction In this lecture, our aim is to define the time Bandwih Product,
More information1 Short Introduction to Time Series
ECONOMICS 7344, Spring 202 Bent E. Sørensen January 24, 202 Short Introduction to Time Series A time series is a collection of stochastic variables x,.., x t,.., x T indexed by an integer value t. The
More informationLectures 5-6: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More informationTTT4120 Digital Signal Processing Suggested Solution to Exam Fall 2008
Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT40 Digital Signal Processing Suggested Solution to Exam Fall 008 Problem (a) The input and the input-output
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More information1.1 Discrete-Time Fourier Transform
1.1 Discrete-Time Fourier Transform The discrete-time Fourier transform has essentially the same properties as the continuous-time Fourier transform, and these properties play parallel roles in continuous
More informationProbability density function : An arbitrary continuous random variable X is similarly described by its probability density function f x = f X
Week 6 notes : Continuous random variables and their probability densities WEEK 6 page 1 uniform, normal, gamma, exponential,chi-squared distributions, normal approx'n to the binomial Uniform [,1] random
More informationAnalysis/resynthesis with the short time Fourier transform
Analysis/resynthesis with the short time Fourier transform summer 2006 lecture on analysis, modeling and transformation of audio signals Axel Röbel Institute of communication science TU-Berlin IRCAM Analysis/Synthesis
More informationTransformations and Expectations of random variables
Transformations and Epectations of random variables X F X (): a random variable X distributed with CDF F X. Any function Y = g(x) is also a random variable. If both X, and Y are continuous random variables,
More informationOPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS
ONDERZOEKSRAPPORT NR 8904 OPTIMAl PREMIUM CONTROl IN A NON-liFE INSURANCE BUSINESS BY M. VANDEBROEK & J. DHAENE D/1989/2376/5 1 IN A OPTIMAl PREMIUM CONTROl NON-liFE INSURANCE BUSINESS By Martina Vandebroek
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationTime Series Analysis in WinIDAMS
Time Series Analysis in WinIDAMS P.S. Nagpaul, New Delhi, India April 2005 1 Introduction A time series is a sequence of observations, which are ordered in time (or space). In electrical engineering literature,
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationAdvanced Signal Processing and Digital Noise Reduction
Advanced Signal Processing and Digital Noise Reduction Saeed V. Vaseghi Queen's University of Belfast UK WILEY HTEUBNER A Partnership between John Wiley & Sons and B. G. Teubner Publishers Chichester New
More informationThe Fourier Analysis Tool in Microsoft Excel
The Fourier Analysis Tool in Microsoft Excel Douglas A. Kerr Issue March 4, 2009 ABSTRACT AD ITRODUCTIO The spreadsheet application Microsoft Excel includes a tool that will calculate the discrete Fourier
More information9 Fourier Transform Properties
9 Fourier Transform Properties The Fourier transform is a major cornerstone in the analysis and representation of signals and linear, time-invariant systems, and its elegance and importance cannot be overemphasized.
More informationThroughout this text we will be considering various classes of signals and systems, developing models for them and studying their properties.
C H A P T E R 2 Signals and Systems This text assumes a basic background in the representation of linear, time-invariant systems and the associated continuous-time and discrete-time signals, through convolution,
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More information4 Lyapunov Stability Theory
4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We
More informationThe Calculation of G rms
The Calculation of G rms QualMark Corp. Neill Doertenbach The metric of G rms is typically used to specify and compare the energy in repetitive shock vibration systems. However, the method of arriving
More informationUnified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
More informationFFT Algorithms. Chapter 6. Contents 6.1
Chapter 6 FFT Algorithms Contents Efficient computation of the DFT............................................ 6.2 Applications of FFT................................................... 6.6 Computing DFT
More informationThe Fourier Series of a Periodic Function
1 Chapter 1 he Fourier Series of a Periodic Function 1.1 Introduction Notation 1.1. We use the letter with a double meaning: a) [, 1) b) In the notations L p (), C(), C n () and C () we use the letter
More information3 Signals and Systems: Part II
3 Signals and Systems: Part II Recommended Problems P3.1 Sketch each of the following signals. (a) x[n] = b[n] + 3[n - 3] (b) x[n] = u[n] - u[n - 5] (c) x[n] = 6[n] + 1n + (i)2 [n - 2] + (i)ag[n - 3] (d)
More informationcorrect-choice plot f(x) and draw an approximate tangent line at x = a and use geometry to estimate its slope comment The choices were:
Topic 1 2.1 mode MultipleSelection text How can we approximate the slope of the tangent line to f(x) at a point x = a? This is a Multiple selection question, so you need to check all of the answers that
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationThe Algorithms of Speech Recognition, Programming and Simulating in MATLAB
FACULTY OF ENGINEERING AND SUSTAINABLE DEVELOPMENT. The Algorithms of Speech Recognition, Programming and Simulating in MATLAB Tingxiao Yang January 2012 Bachelor s Thesis in Electronics Bachelor s Program
More informationSystems with Persistent Memory: the Observation Inequality Problems and Solutions
Chapter 6 Systems with Persistent Memory: the Observation Inequality Problems and Solutions Facts that are recalled in the problems wt) = ut) + 1 c A 1 s ] R c t s)) hws) + Ks r)wr)dr ds. 6.1) w = w +
More informationAbout the Gamma Function
About the Gamma Function Notes for Honors Calculus II, Originally Prepared in Spring 995 Basic Facts about the Gamma Function The Gamma function is defined by the improper integral Γ) = The integral is
More informationCorrelation and Convolution Class Notes for CMSC 426, Fall 2005 David Jacobs
Correlation and Convolution Class otes for CMSC 46, Fall 5 David Jacobs Introduction Correlation and Convolution are basic operations that we will perform to extract information from images. They are in
More information3.1 State Space Models
31 State Space Models In this section we study state space models of continuous-time linear systems The corresponding results for discrete-time systems, obtained via duality with the continuous-time models,
More informationChapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationHypothesis Testing for Beginners
Hypothesis Testing for Beginners Michele Piffer LSE August, 2011 Michele Piffer (LSE) Hypothesis Testing for Beginners August, 2011 1 / 53 One year ago a friend asked me to put down some easy-to-read notes
More informationSignal Detection C H A P T E R 14 14.1 SIGNAL DETECTION AS HYPOTHESIS TESTING
C H A P T E R 4 Signal Detection 4. SIGNAL DETECTION AS HYPOTHESIS TESTING In Chapter 3 we considered hypothesis testing in the context of random variables. The detector resulting in the minimum probability
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationSampling Theorem Notes. Recall: That a time sampled signal is like taking a snap shot or picture of signal periodically.
Sampling Theorem We will show that a band limited signal can be reconstructed exactly from its discrete time samples. Recall: That a time sampled signal is like taking a snap shot or picture of signal
More informationSection 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations
Difference Equations to Differential Equations Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate
More informationNonparametric adaptive age replacement with a one-cycle criterion
Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk
More informationSTAT 830 Convergence in Distribution
STAT 830 Convergence in Distribution Richard Lockhart Simon Fraser University STAT 830 Fall 2011 Richard Lockhart (Simon Fraser University) STAT 830 Convergence in Distribution STAT 830 Fall 2011 1 / 31
More informationApplication of Fourier Transform to PDE (I) Fourier Sine Transform (application to PDEs defined on a semi-infinite domain)
Application of Fourier Transform to PDE (I) Fourier Sine Transform (application to PDEs defined on a semi-infinite domain) The Fourier Sine Transform pair are F. T. : U = 2/ u x sin x dx, denoted as U
More informationThe Z transform (3) 1
The Z transform (3) 1 Today Analysis of stability and causality of LTI systems in the Z domain The inverse Z Transform Section 3.3 (read class notes first) Examples 3.9, 3.11 Properties of the Z Transform
More informationMath 526: Brownian Motion Notes
Math 526: Brownian Motion Notes Definition. Mike Ludkovski, 27, all rights reserved. A stochastic process (X t ) is called Brownian motion if:. The map t X t (ω) is continuous for every ω. 2. (X t X t
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More informationAnalog and Digital Signals, Time and Frequency Representation of Signals
1 Analog and Digital Signals, Time and Frequency Representation of Signals Required reading: Garcia 3.1, 3.2 CSE 3213, Fall 2010 Instructor: N. Vlajic 2 Data vs. Signal Analog vs. Digital Analog Signals
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationMathematical Finance
Mathematical Finance Option Pricing under the Risk-Neutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationIntroduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
More informationProbability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..
Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,
More informationManual for SOA Exam MLC.
Chapter 5. Life annuities. Section 5.7. Computing present values from a life table Extract from: Arcones Manual for the SOA Exam MLC. Spring 2010 Edition. available at http://www.actexmadriver.com/ 1/30
More informationSAMPLE SOLUTIONS DIGITAL SIGNAL PROCESSING: Signals, Systems, and Filters Andreas Antoniou
SAMPLE SOLUTIONS DIGITAL SIGNAL PROCESSING: Signals, Systems, and Filters Andreas Antoniou (Revision date: February 7, 7) SA. A periodic signal can be represented by the equation x(t) k A k sin(ω k t +
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More information1 Error in Euler s Method
1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of
More information5.3 Improper Integrals Involving Rational and Exponential Functions
Section 5.3 Improper Integrals Involving Rational and Exponential Functions 99.. 3. 4. dθ +a cos θ =, < a
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationTime Series Analysis
Time Series Analysis Autoregressive, MA and ARMA processes Andrés M. Alonso Carolina García-Martos Universidad Carlos III de Madrid Universidad Politécnica de Madrid June July, 212 Alonso and García-Martos
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationCONTROL SYSTEMS, ROBOTICS, AND AUTOMATION - Vol. V - Relations Between Time Domain and Frequency Domain Prediction Error Methods - Tomas McKelvey
COTROL SYSTEMS, ROBOTICS, AD AUTOMATIO - Vol. V - Relations Between Time Domain and Frequency Domain RELATIOS BETWEE TIME DOMAI AD FREQUECY DOMAI PREDICTIO ERROR METHODS Tomas McKelvey Signal Processing,
More informationTime Series Analysis: Introduction to Signal Processing Concepts. Liam Kilmartin Discipline of Electrical & Electronic Engineering, NUI, Galway
Time Series Analysis: Introduction to Signal Processing Concepts Liam Kilmartin Discipline of Electrical & Electronic Engineering, NUI, Galway Aims of Course To introduce some of the basic concepts of
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationThe Derivative. Philippe B. Laval Kennesaw State University
The Derivative Philippe B. Laval Kennesaw State University Abstract This handout is a summary of the material students should know regarding the definition and computation of the derivative 1 Definition
More informationSignal to Noise Instrumental Excel Assignment
Signal to Noise Instrumental Excel Assignment Instrumental methods, as all techniques involved in physical measurements, are limited by both the precision and accuracy. The precision and accuracy of a
More informationEE2/ISE2 Communications II
EE2/ISE2 Communications II Part I Communications Principles Dr. Darren Ward Chapter 1 Introduction 1.1 Background Communication involves the transfer of information from one point to another. In general,
More information