DIGITAL SIGNAL PROCESSING LECTURE 1

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

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

Chap 2. Discrete-Time Signals and Systems


Digital Signal Processing Lecture 4

Analog vs. discrete signals

VU Signal and Image Processing

Digital Signal Processing Module 1 Analysis of Discrete time Linear Time - Invariant Systems

信號與系統 Signals and Systems

ESE 531: Digital Signal Processing

Review of Discrete-Time System

信號與系統 Signals and Systems

UNIT 1. SIGNALS AND SYSTEM

Discrete-Time Signals & Systems

Ch 2: Linear Time-Invariant System

EE123 Digital Signal Processing

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

ESE 531: Digital Signal Processing

ELEG 305: Digital Signal Processing

Introduction to DSP Time Domain Representation of Signals and Systems

Lecture 2 Discrete-Time LTI Systems: Introduction

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

EE 521: Instrumentation and Measurements

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

Lecture 7 Discrete Systems

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

ESE 531: Digital Signal Processing

ELEN E4810: Digital Signal Processing Topic 2: Time domain

2.161 Signal Processing: Continuous and Discrete Fall 2008

R13 SET - 1

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

Discrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections

Properties of LTI Systems

2 Classification of Continuous-Time Systems

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

EE361: Signals and System II

E : Lecture 1 Introduction

Topic 3: Fourier Series (FS)

Lecture 11 FIR Filters

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

EEL3135: Homework #4

EE 224 Signals and Systems I Review 1/10

SIGNAL PROCESSING. B14 Option 4 lectures. Stephen Roberts

Digital Signal Processing

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Discrete-time signals and systems

Module 3. Convolution. Aim

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Review of Fundamentals of Digital Signal Processing

A Course Material on DISCRETE TIME SYSTEMS AND SIGNAL PROCESSING

Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.

Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Solution 10 July 2015 ECE301 Signals and Systems: Midterm. Cover Sheet

Spring 2014 ECEN Signals and Systems

ELEN 4810 Midterm Exam

EE123 Digital Signal Processing

Frequency-Domain C/S of LTI Systems

Cosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems

EE482: Digital Signal Processing Applications

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

The Convolution Sum for Discrete-Time LTI Systems

ECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet

Question Paper Code : AEC11T02

Digital Signal Processing Lecture 5

Digital Signal Processing Module 6 Discrete Fourier Transform (DFT)

1. Linearity of a Function A function f(x) is defined linear if. f(αx 1 + βx 2 ) = αf(x 1 ) + βf(x 2 )

Multidimensional digital signal processing

Lecture 19 IIR Filters

Representing a Signal

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

Discrete-Time Systems

SEL4223 Digital Signal Processing. Inverse Z-Transform. Musa Mohd Mokji

The Discrete-Time Fourier

6.02 Fall 2012 Lecture #10

16.30 Estimation and Control of Aerospace Systems

IIR digital filter design for low pass filter based on impulse invariance and bilinear transformation methods using butterworth analog filter

Digital Signal Processing. Midterm 2 Solutions

LTI H. the system H when xn [ ] is the input.

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Stability Condition in Terms of the Pole Locations

Very useful for designing and analyzing signal processing systems

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) =

Digital Signal Processing. Midterm 1 Solution

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

Digital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet

Lecture 3 January 23

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

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

Linear Convolution Using FFT

Signals and Systems: Introduction

Signals & Systems Handout #4

Differential and Difference LTI systems

DIGITAL SIGNAL PROCESSING LECTURE 3

Shift Property of z-transform. Lecture 16. More z-transform (Lathi 5.2, ) More Properties of z-transform. Convolution property of z-transform

Modeling and Analysis of Systems Lecture #3 - Linear, Time-Invariant (LTI) Systems. Guillaume Drion Academic year

The objective of this LabVIEW Mini Project was to understand the following concepts:

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

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year

Transcription:

DIGITAL SIGNAL PROCESSING LECTURE 1 Fall 2010 2K8-5 th Semester Tahir Muhammad tmuhammad_07@yahoo.com Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, 1999-2000 Prentice Hall Inc.

Introduction 2

Examples 3

Examples 4

Examples 5

Applications 6

Why DSP? 7

Textbook and References Textbook: Oppenheim, A.V., Schafer, R.W, "Discrete-Time Signal Processing", 2 nd Edition, Prentice-Hall, 1999. Reference Books: (4 th Edition), John G. Proakis, Dimitris K Manolakis Vinay K. Ingle, John G. Proakis, Digital Signal Processing using MATLAB, 2 nd Ed., Thomson, 2007. 8

Course Outline Chapter # 1 [Introduction] Chapter # 2 [Discrete-Time Signals and Systems] Chapter # 3 [The Z-Transform] Chapter # 4 [Sampling of Continuous-Time Signals] Chapter # 6 [Structures for Discrete-Time Systems] Chapter # 7 [Filter Design Techniques] Chapter # 8 [The Discrete Fourier Transform] 9

Definitions of DSP Signal A function of independent variables such as time, distance, position, temperature and pressure Signals are analog in nature(continuous) such as human voice, electrical signal(voltage or current), radio wave, optical, audio, and so on which contains a stream of information or data. Or may be discrete such as temperature, stock, etc. Processing Operating in some fashion on signal to extract some useful information 10

Definitions of DSP Concerned with the representation of signals by sequence of numbers or symbols and the processing of these sequence The purpose of such processing may be to estimate characteristic parameters or transform a signal 11

Characterization and classification of signals Depending on number of independent variables 1-D Signals : speech signal 2-D Signals : Image signal M-D Signals : Video signal Based on independent variables Continuous-time time signal: signal is defined at every instant of time Discrete-time signal: takes certain numerical values at specified discrete instants of time, basically a sequence of numbers 12

Types of Signals 13

Types of Signals 14

Definition of Discrete-time Signal & System Define at equally spaced discrete value of time Represented as a sequence of numbers The sequence is denoted as x[n]; where n is an integer in the range of - to. A discrete time is represented as {x(n)} {x(n)} = {... 0.95, -0.2, 2.17, 1.1, 0.2, -3.67, 2.9...} Arrow indicate time index, n = 0 15

Definition of Discrete-time Signal & System Define at equally spaced discrete value of time Represented as a sequence of numbers The sequence is denoted as x[n]; where n is an integer in the range of - to. A discrete time is represented as {x(n)} {x(n)} = {... 0.95, -0.2, 2.17, 1.1, 0.2, -3.67, 2.9...} Arrow indicate time index, n = 0 16

Definition of Discrete-time Signal & System The discrete-time signal is obtained by periodically sampling a continuous-time i signal at uniform time interval. The sampling interval or period is denoted as T s. Thus the sampling frequency can be defined d as reciprocal of T s, namely, F s = 1 / T s. When the analog is sampled at certain period of time, the discrete-time signal can be written as below :- x[n] [ ] = x a [] [t] = x a [nt s ], n =,-2,-1,0,1,2,... 1012 17

Definition of Discrete-time Signal & System Periodic Sampling of an analog signal is shown below: 18

Operation on Sequence If the input signal to the systems is DTS, the output of the systems will be DTS. INPUT x[n] SYSTEM OUTPUT y[n] 19

Operation on Sequence Product/modulation w 1 [n] = x[n].y[n] Multiplication/scaling w 2 [n] = Ax[n] Addition w 3 [n] = x[n] + y[n] 20

Operation on Sequence Time shifting w 4 [n] = x[n N], N is an integer If N > 0 ; it s a delay operation ; is a unit delay If N < 0 ; its an advance operation w 5 [n] = x[n + 1] ; is a unit advance Time reversal w 6 [n] = x[- n] 21

SEQUENCE REPRESENTATION Unit sample/unit impulse δ[n] = {1, n = 0; 0, n 0 } Unit sample shifted by k samples is δ[n- k ] = {1, n = k; 0, n k} 22

SEQUENCE REPRESENTATION Unit Step µ[n] = {1, n 0; 0, n < 0 } Unit step shifted by k samples is µ[n - k] = {1, n k; 0, n < k } 23

Sequence Representation Unit sample and unit step are related as follows µ δ [ n] = δ[ n m] = m= 0 k= [ n ] = µ [ n] µ [ n 1] n δ [ k] 24

Sequence Representation Sinusoidal x [ n ] = A cos( ω n + φ ), < n o < 25

Sinusoidal 26

27

Sequence Representation Real Exponential x[n] = Aα n 28

Sequence Representation Complex Exponential x[n] = Aе jωn ; ω frequency of complex exponential sinusoid, A is a constant 29

Introduction to LTI System Discrete-time Systems Function: to process a given input sequence to generate an output sequence x[n] Input sequence Discrete-time time system y[n] Output sequence Fig: Example of a single-input, single-output system 30

Introduction to LTI System Classification of Discrete-time System Linear DTS x[n] [ ] y[n] [ ] = αx 1 [n] + βx 2 [n] = αy 1 [n] + βy 2 [n] 31

Introduction to LTI System Classification of Discrete-time System 32

Classification of Discrete-time System Time Invariant system 33

Introduction to LTI System Classification of Discrete-time System Causal System Changes in output samples do not precede changes in input samples y[n o ] depends only on x[n] for n n o Example: y[n] = x[n]-x[n-1] 34

Introduction to LTI System Classification of Discrete-time System Stable System For every bounded input, the output is also bounded (BIBO) Is the y[n] is the response to x[n], and if x[n] < B x for all value of n then y[n] < B y for all value of n Where B x and B y are finite positive constant 35

Introduction to LTI System Impulse and Step Response If the input to the DTS system is Unit Impulse (δ[n]), then output of the system will be Impulse Response (h[n]). If the input to the DTS system is Unit Step (µ[n]), then output of the system will be Step Response (s[n]). 36

Impulse Response 37

Input-Output Relationship A Linear time-invariant invariant system satisfied both the linearity and time invariance properties. An LTI discrete-time system is characterized by its impulse response Example: x[n] = 0.5δ[n+2] + 1.5δ[n-1] - δ[n-4] will result in y[n] = 0.5h[n+2] + 1.5h[n-1] - h[n-4] 38

Input-Output Relationship x[n] [ ] can be expressed in the form k = x [ n] = x[ k ] δ [ n k ] where x[k] denotes the kth sample of sequence {x[n]} The response to the LTI system is y[ n] = k = or represented as x[ k] h [ n k] = k = x[ n y[ [ n ] = x [ n ] h [ n ] k] h [ k] 39

Computation of Discrete Convolution 40

Input-output Relationship Properties of convolution Properties of convolution Commutative ] [ ] [ ] [ ] [ n x n x n x n x Associative ] [ ] [ ] [ ] [ 1 2 2 1 n x n x n x n x = Di t ib ti ] [ ] [ ] [ ] [ ]) [ ] [ ( ] [ 3 1 2 1 3 2 1 n x n x n x n x n x n x n x + = + Distributive ]) [ ] [ ( ] [ ] [ ]) [ ] [ ( 3 2 1 3 2 1 n x n x n x n x n x n x = 41

Properties of LTI Systems Stability if and only if, sum of magnitude of Impulse Response, h[n] is finite S = h [ n ] = n = h n < 42

Properties of LTI Systems Causality if and only if Impulse Response,h[n] = 0 for all n < 0 43

Properties of LTI Systems 44