ESS Dirac Comb and Flavors of Fourier Transforms

Similar documents
Review: Continuous Fourier Transform

Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, Prof. Young-Chai Ko

Time and Spatial Series and Transforms

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

IB Paper 6: Signal and Data Analysis

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

2.161 Signal Processing: Continuous and Discrete Fall 2008

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

Fourier Transform for Continuous Functions

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

ECG782: Multidimensional Digital Signal Processing

Line Spectra and their Applications

ESS Finite Impulse Response Filters and the Z-transform

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

ENGIN 211, Engineering Math. Fourier Series and Transform

2 Fourier Transforms and Sampling

Fourier transform representation of CT aperiodic signals Section 4.1

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

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

EA2.3 - Electronics 2 1

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

2.161 Signal Processing: Continuous and Discrete Fall 2008

1 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the pulse as follows:

Fundamentals of the Discrete Fourier Transform

EE (082) Ch. II: Intro. to Signals Lecture 2 Dr. Wajih Abu-Al-Saud

(f g)(t) = Example 4.5.1: Find f g the convolution of the functions f(t) = e t and g(t) = sin(t). Solution: The definition of convolution is,

Line Codes and Pulse Shaping Review. Intersymbol interference (ISI) Pulse shaping to reduce ISI Embracing ISI

S f s t j ft dt. S f s t j ft dt S f. s t = S f j ft df = ( ) ( ) exp( 2π

Convolution and Linear Systems

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

2.161 Signal Processing: Continuous and Discrete Fall 2008

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

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

Bridge between continuous time and discrete time signals

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

2A1H Time-Frequency Analysis II

LTI Systems (Continuous & Discrete) - Basics

Chapter 5 Frequency Domain Analysis of Systems

The Hilbert Transform

Representation of Signals and Systems. Lecturer: David Shiung

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis

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.

Chapter 4 The Fourier Series and Fourier Transform

Lecture 8 ELE 301: Signals and Systems

Chapter 2: The Fourier Transform

Summary of Fourier Transform Properties

Chapter 4 The Fourier Series and Fourier Transform

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

Information and Communications Security: Encryption and Information Hiding

1.1 SPECIAL FUNCTIONS USED IN SIGNAL PROCESSING. δ(t) = for t = 0, = 0 for t 0. δ(t)dt = 1. (1.1)

Sound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform

Math 308 Exam II Practice Problems

The Continuous Time Fourier Transform

Chapter 5 Frequency Domain Analysis of Systems

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals

Lecture 6 January 21, 2016

Question Paper Code : AEC11T02

Problem Sheet 1 Examples of Random Processes

Image Acquisition and Sampling Theory

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

MATH 251 Final Examination May 3, 2017 FORM A. Name: Student Number: Section:

System Identification & Parameter Estimation

Continuous-Time Fourier Transform

Sistemas de Aquisição de Dados. Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September

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

6: Fourier Transform

Chap 4. Sampling of Continuous-Time Signals

EE 224 Signals and Systems I Review 1/10

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.

Fourier Series. Fourier Transform

Computing inverse Laplace Transforms.

3.2 Complex Sinusoids and Frequency Response of LTI Systems

TLT-5200/5206 COMMUNICATION THEORY, Exercise 1, Fall 2012

Correlation, discrete Fourier transforms and the power spectral density

Sampling in 1D ( ) Continuous time signal f(t) Discrete time signal. f(t) comb

EC Signals and Systems

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

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

Chapter 1 Fundamental Concepts

Digital Communications

EE5713 : Advanced Digital Communications

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS

Spectral Analysis of Random Processes

Sinc Functions. Continuous-Time Rectangular Pulse

Using MATLAB with the Convolution Method

1 Signals and systems

Lecture # 06. Image Processing in Frequency Domain

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

Fourier Series & The Fourier Transform

a k cos kω 0 t + b k sin kω 0 t (1) k=1

4 The Continuous Time Fourier Transform

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

EEL3135: Homework #3 Solutions

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

e st f (t) dt = e st tf(t) dt = L {t f(t)} s

MEDE2500 Tutorial Nov-7

Review of Fourier Transform

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

Quality Improves with More Rays

ENGIN 211, Engineering Math. Laplace Transforms

Transcription:

6. Dirac Comb and Flavors of Fourier ransforms Consider a periodic function that comprises pulses of amplitude A and duration τ spaced a time apart. We can define it over one period as y(t) = A, τ / 2 t τ / 2 (6-1) = 0, elsewhere between / 2 and / 2 he Fourier Series for y(t) is defined as y( t) = c k exp ik2πt (6-2) k = with c k = 1 /2 y( t)exp ik2πt dt (6-3) /2 Evaluating this integral gives c k = 1 τ /2 Aexp ik2πt dt τ /2 = A ik2πt exp ik2π = A kπτ sin kπ = Aτ sin kπτ kπτ = Aτ τ /2 τ /2 kπτ sinc where we have used the relationship exp(iy) = cos(y) + i sin(y) to evaluate the integral with the cosine terms cancelling because of symmetry. he Fourier Series coefficients for a pulse train is given by a sinc function. (6-4) 6-1

he largest amplitude terms in the Fourier series have k < /τ. Also if = τ then the time series has a constant amplitude and all the coefficients except c 0 are equal to zero (the equivalent of the inverse Fourier transform of a Dirac delta function in frequency). Now if we allow each pulse to become a delta function which can be written mathematically by letting τ 0 with A = 1/τ which yields a simple result c k = 1, lim τ 0, A = 1 / τ (6-5) A row of delta functions in the time domain spaced apart by time is represented by a row of delta functions in the frequency domain scaled by 1/ and spaced apart in frequency by 1/ (remember f = k/). Our row of equally spaced pulses is known as a Dirac comb. If we a define a Dirac comb in the time domain with the notation C(t,) such that C(t, ) = δ ( t k ), (6-6) k = then its Fourier transform is another Dirac comb function. F C(t, ) (6-7) [ ] = 1 C f, 1 We can use the Dirac comb function in two ways. Replication Operator If we consider a continuous function g 0 (t) that is 0 everywhere except for 0 t < then convolution in the time domain with the a Dirac comb C(t,) replicates g 0 (t) to give a periodic function g(t) with periodicity (Figure 1). g t ( ) = g 0 (t) * C(t, ) (6-8) Convolution in the time domain is multiplication in the frequency domain so we can write G( f ) = G 0 ( f ). F C( t; ) = G ( 0 f ). 1 C f ; 1 (6-9) he spectrum of the periodic function (Figure 1) is just a sampled version of the continuous spectrum of g 0 (t) with the samples scaled by a constant 1/. A periodic continuous function time has a discrete frequency spectrum. Sampling Operator. If we take our function g 0 (t) and multiply it by a Dirac comb C(t,Δt) we obtain a sampled version g 0 (t) which we denote by g s (t) (Figure 2). ( t) = g 0 ( t). C( t;δt) (6-10) g s Multiplication in the time domain is convolution in the frequency domain so we can write G s ( f ) = G 0 ( f ) * F C( t,δt) = 1 Δt G 0 f (6-11) ( ) * C f, 1 Δt 6-2

he frequency spectrum of G s (f) is scaled by 1/Δt and replicated at intervals of 1/Δt (Figure 1). A discrete continuous function of time has a periodic frequency spectrum. As we discussed in the lecture 5, we see again that sampling a time series removes our ability to discriminate between frequencies spaced at intervals of 1/Δt. If we know our time series is limited to a maximum frequency f max < 1 2Δt = f Nyquist (6-12) then there is no ambiguity in the frequency domain since the replicated spectra do not overlap. However is f max > f Nyquist then the replicated spectra do overlap additively and we cannot discriminate between them in the frequency domain. Recovery of a continuous time signal from a sampled time series We have seen that if we sample at a frequency that is not at least twice the maximum frequency of the signal then we loose information. An interesting corollary of this is that if we sample a continuous signal that is band limited below the Nyqyist frequency then we can unambiguously recover the continuous signal from the sampled signal. his is known as Shannon s sampling theorem. o show this, consider a repetitive spectrum that is obtained from a sampled time series and multiply it by a boxcar function of height Δt and width 1/ Δt. Provided the frequency content of the original signal is band-limited below the Nyquist frequency this gives us G 0 (f). G 0 ( f ) = G S ( f ). B c ( f, 1 2Δt, 1 2Δt)Δt (6-13) where B c (f,a,b) is a boxcar which has value of 1 for a < f < b and 0 elsewhere. In the time domain we can write g 0 ( t) = F 1 G 0 ( f ) = g t 0 ( )δ ( t kδt ) k = * Now we can evaluate the integral 1 2Δt 1 2Δt Δt Δt exp( i2π ft)df = exp ( i2π ft ) i2π f = Δt i2π f 1 2Δt 1 2Δt 1 2Δt 1 2Δt πt sin πt 2sin sin = πt Δt Δt exp ( i2π ft )df = sinc πt (6-14) (6-15) Equation (6-14) becomes g 0 ( t) = F 1 G 0 ( f ) = g t 0 ( )δ ( t kδt ) πt * sinc k = (6-16) Convolution is defined by the following 6-3

a( t) * b( t) = a( τ ) b( t τ )dτ (6-17) So we can write g 0 ( t) = g 0 ( τ )δ ( τ kδt) sinc π ( t τ ) dτ (6-18) k = For each value of k the presence of the δ-function in the integral yields the value of the other functions at kδt. g 0 ( t) = g 0 ( kδt) sinc π ( t kδt) k = = g 0 ( kδt) sinc π ( t kδt) k =0 (6-19) In the last term we have changed the limits of the sum to reflect the fact that g 0 (t) is only nonzero for N samples over the range = NΔt. We can see that when t = jδt with j an integer the above expression recovers g 0 (t) because the sinc term is zeros at all the other sample points. Elsewhere the value of g 0 (t) is obtained from a sum of multiple terms. here are two implications. First, as noted at the start of this section, if the time series is band limited to f max < 1/2Δt = f Nyquist then we can recover the continuous time series from the discrete time series. he continuous time series is described completely by the discrete samples. Second Equation (6-19) represents a method to interpolate uniformly spaced data. Since the maximum amplitude of the Sync function decrease away from zero we can get a reasonable interpolation by summing only a few terms for discrete samples around the time of interest. Review of the Different Flavors of ransforms. We have come across four types of transform, which we will review here: 1. Continuous time Continuous frequency. Non-periodic continuous functions in time and frequency are related by the integral transform ( ) = g(t)exp i2π ft G f g t ( )dt ( ) == G( f )exp i2π ft ( )df (6-20) We can write the Fourier transform in terms of its amplitude and phase G( f ) = G( f ) exp iθ f (6-21) ( ) where G( f ) is the amplitude spectrum θ( f ) is the phase spectrum and G( f ) 2 is the energy or power spectrum. For many applications we are more interested in the amplitude/power spectrum than the phase 6-4

2. Continuous time Discrete frequency. Periodic continuous functions in time transform to Fourier Series that are discrete (but not periodic) in frequency. G j = 1 i2π jt g(t)exp dt 0 (6-22) i2π jt g( t) == G j exp j = 3. Discrete time Continuous frequency. From the symmetry of the Fourier transform pair we can infer functions that are periodic and continuous in frequency yield discrete (but not periodic) functions in time ( ) == g k exp( i2π fkδt ) G f g k = Δt 1 Δt 0 k = G( f )exp( i2π fkδt )df (note that the integral is taken over one period in the periodic frequency function). (6-23) 4. Discrete time Discrete frequency. When both the time and frequency functions are periodic, then they are both discrete. his yields the discrete Fourier transform (DF) = 1 g j exp 2πikj N g j = k =0 j =0 exp 2πikj or in alternately (in Matlab) = g j exp 2πikj g j = 1 N j =0 k =0 exp 2πikj (6-24) (6-25) 6-5