EE Homework 13 - Solutions

Similar documents
EE Homework 12 - Solutions. 1. The transfer function of the system is given to be H(s) = s j j

Homework 7 Solution EE235, Spring Find the Fourier transform of the following signals using tables: te t u(t) h(t) = sin(2πt)e t u(t) (2)

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

Chap 4. Sampling of Continuous-Time Signals

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

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.

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

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

Problem Value

Homework 5 EE235, Summer 2013 Solution

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

Homework 6 EE235, Spring 2011

Question Paper Code : AEC11T02

EE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.

Problem Value

Review: Continuous Fourier Transform

Signals and Systems Spring 2004 Lecture #9

Review of Discrete-Time System

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

Lecture 7 ELE 301: Signals and Systems

ECGR4124 Digital Signal Processing Midterm Spring 2010

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

1 Signals and systems

ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, Name:

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

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters

ECE 301 Fall 2011 Division 1. Homework 1 Solutions.

Fourier series for continuous and discrete time signals

X. Chen More on Sampling

Assignment 4 Solutions Continuous-Time Fourier Transform

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

Introduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example

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

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

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

Massachusetts Institute of Technology

EC Signals and Systems

Continuous Fourier transform of a Gaussian Function

Lecture 19: Discrete Fourier Series

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

Digital Signal Processing. Midterm 1 Solution

2 Frequency-Domain Analysis

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.

6.003 Homework #10 Solutions

EE482: Digital Signal Processing Applications

EE 224 Signals and Systems I Review 1/10

Up-Sampling (5B) Young Won Lim 11/15/12

so mathematically we can say that x d [n] is a discrete-time signal. The output of the DT system is also discrete, denoted by y d [n].

ECE 301 Fall 2011 Division 1 Homework 5 Solutions

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis

Bridge between continuous time and discrete time signals

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

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

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

ECE 301. Division 3, Fall 2007 Instructor: Mimi Boutin Midterm Examination 3

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM. COURSE: ECE 3084A (Prof. Michaels)

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

2.161 Signal Processing: Continuous and Discrete

Homework 8 Solutions

Signal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5

LTI Systems (Continuous & Discrete) - Basics

SIGNAL PROCESSING. B14 Option 4 lectures. Stephen Roberts

GATE EE Topic wise Questions SIGNALS & SYSTEMS

University Question Paper Solution

Homework 9 Solutions

Digital Filters Ying Sun

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

MEDE2500 Tutorial Nov-7

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

Fourier transform representation of CT aperiodic signals Section 4.1

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

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform

Lecture 3 January 23

Discrete-time Signals and Systems in

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

The Laplace Transform

Chapter 5 Frequency Domain Analysis of Systems

Chapter 2: Problem Solutions

Problem Value

Discrete-Time Signals: Time-Domain Representation

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =

The (Fast) Fourier Transform

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

Representing a Signal

6.003 Homework #6 Solutions

Module 4 : Laplace and Z Transform Problem Set 4

Lecture 7: Interpolation

Discrete Fourier transform (DFT)

Discrete-Time David Johns and Ken Martin University of Toronto

Aspects of Continuous- and Discrete-Time Signals and Systems

Discrete-Time Signals: Time-Domain Representation

Lecture 6 January 21, 2016

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

ECE-314 Fall 2012 Review Questions for Midterm Examination II

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

Transcription:

EE3054 - Homework 3 - Solutions. (a) The Laplace transform of e t u(t) is s+. The pole of the Laplace transform is at which lies in the left half plane. Hence, the Fourier transform is simply the Laplace transform evaluated at s = jω, i.e., the Fourier transform of e t u(t) is jω+. (b) In the lecture notes on Fourier transform, it was shown that the Fourier transform of e jω 0t is 2πδ(ω ω 0 ). Since sin(t) = 2j [ejt e jt ], the Fourier transform of sin(t) is 2j [2πδ(ω ) 2πδ(ω+)] which is equal to π j [δ(ω ) δ(ω + )]. (c) The Fourier transform of x(t) = e t sin(t)u(t) can be found by either substituting sin(t) = 2j [ejt e jt ] or by using the fact that e t sin(t)u(t) is the product of e t u(t) and sin(t). Both methods are shown below: Method : Since sin(t) = 2j [ejt e jt ], we can write e t sin(t)u(t) = 2j [e(j )t e (j+)t ]. () Therefore, the Laplace transform of e t sin(t)u(t) is X(s) = [ ] 2j s (j ) = s + (j + ) s 2 + 2s + 2. (2) The poles of X(s) are +j and j which are in the left half plane. Hence, the Fourier transform of x(t) is simply the Laplace transform evaluated at s = jω. Therefore, the Fourier transform of x(t) is X f (ω) = ω 2 + 2jω + 2. (3) Method 2: Since x(t) = e t sin(t)u(t) is the product of e t u(t) and sin(t), the Fourier transform of e t sin(t)u(t) is 2π times the convolution of the Fourier transforms of e t u(t) and sin(t). Therefore, X f (ω) = 2π jω + π [δ(ω ) δ(ω + )] j = [ ] 2j j(ω ) + = j(ω + ) + ω 2 +2jω+2.(4)

(d) The signal x(t) = sin(t)u(t) is the product of sin(t) and u(t). Hence, the Fourier transform of sin(t)u(t) should be 2π times the convolution of the Fourier transforms of sin(t) and u(t). Recalling that the Fourier transform of u(t) is [ jω + πδ(ω)], the Fourier transform of sin(t)u(t) is X f (ω) = π [δ(ω ) δ(ω + )] [ 2π j jω + πδ(ω)] = [ ] 2j j(ω ) j(ω + ) + πδ(ω ) πδ(ω + ) = ω 2 + π [δ(ω ) δ(ω + )]. (5) 2j 2. Consider g(t) = δ(t). Then the Fourier transform of g(t) is f(ω) =. Therefore, by the duality theorem, the Fourier transform of f(t) = is 2πg( ω) = 2πδ( ω) = 2πδ(ω). Hence, the inverse Fourier transform of δ(ω) is 2π. 3. By the sampling theorem, the sampling frequency should be bigger than twice the maximum frequency in the signal to be able to reconstruct the signal from the sampled data. In this case, the signal to be sampled is sin(00πt) which has frequency 50 Hz. Therefore, to ensure that we can recover the original signal back from the sampled data, we have to sample faster than 00 Hz, i.e., 00 samples per second. To reconstruct the original signal from the sampled data, we can use a low pass filter with cutoff frequency a little over 50 Hz. Specifically, the cutoff frequency of the low pass filter should be bigger than 50 Hz to grab the original signal (which has frequency 50 Hz), but should be small enough to remove all the copies of frequency content introduced due to sampling, i.e., if we have sampled at f Hz, then the cutoff frequency of the low pass filter should be smaller than (f 50) Hz to ensure that we remove the copies of the frequency content. Hence, if we sample at 0 Hz, then the cutoff frequency of the low pass filter should be between 50 Hz and 5 Hz. 4. This problem illustrates the phenomenon of aliasing. You can understand aliasing from two viewpoints: Firstly, if we sample a signal too slowly (i.e., if the sampling frequency is less than twice the maximum frequency in the input signal), then when 2

we look at the sampled data, the signal appears to have a lower frequency than the actual frequency of the signal. This introduction of apparent lower frequencies is called aliasing. Secondly, in the context of reconstructing the original signal from the sampled data, the phenomenon of aliasing means that we cannot uniquely reconstruct the original signal from the sampled data unless we are told that the input signal does not have frequencies above half the sampling frequency. In other words, if we are only given the sampled data, then there are many possibilities for the original signal. However, if we are given the additional data that the highest frequency in the input signal is less than half the sampling frequency, then we can find the original signal uniquely. This corresponds to the fact that if we only have the sampled data, then there are infinitely many ways to connect the dots (Figure 2). In this problem, we are given that the signal x(t) was sampled at 0 Hz and that the sampled data is x(0.n) = sin(3n), i.e., we know that at time 0.n, the value of the signal is sin(3n). The given data is shown in Figure. The question is to find x(t). Since we are not given data on the maximum frequency in the input signal, we cannot uniquely find out what the original signal x(t) was. In fact, x(t) could have been any one of an infinite set of possibilities as shown below. Since the sampled data looks like a sinusoid, we can guess that x(t) is a sinusoid, i.e., x(t) = sin(2πf t) with f being the frequency. Since we know that the value of the signal at time t = 0.n is sin(3n), we should have 2πf(0.n) = 3n + 2k n π (6) where k n are constant integers. Therefore, f = 30 2π + 0k n n (7) Since f is a constant (i.e., does not vary with the sampling instant n), the ratio kn n should be a constant integer. Denoting kn n = c, we get f = 30 + 0c. (8) 2π 3

Hence, the original signal could have been x(t) = sin(2πft) = sin(30t + 20cπt) with c being any integer. In other words, any signal of the form sin(30t+20cπt), when sampled at 0 Hz gives the same sampled data sin(3n). Therefore, given just the sampled data, it is not possible to find out which one of the possibilities the original signal x(t) was. Specifically, x(t) could have been sin(30t) or sin(30t + 20πt) = sin(92.839t) or sin(30t + 40πt) = sin(55.6637t) or sin(30t 20πt) = sin( 32.839t) or sin(30t 40πt) = sin( 95.6637t) or any other of the infinite set of posibilities sin(30t + 20cπt). This is illustrated in Figure 2. In fact, since each one of sin(30t + 20cπt) gives the same sampled data, any linear combination of these possibilities of the form c= a c sin(30t + 20cπt) with a c being constants such that c= a c = would also give the same sampled data. Furthermore, x(t) might contain an additional component x(t) such that its values at time instants 0.n are all zero, i.e., x(t) might have been of the form x(t) = x(t) + c= a c sin(30t + 20cπt) (9) where x(t) is any signal such that x(0.n) = 0 for all n. It is clear that there are an infinite number of such signals x(t) since it can take any values in the intervals between the sampling instants. All the possibilities for the original signal x(t) which might have resulted in the observed sampled data x(0.n) = sin(3n) are given by (9). To recapitulate, when we are given just the sampled data, we do not know which one of the possibilities in (9) the original signal x(t) was. If we were given the additional data that the maximum frequency in x(t) is less than half the sampling frequency, i.e., if the maximum frequency in x(t) was given to be less than 5 Hz, then we can be sure that the original signal was sin(30t) since all other possibilities in (9) have components at frequencies higher than 5 Hz. 4

.5 0.5 x(t) 0 0.5.5 0.4 0.2 0 0.2 0.4 t Figure : The given sampled data y[n] = x(0.n) = sin(3n). 5

.5 0.5 x(t) 0 0.5.5 0.4 0.2 0 0.2 0.4 t Figure 2: A few possibilities for the original input signal. Green: sin(30t), Yellow: sin(92.839t), Blue: sin(55.6637t), Black: sin( 32.839t), Cyan: sin( 95.6637t). The given sampled data y[n] = x(0.n) = sin(3n) is shown by the red * s. 6