EE 261 The Fourier Transform and its Applications Fall 2006 Final Exam Solutions. Notes: There are 7 questions for a total of 120 points

Similar documents
EE 261 The Fourier Transform and its Applications Fall 2006 Midterm Exam Solutions

EE 16B Final, December 13, Name: SID #:

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

Basic Procedures for Common Problems

1 The functional equation for ζ

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

Solution of ECE 315 Test #1 Su03

EE 261 The Fourier Transform and its Applications Fall 2007 Solutions to Midterm Exam

27. The pole diagram and the Laplace transform

Notes 07 largely plagiarized by %khc

The Discrete Fourier Transform. Signal Processing PSYCH 711/712 Lecture 3

Laplace Transforms and use in Automatic Control

6 The Fourier transform

Sections 2.1, 2.2 and 2.4: Limit of a function Motivation:

EE 261 The Fourier Transform and its Applications Fall 2007 Problem Set Eight Solutions

EE 261 The Fourier Transform and its Applications Fall 2007 Problem Set Nine Solutions

ECG782: Multidimensional Digital Signal Processing

Prelim 1 Solutions V2 Math 1120

DIFFERENTIATION AND INTEGRATION PART 1. Mr C s IB Standard Notes

Massachusetts Institute of Technology

We start with a simple result from Fourier analysis. Given a function f : [0, 1] C, we define the Fourier coefficients of f by

Problem Value

Chapter 2: Problem Solutions

Section 14.1 Vector Functions and Space Curves

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes

1 Understanding Sampling

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

MATH 18.01, FALL PROBLEM SET # 6 SOLUTIONS

EE Homework 13 - Solutions

Grades will be determined by the correctness of your answers (explanations are not required).

2017 SUMMER REVIEW FOR STUDENTS ENTERING GEOMETRY

Signal Processing COS 323

MITOCW MITRES_6-007S11lec09_300k.mp4

Each problem is worth 25 points, and you may solve the problems in any order.

2018 Entrance Examination for the BSc Programmes at CMI. Read the instructions on the front of the booklet carefully!

MATH240: Linear Algebra Review for exam #1 6/10/2015 Page 1

Supplemental Worksheet Problems To Accompany: The Pre-Algebra Tutor: Volume 2 Section 16 Solving Single Step Equations

Review: Continuous Fourier Transform

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

Problem Value

Continuous-time Fourier Methods

Lecture 6 January 21, 2016

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

Section 6.5 Impulse Functions

There are two main properties that we use when solving linear equations. Property #1: Additive Property of Equality

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

Ordinary Differential Equations

20.6. Transfer Functions. Introduction. Prerequisites. Learning Outcomes

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

5.4 - Quadratic Functions

Bridge between continuous time and discrete time signals

Lesson 1: Multiplying and Factoring Polynomial Expressions

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

MATH 241 Practice Second Midterm Exam - Fall 2012

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

20. The pole diagram and the Laplace transform

Review for Final Exam, MATH , Fall 2010

Continuous-time Signals. (AKA analog signals)

Module 4. Related web links and videos. 1. FT and ZT

49. Green s Theorem. The following table will help you plan your calculation accordingly. C is a simple closed loop 0 Use Green s Theorem

PRACTICE FINAL , FALL What will NOT be on the final

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

Sampling. Alejandro Ribeiro. February 8, 2018

Fourier Series. Fourier Transform

WORKSHEET #13 MATH 1260 FALL 2014

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

Topics: Discrete transforms; 1 and 2D Filters, sampling, and scanning

12.1 Fourier Transform of Discretely Sampled Data

G52IVG, School of Computer Science, University of Nottingham

Problem Value

Math 116 Second Midterm March 20, 2017

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

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

Unit 2: Modeling in the Frequency Domain Part 2: The Laplace Transform. The Laplace Transform. The need for Laplace

Control System. Contents

Lecture 3 January 23

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

1 Functions, graphs and polynomials

Computer Problems for Fourier Series and Transforms

17 The functional equation

MATH 250 TOPIC 13 INTEGRATION. 13B. Constant, Sum, and Difference Rules

Autumn 2015 Practice Final. Time Limit: 1 hour, 50 minutes

Representing a Signal

EXPONENTIAL AND LOGARITHMIC FUNCTIONS

Image Acquisition and Sampling Theory

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

ECE 301 Fall 2011 Division 1. Homework 1 Solutions.

06EC44-Signals and System Chapter Fourier Representation for four Signal Classes

EA2.3 - Electronics 2 1

The Continuous Time Fourier Transform

EE 224 Signals and Systems I Review 1/10

Fourier Transform for Continuous Functions

2.3. VECTOR SPACES 25

C if U can. Algebra. Name

EE Control Systems LECTURE 9

Mathematics 1 Lecture Notes Chapter 1 Algebra Review

Transcription:

EE 6 The Fourier Transform and its Applications Fall 6 Final Exam Solutions Notes: There are 7 questions for a total of points Write all your answers in your exam booklets When there are several parts to a problem, in many cases the parts can be done independently, or the result of one part can be used in another part. Please be neat and indicate clearly the main parts of your solutions

. (5 points) Let f(t) be a periodic signal of period. One says that f(t) has half-wave symmetry if f(t )= f(t). (a) Sketch an example of a signal that has half-wave symmetry. (b) If f(t) has half-wave symmetry and its Fourier series is f(t) = c n e πint show that c n =ifn is even. Hint: c n = e πint f(t) dt = e πint f(t ) dt. Solution: (a) A simple example is f(t) = sin(πt). The graphs of sin(πt) and sin(π(t )) are shown. -.5 - -.5 - Algebraically, sin(π(t )) = sin(πt π) = sin πt.

(b) The hint says c n = e πint f(t) dt = e πint f(t ) dt. We make a change of variable u = t in the second integral: e πint f(t / ) dt = e πin(u+ ) f(u) du = / / / e πinu e πin f(u) du / = e πin e πinu f(u) du / = e πin c n, (because we can integrate over any cycle to compute c n ). Thus c n = e πin c n. If n is even then e πin = and we have c n = c n, hence c n =. A slightly different route to the same end is as follows. Again it uses the substitution u = t in an integral. c n = = = = = / / / / e πint f(t) dt e πint f(t) dt + e πint f(t) dt e πint f(t) dt / / / e πint f(t) dt e πint f(t ) dt e πin(u+ ) f(u) du / e πint f(t) dt e πin e πinu f(u) du, and if n is even the integrals cancel, giving c n =.

. ( points) Sampling using the derivative Suppose that f(t) is a bandlimited signal with F f(s) = for s (bandwidth ). According to the sampling theorem, knowing the values f(n) for all integers n (sampling rate of ) is not sufficient to interpolate the values f(t) for all t. However, if in addition one knows the values of the derivative f (n) at the integers then there is an interpolation formula with a sampling rate of. In this problem you will derive that result. Let F (s) =Ff(s) and let G(s) = πi (Ff )(s) =sf (s). (a) For s show that and then show that (b) For s show that and then show that (III F )(s) =F (s)+f(s ) (III G)(s) =sf (s)+(s )F (s ) F (s) =( s)(iii F )(s)+(iii G)(s). (III F )(s) =F (s)+f(s +) (III G)(s) =sf (s)+(s +)F (s +) F (s) =(+s)(iii F )(s) (III G)(s). (c) Using parts (a) and (b) show that for all s, <s<, where Λ(s) is the triangle function F (s) =Λ(s)(III F )(s) Λ (s)(iii G)(s), Λ(s) = { s, s,, s. (d) From part (c) derive the interpolation formula f(t) = f(n)sinc (t n)+ Solutions: f (n)(t n)sinc (t n). (a) Since F (s) is zero outside of s, if we restrict s to lie between and we only get a few shifts F (s n) that are nonzero, namely, (III F )(s) = F (s k) = + F (s +)+F (s +) +F (s)+f(s ) + F (s ) + }{{}}{{} = = = F (s)+f(s ) 3

Since G(s) =sf (s) it s the same thing; only two nonzero terms in III G: (III G)(s) = (s k)f (s k) =sf (s)+(s )F (s ). Taking these two equations together, we multiply the first by s, (s )(III F )(s) =(s )F (s)+(s )F (s ) (III G)(s) =sf (s)+(s )F (s ) and subtract the first from the second, giving (III G)(s) (s )(III F )(s) =F (s), or F (s) =( s)(iii F )(s)+(iii G)(s). This holds when s. (b) The reasoning is very similar if s. In this case (III F )(s) = F (s k) =F (s +)+F (s) and (III G)(s) = Multiply the first equation by s + : and subtract the second equation, (c) We now have (s k)f (s k) =(s +)F (s +)+sf (s). (s + )(III F )(s) =(s +)F (s +)+(s +)F (s) (s + )(III F )(s) (III G)(s) =F (s). F (s) =( s)(iii F )(s) + (III G)(s), s F (s) =(+s)(iii F )(s) (III G)(s), s. Moreover, F (s) = outside the interval s. From { s, s, s, s Λ(s) =, s. = +s, s, s and we see that we can write for all <s<., s Λ (s) =, s, s F (s) =Λ(s)(III F )(s) Λ (s)(iii G)(s) 4

(d) To derive the interpolation formula we take the inverse Fourier transform of F (s) =Λ(s)(III F )(s) Λ (s)(iii G)(s). We work separately with the two terms on the right. For the first, F (Λ(III F ))(t) = sinc t (f(t)iii(t)) ( ) = sinc t f(n)δ(t n) = f(n)sinc (t n). For the second, first note that by duality F Λ (t) = πitf Λ(t) = πit sinc t. Then F (Λ (III G))(t) =( πit sinc t) ( πi f (t)iii(t)) ( ) = (t sinc t) f (n)δ(t n) = f (n)(t n)sinc (t n). Putting these two results together we obtain the interpolation formula f(t) =F (Λ(III F ))(t) F (Λ (III G))(t) = f(n)sinc (t n)+ f (n)(t n)sinc (t n). 5

3. ( points) The DFT and linear interpolation (a) Let y be the discrete signal, periodic of order M, y =(,,,...,, ) Show that its DFT is Y [m] = + cos(πm/m). (b) Let f =(f[], f[],...,f[n ]) be a discrete signal and let F =(F[], F[],...,F[N ]) be its DFT. Recall that the upsampled version of f is the signal h of order N obtained by inserting zeros between the values of f, i.e., h =(f[],, f[],, f[]...,, f[n ], ). Show that f =h y is the linearly interpolated version of f: (f[], f[] + f[], f[], f[] + f[], f[],..., f[n ], Hint: Here we take M =N for the period of y. Note that f[n ] + f[] ). y = δ + δ + δ N and remember the effect of convolving with a shifted discrete δ. Line up the N-tuples. (c) In a problem set you showed that the DFT of h is a replicated form of F, Solutions: H[m] =F[m] m =,,...,N {}}{ H =( F[], F[],..., F[N ], F[], F[],...,F[N ] ) }{{}}{{} F F Assuming this, find the DFT of f. (a) From the definition of the DFT: Y [m] = M n H k[n]e πimn/m =+ e πim/m + e πim(m )/M =+ e πim/m + e πim e πim/m =+ e πim/m + eπim/m = + cos(πm/m). 6

(b) We have that With we have, using periodicity, h y =h (δ + δ + δ N ) =h+ (h shifted by ) + (h shifted by N ) h =(f[],, f[],, f[]...,, f[n ], ) (h shifted by ) = (, f[],, f[],...,, f[n ],, f[]). Shifting the components in h to the left by N has, by periodicity, the same effect as shifting them to the right by, since h[k (N )] = h[k + N]=h[k + ]. So (h shifted by N ) = (, f[],, f[],...,, f[n ]) Adding these up, h + (h shifted by ) + (h shifted by N ) = +(f[],, f[],, f[],...,, f[n ], ) +(, f[],, f[],...,, f[n ],, f[]) +(, f[],, f[],...,, f[n ]) =(f[], f[] + f[], f[], f[] + f[], f[],..., f[n ], f[n ]+f[] ))). (c) From Part (a) the DFT of y is Y [n] = + cos(πm/m). Thus, by the convolution theorem, F f[m]=(f h[m])(f y[m]) = H[m]Y [m] =F[m]( + cos(πm/m)). 7

4. ( points) A linear system L has the inputs (on the left) and outputs (on the right) shown below. - - 3 4 - - 3 4 - - 3 4 - - 3 4 (a) Is L time-invariant? Justify your answer. (b) Sketch the output of L given the input below. - - 3 4 - Solutions: 8

(a) L is not time-invariant. Call the inputs and outputs v (t), w (t) =Lv (t) and v (t), w (t) =Lv (t), respectively. Evidently v (t) =v (t ), and if L were time invariant we would have w (t) =w (t ). We don t. (b) The sample input is v t (t) v (t). Since L is linear, which looks like this: L(v (t) v (t)) = Lv (t) Lv (t) =w (t) w (t), - - 3 4 - - 3 4 - - 9

5. (5 points) Suppose we model the Stanford Clock Tower bells as a system, where the hammer (to hit the bell) is the input, the bell is the system, and the ringing sound is the output. (a) Is the system linear (approximately)? Is it time invariant? (b) Is this system stable? (Recall that stable means bounded inputs result in bounded outputs.) (c) Give an analytic expression that might represent the impulse response, h(t), of the system. Justify your answer. Solution: (a) It s reasonable to consider that the system is linear. If we hit the bell with two hammers (adding the inputs) then the sound will mix additively. If we hit the bell twice as hard, for example, the sound will be (approximately) twice as loud. Might be interesting to know how realistic this is! Likewise, it s reasonable to consider that the system is time-invariant, since if we hit it later we just get the sound later. (Though the shifted sound might be mixing with the fading sound from the earlier hammer blow.) (b) Stability means that a bounded input will result in a bounded output. This system is stable because the output cannot be unbounded - the ringing sound will never be infinitely loud. (c) We can consider the impulse response as the output due to an input impulse imagine hitting the bell with a hammer for a very short period of time. The impulse response must be zero for t<because the bell cannot produce sound without some kind of input. This indicates the need to use the unit step function u(t). Secondly, because the sound is ringing and oscillatory, we know that the impulse response should include a sinusoidal term of some frequency ν.

Lastly, the ringing sound is decaying the bell will not continue to make sound forever and the sound is in fact dying away. Thus, we will need to multiply our impulse response with a decaying exponential term. The impulse response should look something like this: h(t) =u(t)e at sin(ν t), a >.

6. (3 points) Consider the square shown below to be represented by a functions f(x,x )ofx and x. The gray level shows the value at a given point, with black being and white being. Next to f(x,x ) is a plot of the magnitude of its Fourier transform Ff(ξ,ξ ). Let a> be a fixed constant, and let A be the matrix ( cos( π A = 6 ) sin( π 6 ) ) sin( π 6 ) cos( π 6 ) The problem involves a number of figures and is stated on the next page.

Consider the following modifications of f(x,x ):. f(ax,x ). f(x,ax ) 3. f(x + a, x ) 4. f ( A ( x x )) 5. f ( ( )) A x x 6. f(x,x ) sinc(ax ) sinc(ax ) Match the modification 6 of f(x,x ) with the corresponding plot (i) (vi) and with the plot of the corresponding Fourier transform (A) (F). Give brief explanations. (i) (ii) (iii) (iv) (v) (vi) (A) (B) (C) (D) (E) (F) 3

Solutions: The function f(x,x ) is black over the square shown. To make the matches, you have to ask yourself what set of points will correspond to those points under the given transformation of f. The matches are as follows:. f(ax,x ): Since a>this shrinks the square in the x -direction and so that s figure (vi), i.e., the rectangle in figure (vi) will be stretched to the square via (x,x ) (ax,x ) and so f(ax,x ) will be black over the rectangle in (vi). For the Fourier transform, F(f(ax,x )=(/a)ff(ξ /a, ξ ), so that s stretched in the ξ direction and the whole figure is likewise stretched. This matches with figure (A).. f(x,ax ). Here the reasoning is the same as in the previous part, but applied in the x and ξ directions. The matches are with (ii) and (F). 3. f(x + a, x ). This is a shift in the x direction by an amount a to the left, so the square hasn t changed shape, just location relative to where it was before. There is only a phase change in the Fourier transform, which has magnitude, thus the plot is the same as for Ff(ξ,ξ ). The matches are with (v) and (C). ( ( )) x 4. f A. The matrix A is a counterclockwise rotation through π/6. As we showed x in class, the spectrum is also rotated counterclockwise by π/6. Since to rotation is counterclockwise by π/6 the square in (iv) is rotated to the straight square. Similarly with the Fourier transform. The matches are with (iv) and (D). ( ( )) 5. f A x. This is a clockwise rotation through π/6. The matches are with (i) and x (E). 6. f(x,x ) sinc(ax ) sinc(ax ). Well, there s only one choice left, so the matches have to be with (iii) and (B). Here s an explanation. Take the Fourier transform to get, by the convolution theorem, F(f(x,x ) sinc(ax ) sinc(ax )) = Ff(ξ,ξ )Π a (ξ )Π a (ξ ). This cuts off Ff(ξ,ξ ) by a D-rect function of width a. That matches with figure (B) (approximately numerical computations, of course). In the spacial domain the effect is that of a lowpass filter, so the sharp edges of the square are smeared out somewhat. That s figure (iii). 4

7. ( points) Again consider the square shown below to be represented by a functions f(x,x ) of x and x. The gray level shows the value at a given point, with black being and white being. Thus the drawing shows precisely where f(x,x )=. Assume the outside dimension of the square is and the inside dimension of the square is.9. Find the Fourier transform of f(x,x ). Solution: The D rect function (which is separable) Π ( x,x )=Π(x Π(x ) corresponds to a filled-in black square of side length. Thus the black rim we see is the result of subtracting from this a D rect function of width.9. That is, f(x,x )=Π(x Π(x ) Π(x /.9)Π(x /.9). Everything in sight is separable, and using the stretch theorem the Fourier transform is Ff(ξ,ξ ) = sinc(ξ ) sinc(ξ ).8 sinc(.9ξ ) sinc(.9ξ ). 5