University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis

Size: px
Start display at page:

Download "University of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis"

Transcription

1 University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical Engineering University of Connecticut xchen@engr.uconn.edu

2 Contents Background. Periodic functions Orthogonal decomposition Fourier series 3 2. Arbitrary period Even and odd functions Application example: ODE with special inputs Complex Fourier series 7 4 Fourier integral 8 5 Fourier transform 6 *Discrete Fourier analysis 6. Discrete Fourier series Discrete-time Fourier transform (DTFT) Discrete Fourier transform (DFT)

3 Notations: If x is complex, R (x) and I (x) denote, respectively, the real and imaginary parts of x. x, y denotes the inner product of x and y. Background Fourier analysis is important in modeling and solving partial differential equations related to boundary and initial value problems of mechanics, heat flow, electrostatics, and other fields.. Periodic functions A function f(x) is called periodic if f(x) is defined for all real x, except possibly at some points, and if there is some positive number p, called a period of f(x), such that f (x + p) = f (x) Remark. If p is a period of f(x), then clearly 2p, 3p,... are also periods of f (x). The smallest positive period is called the fundamental period..2 Orthogonal decomposition In vector spaces equipped with inner products, we have the following essential theorem. Theorem 2. Suppose {e, e 2,..., e n } is an orthogonal basis of a vector space V. Then for every v V, we have v = v, e e, e e + + v, e n e n, e n e n or, by using the norm notation, v = v, e e 2 e + + v, e n e n 2 e n Proof. Let v V. Because {e, e 2,..., e n } is a basis, there exists scalars α,..., α n such that v = α e + + α n e n Taking the inner product with e j (j =,..., n) yields v, e j = α e + + α n e n, e j = α e, e j + + α n e n, e j But the basis is orthogonal, hence e i, e j = if i j. This yields α e + + α n e n, e j = α j e j, e j

4 and thus v, e j = α j e j, e j α j = v, e j e j, e j Recall that we have the following fact. Fact (Inner product for functions, function spaces). The set of all real-valued continuous functions f (x), g (x),... x [α, β is a real vector space under the usual addition of functions and multiplication by scalars. An inner product on this function space is and the norm of f is f, g = ˆ β α f (x) g (x) dx ˆ β f (x) = α f (x) 2 dx As a very useful special case, the trigonometric system is a function space with orthogonal basis {sin nx, cos nx, } n=. To check, we first notice that the functions are all periodic with period 2π. The inner product in this case is f, g = f (x) g (x) dx Noting that, by checking the area under the graphs and noting the shape of sine and cosine functions, we have cos nxdx =, n =, 2,... () sin nxdx =, n =, 2,... This confirms the orthogonality between and sin nx or cos nx. Furthermore, using () we immediately know cos nx, cos mx = cos nx cos mxdx = = 2 cos (n + m) x + cos (n m) x dx 2 cos (n + m) xdx + 2 = + as long as n m cos (n m) xdx namely, cos nx and cos mx are orthogonal if m n. Similarly, as long as n m (by assumption, both m and n are positive integers), sin nx and sin mx are orthogonal. This is because sin nx, sin mx = sin nx sin mxdx = 2 cos (n m) x cos (n + m) x dx = 2

5 Furthermore, regardless of the values of m and n, we have sin nx, cos mx = sin nx cos mxdx = sin (n + m) x + sin (n m) x dx = 2 So sin nx and cos mx are always orthogonal. Sketch the plots of sine and cosine functions. You should find the above results intuitive. To perform the orthogonal decomposition under the trigonometric system, we need just one more thing the norms of the basis functions. They are sin nx 2 = sin nx, sin nx = cos nx 2 = 2 = 2 Fourier series (cos nx) 2 dx = dx = 2π (sin nx) 2 cos 2nx dx = dx = π 2 cos 2nx + dx = π 2 Fourier series is an extension of the orthogonal decomposition reviewed in the last section. Under the trigonometric system, the orthogonal decomposition of a function f (x) provided that the decomposition exists (we will talk about the existence very soon) is where and a n = a + a = (a n cos nx + b n sin nx) (2) n= f (x),, f (x), cos nx cos nx, cos nx = f (x) cos nxdx, b n = π = f (x) dx (3) 2π f (x), sin nx sin nx, sin nx = f (x) sin nxdx (4) π (2) is called the Fourier series of f (x). (3) and (4) are called the corresponding Fourier coefficients. Example 3. Find the Fourier coefficients of { k if π < x <, and f (x + 2π) = f (x) k if < x < π Such functions occur as external forces acting on mechanical systems, electromotive forces in electric circuits, etc. 3

6 (Solution: (sin x + 3 sin 3x + 5 sin 5x +... ) 4k π ) Theorem 4 (Existance of Fourier Series). Let f (x) be periodic with period 2π and piecewise continuous in the interval x π. Furthermore, let f (x) have a left-hand derivative and a right-hand derivative at each point of that interval. Then the Fourier series of f (x) converges. Its sum is f (x), except at points x o where f (x) is discontinuous. There the sum of the series is the average of the leftand right-hand limits of f (x) at x o. Hence a periodic function f (x + 2π) with /x, x [, π does not have a Fourier series extension, as it does not have a left- or right-hand derivative at x =. A discontinuous periodic function, with period 2π and {, < x <, π > x is piecewise continuous. At x =, it has a left-hand derivative of and a right-hand derivative of. Hence the function has a Fourier series expansion. 2. Arbitrary period The transition from period 2π to period p = 2L can be done by a suitable change of scale. If f (x) has a period 2L, we let v = x L π You can see, that x = ±L corresponds to v = ±π. So ( ) L f π v is periodic in v with period 2π. Now forget about f (x). Focus just on the new f ( L π v) with period 2π. The Fourier series is where f ( ) L π v = a + (a n cos nv + b n sin nv) n= a = ( ) L f 2π π v dv, a n = ( ) L f π π v cos nvdv, b n = ( ) L f π π v sin nvdv (5) 4

7 Changing back to the x notation, by using ( ) L f π v, v = x L π, dv = π L dx we have with a + (a n cos nπ L x + b n sin nπ ) L x n= (6) a = f (x) dx, a n = f (x) cos nπ 2L L L xdx, b n = f (x) sin nπ xdx (7) L L Example 5. Find the Fourier series of if 2 < x < k if < x <, p = 2L = 4, L = 2 if < x < 2 Answer: (cos π2 x 3 cos 3π2 x + 5 cos 5π2 x +... ) k 2 + 2k π 2.2 Even and odd functions It turns out that, if f(x) is even or odd, the Fourier series can be significantly simplified. because, if f (x) is an even function, then f (x) sin nxdx = as the integral of any odd function is zero. Hence in (7) b n = so that (6) simplifies to Furthermore, since f (x) is even, we have a + a n cos nπ L x n= This is a = 2L f (x) dx = L f (x) dx, a n = L Similarly, if f (x) is an odd function, then f (x) cos nxdx = 5 f (x) cos nπ L xdx = 2 L f (x) cos nπ L xdx

8 and b n sin nπ L x, b n = 2 L n= The following Theorem is intuitive and very useful. f (x) sin nπ L xdx Theorem 6. The Fourier series of a sum f + f 2 are the sums of the corresponding Fourier coefficients of f and f 2. The Fourier coefficients of cf are c times the corresponding Fourier coefficients of f. Here is one example of using the results in this subsection. Example 7 (Sawtooth wave). Find the Fourier series of the function x + π if π < x < π and f (x + 2π) = f (x) The basic idea is to decompose the function as f (x) + f 2 (x), f (x) = x, f 2 (x) = π f (x) is an odd function; f 2 (x) is an even function. Their Fourier coefficients are simpler to find. 2.3 Application example: ODE with special inputs Consider a mass spring damper system m d2 dt y + b d y + ky = r (t) 2 dt We have learned how to solve the nonhomogeneous ODE if r (t) is a standard function such as sine, cosine, power functions. Difficulty arises if r (t) is not a smooth function such as { t + π if π < t < 2 r (t) =, r (t + 2π) = r (t) t + π if < t < π 2 We can solve the problem by decomposing r (t) as a Fourier series and then use linearity of the ODE to obtain the solution. The solution is actually very interesting. For the case of the solution looks like that in Fig.. d 2 dt y +.5 d y + 25y = r (t) 2 dt 6

9 494 CHAP. Fourier Analysis y.3.2 Output t. Input.2 3 Complex Fourier series PROBLEM SET.3 Fig Input and steady-state output in Example Figure : Fig. 277 from [EK Instead of sin and cos functions, we can use {e jnx } j= as the (complex) basis for Fourier series. For. Coefficients better physical C n. Derive intuitions, the formula we for usually C n from write A n n the= program ω to Probs. 7 and with initial values of your s l. The formula for Fourier series (when it exists) is and B n. choice. 2. Change of spring and damping. In Example, what happens to the amplitudes C if we take a stiffer spring, f (x), e jω slx n say, of k 49? If we increase the damping? 3 6 e jωslx STEADY-STATE, e jωslx ejωslx (8) DAMPED OSCILLATIONS l= 3. Phase shift. Explain the role of the B n s. What happens Find the steady-state oscillations of ys cyr y r (t) if we let c :? Fact (Inner product for complex functions). with The c set and ofr (t) allas complex-valued given. Note that the continuous spring constantfunctions f (x), 4. Differentiation of input. In Example, what happens is k. Show the details. In Probs. 4 6 sketch r (t). if g we (x), replace.. r.(t) xwith its [α, derivative, β is athe complex rectangular vector wave? space undernthe usual addition of functions and multiplication What by scalars. is the ratio An of the inner new product C n to the old onones? this function 3. space r (t) is a (a n cos nt b n sin nt) n 5. Sign of coefficients. Some of the A n in Example are ˆ β positive, some negative. All B n are positive. Is this if p t g, f physically understandable? 4. = r (t) g b(x)f (x) dx and r(t 2p) r(t) α if t p 6 GENERAL SOLUTION 5. r (t) t (p 2 t 2 ) if p t p and and the norm of f is Find a general solution of the ODE ys v 2 y r (t) with r (t 2p) r (t) r (t) as given. Show the details of your work. 6. r (t) f (x) = ˆ β f, f = f (x) 2 dx 6. r (t) sin at sin bt, v 2 a 2, b 2 t if p>2 t p>2 7. r (t) sin t, v.5,.9,.,.5, e α and r(t 2p) r(t) p t if p>2 t 3p>2 8. Rectifier. Fact 8. r (t) e jωslx p/4 has ƒ cos at ƒ if norm p and r (t 2p) r (t), ƒ v ƒ, 2, 4, Á of t pt s = 2π/ω s 9. What Proof. kind By of definition solution is excluded in Prob. 8 by 7 9 RLC-CIRCUIT ƒ v ƒ, 2, 4, Á? Find the steady-state current I (t) in the RLC-circuit in. Rectifier. r (t) p/4 ƒ sin t ƒ if and r (t 2p) r (t), ƒ v ƒ, 2, 4, Á t 2p Fig. 275, where R, L H, C Fand with e jωslx = ˆ Ts/2 ˆ Ts/2 e jωslx, e jωslx = E (t) V as follows e jωslx and 2 periodic dx = with period 2p dx. Graph = or T s T if p t. r (t) b ƒ v ƒ, 3, 5, Á sketch the s/2 T first four partial sums. Note that s/2 the coefficients of the solution decrease rapidly. Hint. Remember that the if t p, ODE contains Er(t), not E (t), cf. Sec CAS Program. Write a program for solving the ODE The Fourier series expansion (8) hence simplifies to just considered and for jointly graphing input and output 7. E (t) b 5t 2 if p t of an initial value problem involving that ODE. Apply 5t 2 if t p f (x), e jω slx e jωslx T s l= 7

10 Example 9 (Fourier series of an impulse train). Show that l= δ (t lt s ) = T s l= e jωslt, ω s = 2π T s where δ (x) is the Kronecker-delta function satisfying δ (x) = if x = and δ (x) = otherwise. l= δ (t lt s) is periodic with period T s. You can check that e jωst also has a period of T s if ω s = 2π/T s. For the Fourier coefficients, we have ˆ Ts/2 f (t), e jω slt = δ (t) e jωslt dt = T s/2 Hence l= δ (t lt s ) = T s l= f (x), e jω slt e jωslt = T s l= e jωslt, ω s = 2π T s 4 Fourier integral What can be done to extend the method of Fourier series to nonperiodic functions? This is the idea of Fourier integrals. Let us consider an example of { if < x < f(x) = (9) otherwise This is not a periodic function. Construct a rectangular wave if < x < f L (x) = if < x <, f L (x + 2L) = f L (x) if < x < L We are going to make L increase from some small numbers to infinity, which recovers (9). The function is even. The Fourier coefficients are a = 2L ˆ dx = L, a n = L ˆ cos nπx L dx = 2 L ˆ cos nπx L dx = 2 sin (nπ/l) L nπ/l As L increases, the frequency of sin (nπ/l) increases. More generally, consider any periodic function f L (x) of period 2L that can be represented by f L (x) = a + [a n cos ω n x + b n sin ω n x, ω n = nπ L n= 8

11 where a = f (x) dx, a n = f (x) cos nπ 2L L L xdx, b n = f (x) sin nπ L L xdx or, in the notation of the newly introduced ω n = nπ/l: f L (x) = f L (v) dv + [ cos ω n x f L (v) cos ω n vdv + sin ω n x 2L L Notice that if we define then () is actually f L (x) = 2L + π n= f L (v) dv n= ω = ω n+ ω n = π L L = ω π f L (v) cos ω n vdv [ ω cos (ω n x) f L (v) cos ω n vdv + ω sin (ω n x) f L (v) cos ω n vdv We want to have an understanding of the case when L. Assume that lim L f L (x) is absolutely integrable, i.e. the following finite limit exists Then lim a ˆ a lim L f (x) dx + lim b ˆ b ˆ L f L (v) dv = 2L f (x) dx Let g (ω) = cos (ωx) L f L (v) cos ωvdv. The first summation in () is ωg (ω n ) = g (ω ) ω + g (ω 2 ) ω +... n= As ω = π/l if L, the last term in () thus looks like an integration [ cos ωx f (v) cos ωvdv + sin ωx f (v) cos ωvdv dω π Letting yields A (ω) = π f (v) cos ωvdv, B (w) = π [A (ω) cos ωx + B (ω) sin ωx dω f (v) sin ωvdv This is called a representation of f (x) (no longer periodic) by a Fourier integral. 9 () ()

12 Remark. The above construction is only an intuition. Nonetheless, the conclusion is correct. Theorem (Existance of Fourier Integral). If f (x) is piecewise continuous in every finite interval and has a right hand derivative and a left-hand derivative at every point and if the integral ˆ lim a a f (x) dx + lim b ˆ b exists, then f (x) can be represented by a Fourier integral with A (ω) = π f (x) dx [A (ω) cos ωx + B (ω) sin ωx dω (2) f (v) cos ωvdv, B (w) = π f (v) sin ωvdv (3) At a point where f (x) is discontinuous the value of the Fourier integral equals the average of the leftand right-hand limits of f (x) at that point. 5 Fourier transform With the Fourier integral formulas (2)-(3), we have Note that π = π = π [A (ω) cos ωx + B (ω) sin ωx dω f (v) [cos (ωv) cos (ωx) + sin (ωv) sin (ωx) dvdω [ f (v) cos (ωx ωv) dv dω f (v) cos (ωx ωv) dv is even in ω. Hence [ f (v) cos (ωx ωv) dv dω = 2π [ f (v) cos (ωx ωv) dv dω To simplify the equations, we add an integral term that equals : ˆ [ f (v) i sin (ωx ωv) dv dω =, i = 2π where the equality comes from the fact that f (v) sin (ωx ωv) dv is an odd function of ω. Adding up the last two equations gives [ f (v) e iω(x v) dv dω = 2π

13 or, equivalently 2π F (ω) = 2π F (ω) e iωx dω f (v) e iωv dv = 2π f (x) e iωx dx F (ω) is called the Fourier transform of f (x); f (x) is the inverse Fourier transform of F (ω). The above are often denoted as: F (ω) = F (f (x)), F (F (ω)) Remark 2. Many people prefer to use a different normalization coefficient, and write: f (x)= F (ω)= 2π F (ω) e iωx dω f (x) e iωx dx Theorem 3 (Existance of Fourier transform). If f (x) is absolutely integrable on the x-axis and piecewise continuous on every finite interval, then the Fourier transform of f (x) exists. Example 4. Find the Fourier transform of Solution: By definition {, x <, otherwise F (ω) = 2π ˆ e iωx dx = iω 2π ( e iω e iω) π sin ω = 2 ω 6 *Discrete Fourier analysis Fourier series (FS) and Fourier transforms (FT) apply only to continuous-time functions. Discrete Fourier series (DFS) and discrete Fourier transform (DFT) are their discrete versions when the function f (x) is defined at finitely many points. The main equations are summarized below. You can find the strong analogy between FS and DFS; as well as FT and DFT. For more details, see the reference [AO. 6. Discrete Fourier series A periodic bounded discrete sequence x [n has a discrete Fourier series (DFS) expansion x[n = N N k= X[ke j 2π N nk (4)

14 where the unnormalized DFS coefficients are X[k = N n= x[ne j 2π N nk (5) DFS properties Let x [n and X [k be defined as in (4) and (5). Then Sequence DFS coefficient x[n X[k x[n m e j 2π N km X[k e j 2π nl x[n N X[k l x 3 [n = N m= x [m x 2 [n m X3 [k = X [k X 2 [k X [n N x[ k (duality) 6.2 Discrete-time Fourier transform (DTFT) A bounded infinite sequence x [n can be decomposed as x[n = 2π ˆπ X(e jω )e jωn dω where X(e jω ) is called the DTFT of x [n and is defined as X(e jω ) = k= x[ke jωk Let x [n denote the complex conjugate sequence of x [n. If X (e jω ) is the DFT of x [n, then the following is true Sequence DTFT coefficient x [n X (e jω ) x [ n X (e jω ) (x[n + x [n)/2 R {X(e jω )} (x[n x [n)/(2j) I {X(e jω )} e jωn δ[n n e jωn x[n X(e j(ω ω) ) x[n = a n u[n X(e jω ) = ae jω 2

15 6.3 Discrete Fourier transform (DFT) A bounded sequence x [n defined on n {,..., N } can be decomposed as N X[ke j 2π N kn, n {,..., N } N x[n = k=, n / {,..., N } where X[k is the DFT of x [n and is defined as N x[ne 2πj N kn, k {,..., N } X[k = n=, k / {,..., N } DFT properties the DFT pair x[n X[k (finite-length x [n) is analogous to the DFS pair x[n X[k (infinite-length periodic x [n) if x[n is real, then X(k) = X [N k if N L, then DFT are samples of DTFT let x [n N x 2 [n := N m= if x[n = x[(( n)) N = x[n n, then X[k is real DFT coefficient table: Reference x [mx 2 [(n m) mod N. Then x [n N x 2 [n X [kx 2 [k Sequence DFT coefficient x[n X[k x [n X [(( k)) N x [(( n)) N X [k x[ne j2πnl/n X[(k l) mod N x[((n l)) N X[ke j2πkl/n R(x[n) 2 N + X [(( k)) N } I(x[n) 2 N X [(( k)) N } 2 x [(( n)) N } R(X[k) 2 x [(( n)) N } ji(x[k) N 2πkn 2 n= x[n cos( 2N x[n R X[k = X [N k [EK: ERwin Kreyszig, Advanced Engineering Mathematics, th edition [AO: Alan Oppenheim et al., Discrete-time Signal Processing, 2nd edition 3

Periodic functions: simple harmonic oscillator

Periodic functions: simple harmonic oscillator Periodic functions: simple harmonic oscillator Recall the simple harmonic oscillator (e.g. mass-spring system) d 2 y dt 2 + ω2 0y = 0 Solution can be written in various ways: y(t) = Ae iω 0t y(t) = A cos

More information

KREYSZIG E Advanced Engineering Mathematics (10th ed., Wiley 2011) Chapter 11 - Fourier analysis

KREYSZIG E Advanced Engineering Mathematics (10th ed., Wiley 2011) Chapter 11 - Fourier analysis KREYSZIG E Advanced Engineering Mathematics (th ed., Wiley ) Chapter - Fourier analysis . CHAPTER Fourier Analysis 474 This chapter on Fourier analysis covers three broad areas: Fourier series in Secs...4,

More information

Fourier Analysis Partial Differential Equations (PDEs)

Fourier Analysis Partial Differential Equations (PDEs) PART C Fourier Analysis. Partial Differential Equations (PDEs) CHAPTER CHAPTER Fourier Analysis Partial Differential Equations (PDEs) Chapter and Chapter are directly related to each other in that Fourier

More information

Fourier Analysis Fourier Series C H A P T E R 1 1

Fourier Analysis Fourier Series C H A P T E R 1 1 C H A P T E R Fourier Analysis 474 This chapter on Fourier analysis covers three broad areas: Fourier series in Secs...4, more general orthonormal series called Sturm iouville epansions in Secs..5 and.6

More information

3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series

3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series Definition 1 Fourier Series A function f is said to be piecewise continuous on [a, b] if there exists finitely many points a = x 1 < x 2

More information

Complex symmetry Signals and Systems Fall 2015

Complex symmetry Signals and Systems Fall 2015 18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The

More information

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

Partial Differential Equations

Partial Differential Equations Partial Differential Equations Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical Engineering University of Connecticut xchen@engr.uconn.edu Contents 1

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.

Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case. s of the Fourier Theorem (Sect. 1.3. The Fourier Theorem: Continuous case. : Using the Fourier Theorem. The Fourier Theorem: Piecewise continuous case. : Using the Fourier Theorem. The Fourier Theorem:

More information

Lecture 19: Discrete Fourier Series

Lecture 19: Discrete Fourier Series EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou

More information

Review: Continuous Fourier Transform

Review: Continuous Fourier Transform Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By

More information

Fourier and Partial Differential Equations

Fourier and Partial Differential Equations Chapter 5 Fourier and Partial Differential Equations 5.1 Fourier MATH 294 SPRING 1982 FINAL # 5 5.1.1 Consider the function 2x, 0 x 1. a) Sketch the odd extension of this function on 1 x 1. b) Expand the

More information

6.003 Homework #10 Solutions

6.003 Homework #10 Solutions 6.3 Homework # Solutions Problems. DT Fourier Series Determine the Fourier Series coefficients for each of the following DT signals, which are periodic in N = 8. x [n] / n x [n] n x 3 [n] n x 4 [n] / n

More information

Time-Frequency Analysis

Time-Frequency Analysis Time-Frequency Analysis Basics of Fourier Series Philippe B. aval KSU Fall 015 Philippe B. aval (KSU) Fourier Series Fall 015 1 / 0 Introduction We first review how to derive the Fourier series of a function.

More information

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its

More information

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.

More information

Signals and Systems Spring 2004 Lecture #9

Signals and Systems Spring 2004 Lecture #9 Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier

More information

2.2 The derivative as a Function

2.2 The derivative as a Function 2.2 The derivative as a Function Recall: The derivative of a function f at a fixed number a: f a f a+h f(a) = lim h 0 h Definition (Derivative of f) For any number x, the derivative of f is f x f x+h f(x)

More information

Second-Order Linear ODEs

Second-Order Linear ODEs C0.tex /4/011 16: 3 Page 13 Chap. Second-Order Linear ODEs Chapter presents different types of second-order ODEs and the specific techniques on how to solve them. The methods are systematic, but it requires

More information

Today s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm

Today s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier

More information

Discrete-Time Fourier Transform (DTFT)

Discrete-Time Fourier Transform (DTFT) Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]

More information

Vectors in Function Spaces

Vectors in Function Spaces Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also

More information

More on Fourier Series

More on Fourier Series More on Fourier Series R. C. Trinity University Partial Differential Equations Lecture 6.1 New Fourier series from old Recall: Given a function f (x, we can dilate/translate its graph via multiplication/addition,

More information

swapneel/207

swapneel/207 Partial differential equations Swapneel Mahajan www.math.iitb.ac.in/ swapneel/207 1 1 Power series For a real number x 0 and a sequence (a n ) of real numbers, consider the expression a n (x x 0 ) n =

More information

CS711008Z Algorithm Design and Analysis

CS711008Z Algorithm Design and Analysis CS711008Z Algorithm Design and Analysis Lecture 5 FFT and Divide and Conquer Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 56 Outline DFT: evaluate a polynomial

More information

Review of Discrete-Time System

Review of Discrete-Time System Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.

More information

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University

More information

Contents. Signals as functions (1D, 2D)

Contents. Signals as functions (1D, 2D) Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component

More information

Fourier Series Example

Fourier Series Example Fourier Series Example Let us compute the Fourier series for the function on the interval [ π,π]. f(x) = x f is an odd function, so the a n are zero, and thus the Fourier series will be of the form f(x)

More information

Fourier Transform for Continuous Functions

Fourier Transform for Continuous Functions Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum

More information

Notes on Fourier Series and Integrals Fourier Series

Notes on Fourier Series and Integrals Fourier Series Notes on Fourier Series and Integrals Fourier Series et f(x) be a piecewise linear function on [, ] (This means that f(x) may possess a finite number of finite discontinuities on the interval). Then f(x)

More information

Chapter 6: Applications of Fourier Representation Houshou Chen

Chapter 6: Applications of Fourier Representation Houshou Chen Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier

More information

Contents. Signals as functions (1D, 2D)

Contents. Signals as functions (1D, 2D) Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component

More information

Discrete Time Fourier Transform (DTFT)

Discrete Time Fourier Transform (DTFT) Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper

More information

f (t) K(t, u) d t. f (t) K 1 (t, u) d u. Integral Transform Inverse Fourier Transform

f (t) K(t, u) d t. f (t) K 1 (t, u) d u. Integral Transform Inverse Fourier Transform Integral Transforms Massoud Malek An integral transform maps an equation from its original domain into another domain, where it might be manipulated and solved much more easily than in the original domain.

More information

8 The Discrete Fourier Transform (DFT)

8 The Discrete Fourier Transform (DFT) 8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration

More information

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Review of Frequency Domain Fourier Series: Continuous periodic frequency components Today we will review: Review of Frequency Domain Fourier series why we use it trig form & exponential form how to get coefficients for each form Eigenfunctions what they are how they relate to LTI systems

More information

10.2-3: Fourier Series.

10.2-3: Fourier Series. 10.2-3: Fourier Series. 10.2-3: Fourier Series. O. Costin: Fourier Series, 10.2-3 1 Fourier series are very useful in representing periodic functions. Examples of periodic functions. A function is periodic

More information

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Digital Signal Processing Lecture 3 - Discrete-Time Systems Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of

More information

Chap 2. Discrete-Time Signals and Systems

Chap 2. Discrete-Time Signals and Systems Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,

More information

PHYS 502 Lecture 3: Fourier Series

PHYS 502 Lecture 3: Fourier Series PHYS 52 Lecture 3: Fourier Series Fourier Series Introduction In mathematics, a Fourier series decomposes periodic functions or periodic signals into the sum of a (possibly infinite) set of simple oscillating

More information

a n cos 2πnt L n=1 {1/2, cos2π/l, cos 4π/L, cos6π/l,...,sin 2π/L, sin 4π/L, sin 6π/L,...,} (2)

a n cos 2πnt L n=1 {1/2, cos2π/l, cos 4π/L, cos6π/l,...,sin 2π/L, sin 4π/L, sin 6π/L,...,} (2) Note Fourier. 30 January 2007 (as 23.II..tex) and 20 October 2009 in this form. Fourier Analysis The Fourier series First some terminology: a function f(t) is periodic if f(t + ) = f(t) for all t for some,

More information

Fourier Series. Fourier Transform

Fourier Series. Fourier Transform Math Methods I Lia Vas Fourier Series. Fourier ransform Fourier Series. Recall that a function differentiable any number of times at x = a can be represented as a power series n= a n (x a) n where the

More information

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

! Circular Convolution.  Linear convolution with circular convolution. ! Discrete Fourier Transform.  Linear convolution through circular Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear

More information

Overview of Fourier Series (Sect. 6.2). Origins of the Fourier Series.

Overview of Fourier Series (Sect. 6.2). Origins of the Fourier Series. Overview of Fourier Series (Sect. 6.2. Origins of the Fourier Series. Periodic functions. Orthogonality of Sines and Cosines. Main result on Fourier Series. Origins of the Fourier Series. Summary: Daniel

More information

ELEN 4810 Midterm Exam

ELEN 4810 Midterm Exam ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise

More information

The Laplace Transform

The Laplace Transform C H A P T E R 6 The Laplace Transform Many practical engineering problems involve mechanical or electrical systems acted on by discontinuous or impulsive forcing terms. For such problems the methods described

More information

General Inner Product and The Fourier Series

General Inner Product and The Fourier Series A Linear Algebra Approach Department of Mathematics University of Puget Sound 4-20-14 / Spring Semester Outline 1 2 Inner Product The inner product is an algebraic operation that takes two vectors and

More information

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Digital Signal Processing Lecture 10 - Discrete Fourier Transform Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time

More information

Lecture 3 January 23

Lecture 3 January 23 EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues

More information

Solving the Heat Equation (Sect. 10.5).

Solving the Heat Equation (Sect. 10.5). Solving the Heat Equation Sect. 1.5. Review: The Stationary Heat Equation. The Heat Equation. The Initial-Boundary Value Problem. The separation of variables method. An example of separation of variables.

More information

DSP-I DSP-I DSP-I DSP-I

DSP-I DSP-I DSP-I DSP-I NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79

More information

Mathematical Methods: Fourier Series. Fourier Series: The Basics

Mathematical Methods: Fourier Series. Fourier Series: The Basics 1 Mathematical Methods: Fourier Series Fourier Series: The Basics Fourier series are a method of representing periodic functions. It is a very useful and powerful tool in many situations. It is sufficiently

More information

Introduction to Signal Spaces

Introduction to Signal Spaces Introduction to Signal Spaces Selin Aviyente Department of Electrical and Computer Engineering Michigan State University January 12, 2010 Motivation Outline 1 Motivation 2 Vector Space 3 Inner Product

More information

GATE EE Topic wise Questions SIGNALS & SYSTEMS

GATE EE Topic wise Questions SIGNALS & SYSTEMS www.gatehelp.com GATE EE Topic wise Questions YEAR 010 ONE MARK Question. 1 For the system /( s + 1), the approximate time taken for a step response to reach 98% of the final value is (A) 1 s (B) s (C)

More information

Contents. Signals as functions (1D, 2D)

Contents. Signals as functions (1D, 2D) Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component

More information

Lecture 34. Fourier Transforms

Lecture 34. Fourier Transforms Lecture 34 Fourier Transforms In this section, we introduce the Fourier transform, a method of analyzing the frequency content of functions that are no longer τ-periodic, but which are defined over the

More information

Aspects of Continuous- and Discrete-Time Signals and Systems

Aspects of Continuous- and Discrete-Time Signals and Systems Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the

More information

Interchange of Filtering and Downsampling/Upsampling

Interchange of Filtering and Downsampling/Upsampling Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform

More information

A system that is both linear and time-invariant is called linear time-invariant (LTI).

A system that is both linear and time-invariant is called linear time-invariant (LTI). The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped

More information

Physics 250 Green s functions for ordinary differential equations

Physics 250 Green s functions for ordinary differential equations Physics 25 Green s functions for ordinary differential equations Peter Young November 25, 27 Homogeneous Equations We have already discussed second order linear homogeneous differential equations, which

More information

Fourier Series. 1. Review of Linear Algebra

Fourier Series. 1. Review of Linear Algebra Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier

More information

Time Response of Systems

Time Response of Systems Chapter 0 Time Response of Systems 0. Some Standard Time Responses Let us try to get some impulse time responses just by inspection: Poles F (s) f(t) s-plane Time response p =0 s p =0,p 2 =0 s 2 t p =

More information

Discrete Time Fourier Transform

Discrete Time Fourier Transform Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of

More information

APPLIED MATHEMATICS Part 4: Fourier Analysis

APPLIED MATHEMATICS Part 4: Fourier Analysis APPLIED MATHEMATICS Part 4: Fourier Analysis Contents 1 Fourier Series, Integrals and Transforms 2 1.1 Periodic Functions. Trigonometric Series........... 3 1.2 Fourier Series..........................

More information

Second-Order Linear ODEs

Second-Order Linear ODEs Chap. 2 Second-Order Linear ODEs Sec. 2.1 Homogeneous Linear ODEs of Second Order On pp. 45-46 we extend concepts defined in Chap. 1, notably solution and homogeneous and nonhomogeneous, to second-order

More information

MA22S2 Lecture Notes on Fourier Series and Partial Differential Equations.

MA22S2 Lecture Notes on Fourier Series and Partial Differential Equations. MAS Lecture Notes on Fourier Series and Partial Differential Equations Joe Ó hógáin E-mail: johog@maths.tcd.ie Main Text: Kreyszig; Advanced Engineering Mathematics Other Texts: Nagle and Saff, Zill and

More information

Ver 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)

Ver 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1) Ver 88 E. Fourier Series and Transforms 4 Key: [A] easy... [E]hard Questions from RBH textbook: 4., 4.8. E. Fourier Series and Transforms Problem Sheet Lecture. [B] Using the geometric progression formula,

More information

Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter

Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.

More information

22. Periodic Functions and Fourier Series

22. Periodic Functions and Fourier Series November 29, 2010 22-1 22. Periodic Functions and Fourier Series 1 Periodic Functions A real-valued function f(x) of a real variable is called periodic of period T > 0 if f(x + T ) = f(x) for all x R.

More information

University Question Paper Solution

University Question Paper Solution Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=

More information

Chapter 8 The Discrete Fourier Transform

Chapter 8 The Discrete Fourier Transform Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier

More information

Mathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT

Mathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT Mathematics for Chemists 2 Lecture 14: Fourier analysis Fourier series, Fourier transform, DFT/FFT Johannes Kepler University Summer semester 2012 Lecturer: David Sevilla Fourier analysis 1/25 Remembering

More information

Homework 8 Solutions

Homework 8 Solutions EE264 Dec 3, 2004 Fall 04 05 HO#27 Problem Interpolation (5 points) Homework 8 Solutions 30 points total Ω = 2π/T f(t) = sin( Ω 0 t) T f (t) DAC ˆf(t) interpolated output In this problem I ll use the notation

More information

5.4 Bessel s Equation. Bessel Functions

5.4 Bessel s Equation. Bessel Functions SEC 54 Bessel s Equation Bessel Functions J (x) 87 # with y dy>dt, etc, constant A, B, C, D, K, and t 5 HYPERGEOMETRIC ODE At B (t t )(t t ), t t, can be reduced to the hypergeometric equation with independent

More information

In this Lecture. Frequency domain analysis

In this Lecture. Frequency domain analysis In this Lecture Frequency domain analysis Introduction In most cases we want to know the frequency content of our signal Why? Most popular analysis in frequency domain is based on work of Joseph Fourier

More information

DIFFERENTIATION RULES

DIFFERENTIATION RULES 3 DIFFERENTIATION RULES DIFFERENTIATION RULES Before starting this section, you might need to review the trigonometric functions. DIFFERENTIATION RULES In particular, it is important to remember that,

More information

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)

Fourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides) Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time

More information

Laplace Transforms Chapter 3

Laplace Transforms Chapter 3 Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first. Laplace transforms play a key role in important

More information

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2) E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,

More information

Signals & Systems Handout #4

Signals & Systems Handout #4 Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the

More information

EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015

EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015 EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT March 11, 2015 Transform concept We want to analyze the signal represent it as built of some building blocks (well known signals), possibly

More information

Ch 6.4: Differential Equations with Discontinuous Forcing Functions

Ch 6.4: Differential Equations with Discontinuous Forcing Functions Ch 6.4: Differential Equations with Discontinuous Forcing Functions! In this section focus on examples of nonhomogeneous initial value problems in which the forcing function is discontinuous. Example 1:

More information

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal Overview of Discrete-Time Fourier Transform Topics Handy equations and its Definition Low- and high- discrete-time frequencies Convergence issues DTFT of complex and real sinusoids Relationship to LTI

More information

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators

More information

The Discrete-time Fourier Transform

The Discrete-time Fourier Transform The Discrete-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals: The

More information

7.16 Discrete Fourier Transform

7.16 Discrete Fourier Transform 38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)

More information

6.003: Signal Processing

6.003: Signal Processing 6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018

More information

3.2 Complex Sinusoids and Frequency Response of LTI Systems

3.2 Complex Sinusoids and Frequency Response of LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

12.7 Heat Equation: Modeling Very Long Bars.

12.7 Heat Equation: Modeling Very Long Bars. 568 CHAP. Partial Differential Equations (PDEs).7 Heat Equation: Modeling Very Long Bars. Solution by Fourier Integrals and Transforms Our discussion of the heat equation () u t c u x in the last section

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded

More information

ENGI 9420 Lecture Notes 1 - ODEs Page 1.01

ENGI 9420 Lecture Notes 1 - ODEs Page 1.01 ENGI 940 Lecture Notes - ODEs Page.0. Ordinary Differential Equations An equation involving a function of one independent variable and the derivative(s) of that function is an ordinary differential equation

More information

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING GEORGIA INSIUE OF ECHNOLOGY SCHOOL of ELECRICAL and COMPUER ENGINEERING ECE 6250 Spring 207 Problem Set # his assignment is due at the beginning of class on Wednesday, January 25 Assigned: 6-Jan-7 Due

More information

Emily Jennings. Georgia Institute of Technology. Nebraska Conference for Undergraduate Women in Mathematics, 2012

Emily Jennings. Georgia Institute of Technology. Nebraska Conference for Undergraduate Women in Mathematics, 2012 δ 2 Transform and Fourier Series of Functions with Multiple Jumps Georgia Institute of Technology Nebraska Conference for Undergraduate Women in Mathematics, 2012 Work performed at Kansas State University

More information

EEL3135: Homework #3 Solutions

EEL3135: Homework #3 Solutions EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler

More information

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.

More information

Fourier series

Fourier series 11.1-11.2. Fourier series Yurii Lyubarskii, NTNU September 5, 2016 Periodic functions Function f defined on the whole real axis has period p if Properties f (t) = f (t + p) for all t R If f and g have

More information