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

Similar documents
Digital Signal Processing Lecture 3 - Discrete-Time Systems

Chap 2. Discrete-Time Signals and Systems

Frequency-Domain C/S of LTI Systems

Discrete Time Fourier Transform

Discrete-Time Fourier Transform (DTFT)

Review of Discrete-Time System

Digital Signal Processing Lecture 4

Discrete Time Fourier Transform (DTFT)

EE 224 Signals and Systems I Review 1/10

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

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Linear Convolution Using FFT

The Discrete-Time Fourier

Lecture 13: Discrete Time Fourier Transform (DTFT)

DIGITAL SIGNAL PROCESSING LECTURE 1

Discrete Fourier Transform

Analog vs. discrete signals

EEE4001F EXAM DIGITAL SIGNAL PROCESSING. University of Cape Town Department of Electrical Engineering PART A. June hours.

Signals & Systems Handout #4

Lecture 14: Windowing

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

Review of Fundamentals of Digital Signal Processing

ELEN 4810 Midterm Exam

Digital Signal Processing. Midterm 1 Solution

Discrete-Time Signals & Systems

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

EC Signals and Systems

ELEG 305: Digital Signal Processing

VU Signal and Image Processing

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Discrete Time Systems

Stability Condition in Terms of the Pole Locations

Discrete-time Signals and Systems in

University Question Paper Solution

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Review of Fundamentals of Digital Signal Processing

Signals and Systems Spring 2004 Lecture #9

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

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Multidimensional digital signal processing

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

ELC 4351: Digital Signal Processing

Digital Signal Processing

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

Digital Signal Processing. Midterm 2 Solutions

EEL3135: Homework #4

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

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

Fourier Analysis and Spectral Representation of Signals

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


Lecture 3 January 23

Discrete-Time Fourier Transform

MEDE2500 Tutorial Nov-7

LAB 6: FIR Filter Design Summer 2011

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

Digital Filters Ying Sun

Examples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:

Lecture 19: Discrete Fourier Series

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

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.

Final Exam January 31, Solutions

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

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

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

Contents. Digital Signal Processing, Part II: Power Spectrum Estimation

Lecture 7 Discrete Systems

Discrete Time Systems

Complex symmetry Signals and Systems Fall 2015

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

Lecture 2 Discrete-Time LTI Systems: Introduction

ESE 531: Digital Signal Processing

Fourier series for continuous and discrete time signals

8 The Discrete Fourier Transform (DFT)

Problem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

Chapter 6: Applications of Fourier Representation Houshou Chen

Homework 8 Solutions

Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

Fourier Representations of Signals & LTI Systems

Discrete-time signals and systems

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

Question Paper Code : AEC11T02

Final Exam 14 May LAST Name FIRST Name Lab Time

6.003: Signal Processing

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

UNIT 1. SIGNALS AND SYSTEM

/ (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

1.3 Frequency Analysis A Review of Complex Numbers

E : Lecture 1 Introduction

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

Aspects of Continuous- and Discrete-Time Signals and Systems

GATE EE Topic wise Questions SIGNALS & SYSTEMS

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

Lecture 4: FT Pairs, Random Signals and z-transform

Transcription:

Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz

Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W. Shafer Chapter 1: Introduction Chapter 2: Discrete time Signals and Systems Chapter 3: Sampling of Continuos Time Signals (Chapter 4: The z-transform) Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 2

Signal Classification Continuous time signals x(t) are functions of a continuous independent variable t x = x(t),t R Discrete time signals are functions of a discrete variable x = {x[n]},n Z, < n < + Are defined at discrete time intervals Are represented as sequences of numbers Digital signals both the independent variable and the amplitude are discrete Digital systems: both the input and the output are digital signals Digital Signal Processing: processing of signals that are discrete in both time and amplitude Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 3

Periodic Sampling The sequences are obtained by sampling the analog signal at equi-spaced points: x[n] = x(nt ),n I T : sampling period, interval between samples f = T 1 : sampling frequency x[0] x[ 1] x[1] x[2] 3 2 1 0 1 2 3 4 T Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 4

Basic Sequences Products and sums among sequences: element by element operations Delayed or shifted sequence: y[n] = x[n k] Unit sample sequence δ[n] (Dirac function, impulse): δ[n] = { 0, n 0 1, n = 0 (1) Unit step sequence: u[n] = { 0, n < 0 1, n 0 (2) Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 5

Basic Sequences relation between the two functions: u[n] = k=0 δ[n k] (3) δ[n] = u[n] u[n 1] (4) Sinusoidal sequence: x[n] = Acos(ω 0 n + Φ), n Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 6

Basic Sequences Complex exponential x[n] = Ae (α+ j(ω 0n+φ)) α < 1: exponentially decaying envelop α > 1: exponentially growing envelop α = 1: complex exponential sequence: x[n] = A cos(ω 0 n + φ) + j A sin(ω 0 n + φ) The real and imaginary parts oscillate sinusoidally with n. The fact that n is an integer leads to important differences with respect to the corresponding functions in the continuous domain. By analogy, ω 0 and Φ are called frequency and phase. Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 7

Graphically 1 delta 0 n unit step 0 1 2 3 n real exponential 2 1 0 1 2 3 n Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 8

Discrete vs. continuous 1. Complex exponentials and sinusoids are 2π-periodic x[n] = Aexp j(ω 0+2π)n = Aexp jω 0n exp j2πn = Aexp jω 0n Complex exponentials with frequencies (ω 0 + 2πr) are indistinguishable from one another only frequencies in an interval of length 2π need to be considered (5) 2. Complex exponentials in general are not periodic Periodicity condition: x[n] = x[n + N], n, N I. For this condition to be true, the following relation must hold true: ω 0 N = 2πk, k I (6) Complex exponentials and sinusoidal sequences are not necessarily periodic with period T 0 = 2π/ω 0 as in the continuous domain and, depending on the value of ω 0, might not be periodic at all. Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 9

Discrete vs. continuous Hint: relation (??) can be written as: T 0 = 2π ω 0 = N k where T 0 is the period. If one thinks of the discrete time signal as to the sampled version of a continuous time signal of period T 0 with unitary sampling interval (T s = 1), then relation (??) can be naturally interpreted as follows: in order to obtain a discrete time periodic signal of period N by sampling a continuous time signal of period T 0, the period T 0 must be an integer factor of N, or, viceversa, N must be a multiple of T 0. This can be easily generalized to the case T s 1 (not necessarily integer) as follows: (7) ω 0 NT s = 2πk T 0 = N k T s (8) namely, N = kt 0 /T s must be an integer multiple of the ratio between the period and the sampling step. Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 10

Examples 1. Example 1 x(t) = Asin(ω 0 t) x[n] = Asin(ω 0 n) ω 0 = 3 4 π 3 πn = 2πk 3N = 8k 4 the first two integers satisfying the condition are N = 8,k = 3, thus the signal x[n] obtained by sampling a continuous sinusoid x(t) with frequency ω 0 = 3 4π is periodic with period N = 8; each period of x[n] corresponds to three (k = 3) periods of the original signal. 2. Example 2 ω 0 = 1 no solutions! Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 11

Summary ω 0 ω 0 + 2πr, r I (9) ω 0 = 2kπ, k,n I condition for periodicity (10) N Let s assume that, given N, ω 0 satisfies relation (??) for a certain k. Relation (??) implies that only N distinguishable frequencies satisfy relation (??). Proof: let ω k = 2kπ N, k = 0,1,...,N 1 ω d = 0 degenerate case ω 1 = 2π N ω 2 = 2 2π N... (N 1) 2π ω N 1 = N ω N = N 2π = 2π N... ω N+i = (N + i) 2π N = 2π + 2πi N ω i Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 12

Examples Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 13

Discrete vs Continuous Conclusion: for a sinusoidal signal x[n] = Asin(ω 0 n), as ω 0 increases from ω 0 = 0 to ω 0 = π, x[n] oscillates more and more rapidly. Conversely, from ω 0 = π to ω 0 = 2π the oscillations become slower. In fact, because of the periodicity in ω 0 of complex exponentials and sinusoidal sequences, ω 0 = 0 is indistinguishable from ω 0 = 2π and, more in general, frequencies around ω 0 = 2π are indistinguishable from frequencies around ω 0 = 0. As a consequence, values of ω 0 in the vicinity of ω 0 = 2kπ are referred to as low frequencies, whereas frequencies in the vicinity of ω 0 = (2k + 1)π are referred to as high frequencies. This is a fundamental difference from the continuous case, where the speed of the oscillations increases monotonically with the frequency ω 0. Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 14

Operations and Properties Periodicity: a sequence is periodic with period N iif: x[n + N] = x[n], n Energy: E = + n= x[n] 2 Sample-wise operations: Product: x y = {x[n]y[n]} Sum: x + y = {x[n] + y[n]} Scaling: αx = {αx[n]} Delay: y[n] = x[n n 0 ],n,n 0 I Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 15

Operations and Properties Any sequence can be represented as a sum of scaled and delayed unit samples: x[n] = δ[n k] = 1 + k= x[k]δ[n k] (11) { 1 for n = k 0 for n k [n 3] (12) 0 1 2 3 4 n Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 16

Discrete Time Fourier Transform X(e jω ) = x[n] = + n= π x[n]e jωn (13) π X(e jω )e jωn dω (14) x[n] is a discrete time signal The DTFT X(e jω ) is a complex continuos function of the independent variable ω. As such, can be put in the equivalent forms: X(e jω ) = X R (e jω ) + X I (e jω ) (15) X(e jω ) = X(e jω ) e X(e jω ) X(e jω ) is the magnitude or Fourier spectrum of the signal and e X(e jω) is the phase spectrum of the transformed signal. x[n] and X(e jω ) form the Fourier representation for the sequence. Eq. (??): analysis formula. It projects the signal to the frequency domain. Eq. (??): synthesis or reconstruction formula. It is used to recover the signal from its frequency domain representation. (16) Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 17

DTFT: Interpretation The DTFT represents the sequence x[n] as a linear superposition of infinitesimally small complex sinusoids of the form 1 2π X(e jωn )dω (17) with π ω π and X(e jωn ) representing the relative amount of each complex sinusoidal component. By comparing (??) with relation (??) it is easy to realize that the frequency response of a LTIS is the Fourier transform of its impulse response H(e jω ) = + h[n]e jωn h[n] = 1 π n= 2π H(e jω )e jωn π Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 18

DTFT Symmetry properties of the DTFT: see Table 2.1, page 53 of the reference textbook The DTFT is a periodic function of ω with period 2π. More in general: X(e j(ω+2π) ) = + x[n]e j(ω+2π)n (18) n= = + e j2πn x[n]e jωn = X(e jω ) n= (19) X(e j(ω+2rπ) ) = X(e jω ), r I (20) The Fourier spectrum of a discrete (sampled) signal is periodic Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 19

Eulero s formula e jx = cosx + j sinx e jω2nπ = e jωn e j2πn = e jωn, n I(21) Reminder: sinx = e jx e jx 2 j cosx = e jx + e jx 2 Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 20

Example: rect() function The rect() function is important because it represents the impulse response of the ideal band-pass filter in the frequency domain. Its Fourier transform is a sinc() function which spreads over (, + ). Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 21

Ideal low pass filter H(e jωn ) = H(ω) = { 1 ω ωc 0 ω c < ω π (22) h[n] = 1 + 2π = 1 2π H(eiω )e jωn dω = 1 2π [ e jωn] ω c = ω c sin(ω c n) ω c π ω c n 1 jn ωc ω c e jωn dω = = ω c π sinc(ω cn) h[n] = ω c π sinc(ω cn) (23) ω c : cutting frequency of the filter bandwidth Let ω s be the sampling frequency. If we let ω c = ω s 2 then h[n] = 1 ( ) nπ sinc T s T s (24) Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 22

To keep in mind Sequence Fourier transform δ[n] 1 δ[n n 0 ] e jωn 0 1 k 2πδ(ω + 2kπ) sin(ω c n) n X(ω) = { 1 ω ωc 0 ω c < ω π x[n] = rect T [n] 2T sinc(ωt ) e jω 0n k 2πδ(ω ω 0 + 2kπ) ] cos(ω 0 n + Φ) π k [e jφ δ(ω ω 0 + 2kπ + e jφ δ(ω + ω 0 + 2kπ) Table 2.3, page 61, reference textbook Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 23

Discrete Time Systems A DTS is an operator that maps a discrete sequence x[n] at its input to a discrete sequence y[n] at its output: y[n] = T {x[n]} x[n] T y[n] Linearity: T {x 1 [n] + x 2 [n]} = T {x 1 [n]} + T {x 2 [n]}, additivity (25) T {ax[n]} = at {x[n]}, scaling or homogeneity (26) Principle of superposition: T {a 1 x 1 [n] + a 2 x 2 [n]} = a 1 T {x 1 [n]} + a 2 T {x 2 [n]} (27) Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 24

Discrete Time Systems Time-invariance: a delayed input sequence maps to a delayed output sequence: x[n] y[n] (28) x[n n 0 ] y[n n 0 ] (29) Causality: the output value y[n] for n = n 0 only depends on previous input samples x[n] : n < n 0 In images causality doesn t matter! Stability: a bounded input generates a bounded output Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 25

Linear Time Invariant Systems Linear systems: Principle of superposition: Time invariance: y[n] = y[n] = T { y[n] = = k= k= x[k]δ[n k] } (30) x[k]t {δ[n k]} = (31) x[k]h k [n] (32) k= x[k]h[n k] Convolution sum (33) k= The system is completely characterized by the impulse response h[k] Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 26

Convolution operator x[n] y[n] = + k= Recipe for the convolution (refer to(??)): = 1. Reflect y[k] about the origin to get y[ k] 2. Shift the reflected sequence of n steps 3. Multiply (point wise) the resulting sequence by x[n] x[k] y[n k] (34) + x[n k] y[k] (35) k= 4. Sum over the samples of the resulting signal to get the value of the convolution at position n 5. Increment n and ge back to point 2. Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 27

Properties of LTIS Commutativity (see(??)) A LTIS with input x[n] and impulse response h[n] has the same output of a system with input h[n] and impulse response x[n] The cascade of LTIS systems has an impulse response that is the convolution of the IRs of the individual systems Distributivity: x[n] (h 1 [n] + h 2 [n]) = x[n] h 1 [n] + x[n] h 2 [n] The parallel connection of LTIS systems has an impulse response that is the sum of the IRs of the single systems Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 28

Properties of LTIS Cascade connection x[n] h 1 [n] h [n] 2 h [n] m y[n] x[n] h [n]*h [n]... *h [n] 1 2 m y[n] Parallel connection h 1 [n] x[n] y[n] x[n] h [n]+h [n]+... +h [n] y[n] h [n] 1 2 m 2 + h [n] m Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 29

Difference Equation The transfer function is a N-th order linear constant coefficient difference equation: N 1 a k y[n k] = k=0 M b k x[n k] (36) k=0 { y[n] = 1 N 1 a 0 a k y[n k] + k=1 } M b k x[n k] k=0 (37) The output value y[n] is the linear combination of the N 1 last values of the output and the M last values of the input x[n]. System classification: Finite Impulse Response (FIR): the impulse response involves a finite number of samples Infinite Impulse Response (IIR): the impulse response involves a infinite number of samples Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 31

Frequency domain Complex exponential sequences are eigenfunctions of LTIS Let: The response to a complex sinusoid x[n] = e jωn, < n < + is a Then: sinusoid with same frequency and amplitude and phase determined by the system (i.e. by the impulse response) y[n] = + k= ( ) + h[k]e jω(n k) = e jωn h[k]e jωk k= H(e jω ) = (38) + h[k]e jωk (39) k= y[n] = H(e jω )e jωn (40) Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 32

Frequency domain H(e jω ) frequency response of the system H(e jω ) = H R (e jω ) + H I (e jω ) (41) = H(e jω ) e H(e jω ) (42) If we manage to put the input signal in the form of a sum of complex exponentials then the output can be obtained as the sum of the responses to such signal components: x[n] = y[n] = + k= α k e jω kn Fourier representation (43) + α k H(e jω k)e jω k k= output of the LTIS (44) Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 33

Frequency response of a LTIS H(e jω ) is always a periodic function of ω with period 2π H(e j(ω+2rπ) ) = + h[n]e j(ω+2rπ)n = n= + h[n]e jωn = H(e jω ) n= (45) Due to this property as well as to the fact that frequencies differing for multiples of 2π are indistinguishable, H(e jω ) only needs to be specified over an interval of length 2π. The inherent periodicity defines the frequency response on the entire frequency axis. It is common use to specify H over the interval π ω π. Then, the frequencies around even multiples of π are referred to as low frequencies, while those around odd multiples of π are high frequencies. Gloria Menegaz Discrete Time Signals and SystemsTime-frequency Analysis 34