!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1?

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

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

Chapter 6: Applications of Fourier Representation Houshou Chen

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

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.

Signal Processing COS 323

In this Lecture. Frequency domain analysis

E : Lecture 1 Introduction

Exercises in Digital Signal Processing

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

Problem Value Score No/Wrong Rec

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

EE 224 Signals and Systems I Review 1/10

Solutions to Problems in Chapter 4

Lecture 3 - Design of Digital Filters

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

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

2 Background: Fourier Series Analysis and Synthesis

Problem Value

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis

4.1. If the input of the system consists of the superposition of M functions, M

Time and Spatial Series and Transforms

Problem Value

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

Chapter 5 Frequency Domain Analysis of Systems

GATE EE Topic wise Questions SIGNALS & SYSTEMS

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

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

Chapter 1 Fundamental Concepts

Chapter 5 Frequency Domain Analysis of Systems

Signal Processing Signal and System Classifications. Chapter 13

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

EEL3135: Homework #3 Solutions

EEO 401 Digital Signal Processing Prof. Mark Fowler

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

Digital Filters Ying Sun

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

Solutions to Assignment 4

Figure 1 A linear, time-invariant circuit. It s important to us that the circuit is both linear and time-invariant. To see why, let s us the notation

DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING EXAMINATIONS 2010

2A1H Time-Frequency Analysis II

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

DOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS

ESS Finite Impulse Response Filters and the Z-transform

Chapter 4 The Fourier Series and Fourier Transform

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

PART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.

MAE143A Signals & Systems, Final Exam - Wednesday March 16, 2005

EE482: Digital Signal Processing Applications

Topic 7. Convolution, Filters, Correlation, Representation. Bryan Pardo, 2008, Northwestern University EECS 352: Machine Perception of Music and Audio

Review: Continuous Fourier Transform

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

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

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

Question Paper Code : AEC11T02

Problem Value

Chapter 4 The Fourier Series and Fourier Transform

Noise - irrelevant data; variability in a quantity that has no meaning or significance. In most cases this is modeled as a random variable.

Summary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!

Representing a Signal

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

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

The Fourier Transform (and more )

2.161 Signal Processing: Continuous and Discrete

L29: Fourier analysis

Chapter 1 Fundamental Concepts

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L

Chapter 2: Problem Solutions

Response to Periodic and Non-periodic Loadings. Giacomo Boffi. March 25, 2014

Information and Communications Security: Encryption and Information Hiding

8/19/16. Fourier Analysis. Fourier analysis: the dial tone phone. Fourier analysis: the dial tone phone

Course roadmap. ME451: Control Systems. Example of Laplace transform. Lecture 2 Laplace transform. Laplace transform

sinc function T=1 sec T=2 sec angle(f(w)) angle(f(w))

Lecture # 06. Image Processing in Frequency Domain

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Fourier Transform. Find the Fourier series for a periodic waveform Determine the output of a filter when the input is a periodic function

EE Homework 13 - Solutions

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

6.003 Homework #10 Solutions

Lecture 1 From Continuous-Time to Discrete-Time

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3

Fundamentals of the Discrete Fourier Transform

Final Exam January 31, Solutions

Fourier Analysis of Signals Using the DFT

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

2 M. Hasegawa-Johnson. DRAFT COPY.

System Identification & Parameter Estimation

LABORATORY 1 DISCRETE-TIME SIGNALS

The Discrete Fourier Transform

Continuous-time Fourier Methods

Chap 4. Sampling of Continuous-Time Signals

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

Laplace Transform Part 1: Introduction (I&N Chap 13)

1 1.27z z 2. 1 z H 2

ESE 531: Digital Signal Processing

Experimental Fourier Transforms

A1 Time-Frequency Analysis

Outline. Introduction

3.2 Complex Sinusoids and Frequency Response of LTI Systems

Discrete-time Signals and Systems in

Transcription:

Second Year Engineering Mathematics Laboratory Michaelmas Term 998 -M L G Oldfield 30 September, 999 Exercise : Fourier Series & Transforms Revision 4 Answer all parts of Section A and B which are marked with a!, making notes in your logbook. Use your A Fourier Series & Transforms lecture notes and look at the relevant information in HLT pp 5-6 and0-4. A. Preparatory work A. Fourier Series A pulse function, such as may be measured in a digital circuit, with periodicity is defined by: for 0 t ( ) ( ) f - t = f t half- wave even symmetry f () t = T = T () o o f +t f -t quarter- wave odd symmetry 0 for t 4 4 4!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ? f = i t where a i = sin i= T0 ( i ) π () t a cos ( i ) π 4 ( i ) θ () A. Convolution A linear time-invariant system has transfer function and impulse response: A - at G () s = ; g () t = Ae u() t, where u() t = Heavyside unit step- function (3) s + a The output response y(t) to an input signal x(t) is given by the convolution integral: y () t = g() t x() t = g( λ)( x t λ)λ d! Find the responses y (t), y (t) to the inputs x t u t and x t = u t e (4) () () () () bt =!Explain why the integration limits are 0 and t not - to. t 0 A3 Fourier Transform. The frequency response (i.e. steady state response to sinusoid) of a system is given by the Fourier transform G(jω) of the impulse response g(t).!for the system in Equation (3), obtain G (jω) by taking the Fourier Transform of g (t).

A4. Sampling and Aliasing Engineering signals is often processed by digital computers. The signal being processed is not the continuous signal x(t), but a sampled version of the signal x(nt), where T is the sampling interval, and n =,, 3, 4,... is the sample number. The Nyquist sampling theorem implies that x(nt) is a true representation of x(t) provided the sampling frequency f s = /T is at least twice the highest frequency in x(t).! Explain with sketches what you would expect to see in a plot of x(nt) for x(t) = sin(6πt), with (i) T = 0.0 sec (ii) T = 0.05 sec (iii) T = 0. sec (iv) T = 0. sec? B. The experiment B. Fourier Series!Write a MATLAB function coeff(n) to compute the first n non-zero coefficients of the Fourier series for the function f(t) given in Equation in Part A of the preparatory work and store the results in a n vector a. In case you have forgotten, here is the structure of the coeff.m file you must create with a text editor All you have to do is replace the?? signs: function a = coeff(n) % file coeff.m Your Name 5//97 % Returns first n coefficients in the Fourier Series for the % function in Ex. theta=?; for i=:n, a(i)=4*sin((??)*theta)/(*i-)/pi; end plot(a,'+')!use a = coeff(00) to generate the first 00 non-zero coefficients. For the case where the periodicity of f(t) is =, divide the interval from - / to / into 000 equal intervals and form the time column vector t Note the vector t will have 00 elements.!write a MATLAB function pltfs(a,n) which plots the sum of the first n terms of the Fourier series of f(t) Again here is some help. You will need the following code in your function: just replace the?'s: t=[-:0.00:] ; f=zeros(00,); for i=:n, f=f+a(i)*cos((?)*t); end; plot(t,f);

!Try different values of n from to 00 Comment on the quality of approximation and verify that at discontinuities the Fourier Series gives the average value of f(t). What is the effect of increasing the number of terms on the (i) frequency and (ii) amplitude of the Gibbs ripple phenomenon apparent in the plots? B. Convolution!In a Matlab m-file Convolution Create a sampled time column vector t running from 0 to 5 seconds, sampled at intervals t = 0.0 sec. Also compute column vectors x and x bt comprising the values of the input functions x () t = u() t and x () t = u() t e from equation (4) at these values of t, with the constant b = 0.5 sec -.!Also generate the sampled impulse response vector g of the system having transfer A - at function and impulse response G () s = ; g () t = Ae u() t, with the constants A = s + a and a =.0 sec - : dt=0.0; t=[0:dt:5] ; x=ones(length(t),); b=0.5; x=exp(-b.*t); a=; g=exp(-??); If x(t) is the input to a system with transfer function G(s), the output y(t), given by the convolution integral can be approximated to y () t = g( λ) x( t - λ) dλ g( k t) x( t - k t) t = t conv( g[ k],x[ k] ) - k=- where "conv" denotes discrete time convolution (i.e. convolution of the elements of the vectors g and x you have already generated). It is available as the MATLAB function conv.!use this to compute vectors y and y of the output values of the system g for inputs x and x respectively: y=dt*conv(g,??); y=??;! By plotting against t, compare these responses with the theoretical responses you derived in A. What happens if t =.0 sec? B3. Fourier transforms In the numerical domain, with sampled signals, an approximation to the Fourier transform is approximated to by the Discrete Fourier Transform (DFT), for frequencies sufficiently below the Nyquist limit f = f s / =/T, where T is the sampling interval. The MATLAB form is 3

X ( f ) = x( t) ( k ) N jπft + e dt X = x + NT n= 0 πnk j N ( n ) e The k+ and n+ arise because MATLAB vectors of length N run from to N, not 0 to N-. If the time input vector x(n) consists of N samples taken at a sampling period of T seconds, the frequency vector X(k) gives the N DFT values spaced at /NT Hz, with X() corresponding to 0 Hz, or DC. The Nyquist frequency limit is at /T Hz, and so there is no point in plotting frequencies beyond X(N/)! Matlab uses a very fast and efficient method of calculating the DFT, called the Fast Fourier Transform. (FFT), using the function fft. This works best when N is a power of, such as 04.! Create a time impulse response vector, 04 points long, by sampling the impulse response g (t) in Equation 4 for A = and a = : -t g () t = e u() t ; G ( jω ) = at a sampling interval of T = 0.05 sec, remembering + jω that x() = g (0). dt=0.05; N=04; t = [0:dt:dt*(N-)]'; x = exp(-t);! Create a frequency column vector f(k), 5 points long, starting at 0 Hz, and spaced at /NT Hz. Use the FFT routine to generate a frequency response and plot the magnitude: f = [0:/N/dt:5/N/dt]'; xf = fft(x); xf = abs(xf(:5)); plot(f,xf)! Obtain the Bode magnitude plot loglog(f(:5),xf(:5))! By plotting (try logarithmic scales loglog), see how your results agree with what you would expect from G ( jω) =? + jω! Find and plot on linear and logarithmic scales the FFf the square pulse function x=[ones(,/dt),zeros(,n-/dt)]'; Is it as you would expect? 4

B4. Sampling and Aliasing!Enter the function alias(t) below and use it to examine the effect of aliasing on the sampled 8 Hz sine wave in section A4. As well as using the values T = 0.0, 0.05, 0. and 0. sec suggested, try other values to determine which give good representations of the sine wave. T = 0.5 sec is interesting! function alias(t) % alias.m MLGO4//97 % plots aliased sine wave, frequency 8 Hertz for 3 sec. % sampled every T sec. NT = 3; t = [0:T:NT]'; x = sin(6*pi*t); plot(t,x)!what do you consider to be the longest usable sampling frequency /T which can be used before aliasing becomes an apparent problem? (An engineering judgement, not a mathematical formula, please!). 5