X. Chen More on Sampling

Similar documents
Chap 4. Sampling of Continuous-Time Signals

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.

ESE 531: Digital Signal Processing

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

ESE 531: Digital Signal Processing

Review: Continuous Fourier Transform

Review of Discrete-Time System

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

ELEN 4810 Midterm Exam

Discrete Fourier Transform

Signals and Systems Spring 2004 Lecture #9

Discrete-Time David Johns and Ken Martin University of Toronto

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

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

Generalizing the DTFT!

Chapter 4 The Fourier Series and Fourier Transform

Chapter 4 The Fourier Series and Fourier Transform

Chapter 5 Frequency Domain Analysis of Systems

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

MEDE2500 Tutorial Nov-7

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

Chapter 6: Applications of Fourier Representation Houshou Chen

EE 224 Signals and Systems I Review 1/10

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

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].

Fourier transforms. Definition F(ω) = - should know these! f(t).e -jωt.dt. ω = 2πf. other definitions exist. f(t) = - F(ω).e jωt.

Chapter 5 Frequency Domain Analysis of Systems

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)

( ) ( ) numerically using the DFT. The DTFT is defined. [ ]e. [ ] = x n. [ ]e j 2π Fn and the DFT is defined by X k. [ ]e j 2π kn/n with N = 5.

Homework 8 Solutions

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

16.362: Signals and Systems: 1.0

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

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

EE Homework 13 - Solutions

27. The Fourier Transform in optics, II

Lecture 9 Infinite Impulse Response Filters

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

Lecture 6 January 21, 2016

Solutions to Problems in Chapter 4

z Transform System Analysis

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

Bridge between continuous time and discrete time signals

Sinc Functions. Continuous-Time Rectangular Pulse

Lecture 19: Discrete Fourier Series

8 The Discrete Fourier Transform (DFT)

Continuous Fourier transform of a Gaussian Function

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2

Chap 2. Discrete-Time Signals and Systems

EC Signals and Systems

2 The Fourier Transform

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

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

Definition of Discrete-Time Fourier Transform (DTFT)

Filter Analysis and Design

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

EE482: Digital Signal Processing Applications

IB Paper 6: Signal and Data Analysis

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

2.161 Signal Processing: Continuous and Discrete

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

ESE 531: Digital Signal Processing

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Fourier series for continuous and discrete time signals

Assignment 4 Solutions Continuous-Time Fourier Transform

Final Exam 14 May LAST Name FIRST Name Lab Time

Discrete-time Signals and Systems in

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

Frequency Domain Representations of Sampled and Wrapped Signals

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

Review of Analog Signal Analysis

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

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

DSP-I DSP-I DSP-I DSP-I

FROM ANALOGUE TO DIGITAL

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

Complex symmetry Signals and Systems Fall 2015

Digital Signal Processing. Midterm 1 Solution

Music 270a: Complex Exponentials and Spectrum Representation

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

DESIGN OF CMOS ANALOG INTEGRATED CIRCUITS

Lecture 3 January 23

Time and Spatial Series and Transforms

Introduction to Signal Spaces

Review of Fourier Transform

The Discrete-Time Fourier

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Frequency-Domain C/S of LTI Systems

Fourier Transform 4: z-transform (part 2) & Introduction to 2D Fourier Analysis

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

Today. ESE 531: Digital Signal Processing. IIR Filter Design. Impulse Invariance. Impulse Invariance. Impulse Invariance. ω < π.

The Fourier Transform (and more )

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

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

Design of IIR filters

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Discrete Time Fourier Transform

Transcription:

X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote, respectively, frequency in rad/s (used in continuoustime signal analysis), and frequency in rad (for discretetime signal processing). We have ω = Ω (12) We use square bracket, e.g. x [n], to indicate a discrete sequence; and regular parenthesis, e.g. x c (t), to indicate a continuoustime signal. X c (jω) = F{x c (t)} ˆ x c (t)e jωt dt denotes the Fourier transform of a continuoustime signal x c (t); X(e jω ) = F d {x[n]} x [n] e jωn denotes the discretetime Fourier transform of a discrete sequence x [n] = x c (n ). S denotes the sampler that samples a continuoustime signal to discretetime sequences. H denotes a holder performing, e.g. zero order hold, to transform a discretetime sequence to a continuoustime signal. 42 version September 23, 2015

X. Chen Impulse and impulse trains 9.2 Impulse and impulse trains (Spectrum of an impulse) The Fourier transform of a shifted delta function is F (δ (t a)) = e jωa. In other words, 5 δ (t a) = F ( 1 e jωa) = 1 ˆ e jωa e jωt dω (13) 2π Understanding the result: Recall that in Laplace transform, shifted impulse in time corresponds to delay in frequency domain. (Spectrum of sinusoidals) The Fourier transform of a singlefrequency complex sinusoidal signal x c (t) = e jω 0t is F ( e jω 0t ) = 2πδ (Ω Ω 0 ) [by using (13)]. Real signals have conjugate symmetric spectra. In other words, if F (jω) = ˆ f (t) e jωt dt then F (jω) = ˆ f (t) e jωt dt = F ( jω) In particular, the Fourier transform of a real sinusoidal signal x c (t) = cos (Ω 0 t) = ( e jω 0t + e jω 0t ) /2 is F (cos (Ω 0 t)) = πδ (Ω Ω 0 ) + πδ (Ω + Ω 0 ) (14) 5 The equality also provides an alternative definition of the delta function: δ (t) = 1 ˆ e jωt dω 2π 43 version September 23, 2015

X. Chen C/D process 9.3 C/D process The C/D process from a continuous signal x c (t) to the discrete sampled sequence x [n] = x c (n ), namely x c (t) S x [n] can be mathematically represented as Fig. 6, where s (t) = δ (t n) x c (t) Multiplication x s(t) Impulse train to discretetime sequence x [n] Figure 6 Mathematical representation of the C/D process x s (t) = x c (t) s (t) = x c (t) δ (t n ) = x c (n ) δ (t n ) (15) 44 version September 23, 2015

X. Chen C/D process 9.3.1 Continuoustime signal to continuoustime impulse train By Fourier series expansion, 6 the continuoustime impulse train contains infinite amount of frequency components: δ (t k ) = 1 e jωskt The Fourier transformation of the impulse train in Fig. 6 is thus S (jω) = F (s (t)) = 2π δ (Ω kω s ) = 2π where Ω s = 2π/ is the sampling frequency in rad/sec. ( δ Ω k 2π ) By convolution property, the Fourier transform of x s (t) in (15) is X s (jω) = F (x c (t) s (t)) = 1 2π X c (jω) S (jω) = 1 X c (j (Ω kω s )) (16) Hence if the spectrum of x c (t) contains components beyond the Nyquist frequency Ω s /2, aliasing will occur in obtaining the spectrum of x s (t). example: consider sampling x c (t) = cos (Ω 0 t) and x c (t) = cos ((Ω 0 + Ω s ) t) at sampling frequency Ω s, with Ω 0 < Ω s /2. 6 If f(t) is periodic with period, then f(t) = 1 < f(x), e jωskt > e jωskt where ω s = 2π/ and < f(x), e jωskt > is the inner product defined by < f(x), e jωskt >= ˆ Ts/2 /2 f(x)e jωskt dt 45 version September 23, 2015

X. Chen C/D process x [n] will have a spectrum of periodic spikes with base pattern at Ω 0 and Ω 0 [recall (14)] x [n] will have a spectrum of periodic spikes with base pattern at Ω 0 and Ω 0 as well [recall (16)]! Example: if x c (t) = e jωot, then x s (t) = δ (t n ) e jωot (17) and X s (jω) = 1 Hence by inverse Fourier transform x s (t) = 1 which is an equivalent form of (17). δ (j (Ω kω s )) e j(ωo+ωsn)t 9.3.2 Continuoustime impulse train to discretetime sequence The discretetime Fourier transform of x [n] = x c (nt ) is X ( e jω) = x [n] e jωn Directly taking the Fourier transfrm of (15) yields ( ) X s (jω) = F x c (n ) δ (t n ) = x (nt ) e jωtsn 46 version September 23, 2015

X. Chen *Sampling signals beyond Nyquist frequency Hence discretetime Fourier transform is a frequency scaled version of the continuoustime Fourier transform: 7 X ( e jω) = X s (jω) Ω=ω/Ts Using (16), we finally have X ( e jω) = 1 X c (j ( Ω 2π k)) Ω= ω Ts (18) 9.4 *Sampling signals beyond Nyquist frequency Recall that: Sampling maps the continuoustime frequency π < Ω < π onto the unit circle Sampling also maps the continuoustime frequencies π < Ω < 3 π, 3 π < Ω < 5 π, etc, onto the unit circle Consider sampling signals beyond Nyquist frequency: From (18), sampling maps frequency components beyond Nyquist frequency onto the same discretetime frequency region [ π, π]. The mapping is periodic: portions of the continuoustime jω axis, for Ω in the ranges of ] [ πts, πts, [ [ π, 3π 3π ], and, 5π ], etc, map to the same unit circle in the discretetime domain. 7 Understanding the scaling: in time domain, consecutive samples in x s (t) are spaced by the sampling time ; samples in x [n] are indexed by integers and hence consecutive samples are spaced by 1. The normalization by 1/ in time domain corresponds to a normalization by in the frequency domain, hence ω = Ω. 47 version September 23, 2015

X. Chen *Sampling signals beyond Nyquist frequency I π π T u = 2 π 1.2π = 0.6π T u R e j0.6π I 1 1 R (e j1.2π ) e j0.8π I R π 1.2π = 0.6π T u e j0.6π (e j1.2π ) e j0.8π π T u = 2 π s plane Sampled at T u z plane Sampled at z plane Figure 7 Example: sampling signals beyond Nyquist frequency For instance, consider a continuoustime sinusoidal signal cos (Ω o t) with frequency satisfying Ω o = 1.2π/ = 1.2π rad/sec. The continuoustime Fourier transform of the signal is πδ (Ω 1.2π) + πδ (Ω + 1.2π) (The signal contains a positive and a negative frequency components at the same frequency). If sampled at T u = /2, Ω o is below the Nyquist frequency π/t u = 2π rad/sec, and mapped to ω o = Ω o T u = 0.6π. The Fourier transform of the sampled signal is [by using (18)] 2 π [δ (ω 0.6π + 2πk) + δ (ω + 0.6π + 2πk)]. If sampled at, Ω o is beyond Nyquist frequency. Aliasing occurs and the discretetime Fourier transform of the sampled signal becomes πδ (ω ± 1.2π + 2πk) = πδ (ω ± 0.8π + 2πk), i.e., within Nyquist frequency, the observable spectral peaks are at 0.8π/ = 0.8π rad/sec and 0.8π/ = 0.8π rad/sec, instead of the actual frequency 1.2π rad/sec. Graphically, the result is demonstrated in Fig. 7. 48 version September 23, 2015