• 沒有找到結果。

The Fourier Transform and its Applications Problem Set Two Due Tuesday, March 22

N/A
N/A
Protected

Academic year: 2022

Share "The Fourier Transform and its Applications Problem Set Two Due Tuesday, March 22"

Copied!
5
0
0

加載中.... (立即查看全文)

全文

(1)

The Fourier Transform and its Applications Problem Set Two Due Tuesday, March 22

1. (25 points) A periodic, quadratic function and some surprising applications Let f (t) be a function of period T = 2 with

f (t) = t2 if 0 ≤ t < 2.

Here’s the picture.

-3 -2 -1 1 2 3

1 2 3 4

(a) Find the Fourier series coefficients, cn, of f (t).

(b) Using your result from part (a), obtain the following: Hint: You might want to read section 1.14.3 on pages 54 - 57 of the course reader before trying this part.

X

n=1

1 n2 = π2

6 .

X

n=1

(−1)n+1 n2 = π2

12.

X

n=0

1

(2n + 1)2 = π2 8 .

2. (10 points) Whither Rayleigh? What happens to Rayleigh’s identity if f (t) is periodic of period T 6= 1?

(2)

3. (25 points) Sinesum2, Square Wave, High Frequency Noise and AM Modulation.

This problem is based on the Matlab application in the ‘Sinesum2 Matlab Program’ section of ‘Handouts’ on the course website. Go there to read the directions and to get the files. It’s a tool to plot sums of sinusoids of the form

N

X

n=1

Ansin(2πnt + φn) .

0 0.5 1 1.5 2

−6

−4

−2 0 2 4 6

Combined Signal

(a) Using the sinesum2 application, generate (approximately) the signal plotted above. You should be able to do this with seven harmonics. Along with the overall shape, the things to get right are the approximate shift and orientation of the signal. To get started, observe that the signal looks like a square wave signal. Recall that the square wave signal is studied in Section 1.7 of the course reader. However, you’ll see that additional flipping and shifting need to be done. This can be accomplished by changing the phases φn(do that in two steps, say first a flip and then a shift). Explain what you’re doing at each stage.

(b) Additive high frequency noise is very common when signals go through various commu- nications systems. In this case, we will assume that the previous signal goes through some communication system, that adds high frequency noise which can be approximated as: 0.5 sin(2π50t). How does this change the original signal in the time domain? What happens if the amplitude of the noise increases from 0.5 to 2. Plot your results and explain what you observe.

(c) Amplitude Modulation (AM) is a technique used in communication systems for trans- mitting information. Typically, AM works by varying the amplitude of a carrier signal (simple sine signal of the form A sin(2πfct + φc)) in relation to the information signal that needs to be transmitted. For example, if we denote the information signal we want to trasmit by m(t), m(t)A sin(2πfct + φc) is one type of “AM signal” (double-sideband suppressed-carrier (DSBSC) AM signal to be exact!) that we could choose to transmit.

Naturally, a lot more can be said about AM, but this is not the scope of this question.

To examine an example of AM, we will assume that the signal from part (a) is multiplied by sin(2π50t). Using sinesum2, plot the new signal, and explain how this can be done.

(3)

4. (20 points) Piecewise linear approximations and Fourier transforms.

(a) Find the Fourier transform of the following signal.

0 1 2

2 2.5

4 6 t

Hint: Think Λ’s.

(b) Consider a signal f (t) defined on an interval from 0 to D with f (0) = 0 and f (D) = 0. We get a uniform, piecewise linear approximation to f (t) by dividing the inter- val into n equal subintervals of length T = D/n, and then joining the values 0 = f (0), f (T ), f (2T ), . . . , f (nT ) = f (D) = 0 by consecutive line segments. Let g(t) be the linear approximation of a signal f (t), obtained in this manner, as illustrated in the following figure where T = 1 and D = 6.

0 1

1 2

2 3

3

4 5 6 t

f (t) g(t)

Find Fg(s) for the general problem (not for the example given in the figure above) using any necessary information about the signal f (t) or its Fourier transform Ff (s). Think Λ’s, again.

5. (10 points) The modulation property of the Fourier transform.

(a) Let f (t) be a signal, s0 a number, and define

g(t) = f (t) cos(2πs0t) Show that

Fg(s) = 1

2Ff (s − s0) +1

2Ff (s + s0) (No delta functions, please, for those who know about them.)

(4)

(b) Find the signal (in the time domain) whose Fourier transform is pictured, below.

−6 −4 −2 0

1

2 4 6

6. (10 points) Fourier transforms and Fourier coefficients Suppose the function f (t) is zero outside the interval −1/2 ≤ t ≤ 1/2. We form a function g(t) which is a periodic version of f (t) with period 1 by the formula

g(t) =

X

k=−∞

f (t − k) .

The Fourier series representation of g(t) is given by

g(t) =

X

k=−∞

ˆ

g(n)e2πint.

Find the relationship between the Fourier transform Ff (s) and the Fourier series coefficients ˆ

g(n).

7. (50 points) Consider the functions g(x) and h(x), shown below

1

1 x

h(x)

-1

-1 1

1

x g(x)

Denote the Fourier transforms by Fg(s) and Fh(s), respectively.

(a) (5 points) Lykomidis says that the imaginary part of Fg(s) is (sin(2πs) − 2πs) / 4π2s2.

Brad, however, expresses concerns about Lykomidis’ work. He is not sure that this can

(5)

be the imaginary part of g. “Why would it have a singularity at s = 0?” Brad says, as a general fact, if a function is integrable, as g(t) is, then its Fourier transform is continuous.

Lykomidis, asks Brad whether he is willing to buy him coffee if he (Lykomidis) can prove him (Brad) wrong. Brad feels very confident and quickly accepts. Is Lykomidis getting free coffee?

(b) (5 points) What are the two possible values of ∠Fh(s), i.e., the phase of Fh(s)? Express your answer in radians.

(c) (5 points) EvaluateR

−∞Fg(s) cos(πs) ds.

(d) (5 points) EvaluateR

−∞Fh(s)ei4πsds.

(e) (10 points) Without performing any integration, what is the real part of Fg(s)? Explain your reasoning.

(f) (10 points) Without performing any integration, what is Fh(s)? Explain your reasoning.

(g) (10 points) Suppose h(x) is periodized to have period T = 2. Without performing any integration, what are the Fourier coefficents, ck, of this periodic signal?

參考文獻

相關文件

We see that if half the triangles overlap we get just what we want; bring the left zero-point of the right-hand triangle over to hit at the middle of the base of the left-hand

Evaluating integrals with the help of Fourier transforms Evaluate the following integrals using Parseval’s Theorem and one other method... Comment on what

If any of the children of a node is marked lose, the player can simply go down to that node, so that the other player will definitely lose.. In this case we mark the node to

In this way, we can take these bits and by using the IFFT, we can create an output signal which is actually a time-domain OFDM signal.. The IFFT is a mathematical concept and does

In this paper, we provide new decidability and undecidability results for classes of linear hybrid systems, and we show that some algorithms for the analysis of timed automata can

In this section, we describe how we can substan- tially reduce the time to instantiate a service on a nearby surrogate by storing its state on a portable storage device such as a

In this project, I will study the relation be- tween “the product of any two numbers that belong to a set of natural numbers” and.

Isakov [Isa15] showed that the stability of this inverse problem increases as the frequency increases in the sense that the stability estimate changes from a logarithmic type to