Digital Signal Processing:

Similar documents
Responses of Digital Filters Chapter Intended Learning Outcomes:

Stability Condition in Terms of the Pole Locations

Digital Signal Processing

z-transform Chapter 6

Chapter Intended Learning Outcomes: (i) Understanding the relationship between transform and the Fourier transform for discrete-time signals

(i) Represent discrete-time signals using transform. (ii) Understand the relationship between transform and discrete-time Fourier transform

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

EE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley

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

EEL3135: Homework #4

ESE 531: Digital Signal Processing

Linear Convolution Using FFT

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

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

Lecture 19 IIR Filters

Transform analysis of LTI systems Oppenheim and Schafer, Second edition pp For LTI systems we can write

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

ESE 531: Digital Signal Processing

ELEG 305: Digital Signal Processing

Filter structures ELEC-E5410

LINEAR-PHASE FIR FILTERS DESIGN

Discrete Time Systems

ELEG 305: Digital Signal Processing

Review of Fundamentals of Digital Signal Processing

ECE503: Digital Signal Processing Lecture 5

Tunable IIR Digital Filters

Z-Transform. 清大電機系林嘉文 Original PowerPoint slides prepared by S. K. Mitra 4-1-1

Basic Design Approaches

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

Discrete-time Signals and Systems in

We have shown earlier that the 1st-order lowpass transfer function

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

Computer Engineering 4TL4: Digital Signal Processing

Transform Analysis of Linear Time-Invariant Systems

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

5.1 The Discrete Time Fourier Transform

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

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

The Z transform (2) 1

The Z transform (2) Alexandra Branzan Albu ELEC 310-Spring 2009-Lecture 28 1

1. FIR Filter Design

Discrete-Time Fourier Transform (DTFT)

Review of Fundamentals of Digital Signal Processing

ECE503: Digital Signal Processing Lecture 4

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

y[n] = = h[k]x[n k] h[k]z n k k= 0 h[k]z k ) = H(z)z n h[k]z h (7.1)

Multidimensional digital signal processing

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

Digital Signal Processing Lecture 4

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


Solutions: Homework Set # 5

EECE 301 Signals & Systems Prof. Mark Fowler

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

Discrete-Time Fourier Transform

Analog LTI system Digital LTI system

Discrete-time signals and systems

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

Very useful for designing and analyzing signal processing systems

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

VU Signal and Image Processing

Lecture 11 FIR Filters

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

Chap 2. Discrete-Time Signals and Systems

Digital Filter Structures

Review of Discrete-Time System

2. Typical Discrete-Time Systems All-Pass Systems (5.5) 2.2. Minimum-Phase Systems (5.6) 2.3. Generalized Linear-Phase Systems (5.

EE482: Digital Signal Processing Applications

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

Notes 22 largely plagiarized by %khc

INF3440/INF4440. Design of digital filters

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

DIGITAL SIGNAL PROCESSING. Chapter 3 z-transform

GATE EE Topic wise Questions SIGNALS & SYSTEMS

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

Chapter 5 THE APPLICATION OF THE Z TRANSFORM. 5.3 Stability

EE-210. Signals and Systems Homework 7 Solutions

Digital Signal Processing Lecture 5

Z Transform (Part - II)

Question Bank. UNIT 1 Part-A

Filter Design Problem

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

EE102B Signal Processing and Linear Systems II. Solutions to Problem Set Nine Spring Quarter

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

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Digital Signal Processing. Midterm 1 Solution

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

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.

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

EE 3054: Signals, Systems, and Transforms Spring A causal discrete-time LTI system is described by the equation. y(n) = 1 4.

E : Lecture 1 Introduction

X (z) = n= 1. Ã! X (z) x [n] X (z) = Z fx [n]g x [n] = Z 1 fx (z)g. r n x [n] ª e jnω

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

Signals and Systems Lecture 8: Z Transform

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

III. Time Domain Analysis of systems

Continuous and Discrete Time Signals and Systems

Transcription:

Digital Signal Processing: Mathematical and algorithmic manipulation of discretized and quantized or naturally digital signals in order to extract the most relevant and pertinent information that is carried by the signal. What is a signal? What is a system? What is processing? Applied Signal Processing - Lecture 1

μn 1 n 0 μn 0 n< 0

E = x n= x n 2

m= h[n] = h[n]*δ[n] = h[m]. δ[n m]

N M ayn [ k] = bxn [ k] i i= 0 i= 0 i

j + k n jn j2kn 2 2 X + k = x n e = x n e e n= n= n= j n = x n e = X k

j 0 n xn=e ; X = + k 2 2 k= 0 X e j0n j0n ( ) X( e ) 2

spectrum of the continous signal spectrum of the sampled signal

N 1 N 1 X[k ]= x[n]e 2 kn i/n = x[n]e ni k n=0 n=0

N 1 kn X[k ]= x[n]w N n=0 0kN 1

Circular Convolution Linear convolution: N 1 y [ n] g[ m] h[ nm] L m0 Circular convolution: N 1 yc[ n] g[ m] h[ nmn] m0 consider the following functions for a 4 point circular convolution

Circular Convolution Evaluating N 1 yc[ n] g[ m] h[ nmn] m0 gives: y [0] g[0] h[0] g[1] h[3] g[2] h[2] g[3] h[1] C y [1] g[0] h[1] g[1] h[0] g[2] h[3] g[3] h[2] C y [2] g[0] h[2] g[1] h[1] g[2] h[0] g[3] h[3] C y [3] g[0] h[3] g[1] h[2] g[2] h[1] g[3] h[0] C so we see that the 4 terms involve multiplying g[n] with reversed and circularly shifted versions of h[n] on the interval n = 0 3

Xz= x [n]z n n=

n j n n jn X() z x[] n z x[]( n re ) x[] n r e n n n

1 Xz= 1 z 1 for z 1 1

m1 m z m

Stability & ROC In terms of Zeros & Poles Recall that for a system to be causal, its impulse response must satisfy h[n]=0, n<0, that is for a causal system, the impulse response is right sided. Based on this, and our previous observations, we can make the following important conclusions: The ROC of a causal system extends outside of the outermost pole circle The ROC of an anticausal system (whose h[n] is purely left-sided) lies inside of the innermost pole circle The ROC of a noncausal system (whose h[n] two-sided) is bounded by two different pole circles Now, for an LTI system to be stable it must be absolutely summable, or in other words, it must have a DTFT. But for a system to have a DTFT, its ROC must include the unit circle. An LTI system is stable, if and only if the ROC of its transfer function H(z) includes the unit circle! Furthermore, a causal system s ROC lies outside of a pole circle. If that system is also stable, its ROC must include unit circle Then a causal system is stable, if and only if, all poles are inside the unit circle! Similarly, an anticausal system is stable, if and only if its poles lie outside the unit circle. An FIR filter is always stable, why? Digital Signal Processing, 2010 Robi Polikar, Rowan University

Partial Fractional Expansion 1 1 Example 1: H( z) 3 1 1 2 1 1 1 1 (1 z z ) (1 z )(1 z ) this can be written as: H( z) 4 8 4 2 A A (1 ) (1 ) 1 2 1 1 1 1 4 z 2 z z > 1/2 with: A 1 z 1 z 1; 2 (1 )(1 ) (1 )(1 ) 1 1 1 1 4 2 1 A 1 1 1 1 2 1 1 1 1 4 z 2 z z 4 z 2 z 1 2 so: H( z) 1 1 1 1 (1 z ) (1 z ) 4 2 z 1 1 4 2 h[n] is causal 1 n 1 2 4 hn [ ] 2 [ n] [ n] n

Partial Fractional Expansion if M N a polynomial must be added of order M N : H( z) A dz MN N k i Bk z k0 i01 i 1 values of B k are obtained by long division of the numerator of H(z) by the denominator. in the case of multiple poles of order s at z = d i while all other poles are simple another term is required: H( z) MN N s k Ak Cm 1 1 dz Bk z 1 k0 k0, ki dz k m1 i 1 m

Partial Fractional Expansion Example 2: H( z) 2 1 2 1 2 2z 4z2 12 z z (1 z ) 2z 3z1 1 z z (1 z )(1 z ) 2 3 1 1 2 1 1 1 2 2 2 As the numerator is the same order as the denominator we need to write H(z) as: H( z) A A B (1 ) (1 ) 1 2 0 1 1 1 2 z z z > 1 we first need to determine B o and a residual expression with a lower order numerator by dividing the denominator into the numerator B (1 ) (1 ) 1 2 1 1 2z z 5z 1 0 2 3 1 1 2 3 1 1 2 2 z 2 z 2 z 2 z

Partial Fractional Expansion the next step is to further solve the second term: 1 5z 1 3 1 1 2 (1 2 z 2 z ) 1 5z 1 1 and solve for A 1 and A 1 2: A1 2 (1 1 1 1 2 z ) 9 (1 2 z )(1 z ) z 1 A 1 5z 1 1 2 2 (1 z ) 8 1 1 1 (1 2 z )(1 z ) z1 9 8 so: H ( z ) 2 (1 1 ) (1 1 z z ) 1 2 2 h[n] is causal 1 hn [ ] 2 [ n] 9 [ n] 8 [ n] 2 n

z M z M 1 M 1 [ ( z 1)]

Linear Phase Note that a zero-phase filter cannot be implemented for real-time applications. Why? Real time means causal operation. No time to reverse and refilter. For a causal transfer function with a nonzero phase response, the phase distortion can be avoided by ensuring that the transfer function has (preferably) a unity magnitude and a linear-phase characteristic in the frequency band of interest H j ( ) e H ( ) 1 H ( ) ( ) Note that this phase characteristic is linear for all in [0 2]. Recall that the phase delay at any given frequency 0 was If we have linear phase, that is, ()=-, then the total delay at any frequency 0 is 0 = -( 0 )/ 0 = - 0 / 0 = Note that this is identical to the group delay d()/d g evaluated at 0 p ( o ( ) d ( ) ( 0) d o o ) 0 Digital Signal Processing, 2007 Robi Polikar, Rowan University

Linear Phase Filters It is typically impossible to design a linear phase IIR filter, however, designing FIR filters with precise linear phase is very easy: Consider a causal FIR filter of length M+1 (order M) H ( z) N n0 n h[ n] z h[0] h[1] z h[2] z h[ M ] z 1 2 M This transfer function has linear phase, if its impulse response h[n] is either symmetric or anti-symmetric h[ n] h[ M n], 0 n M h[ n] h[ M n], 0 n M Digital Signal Processing, 2007 Robi Polikar, Rowan University

LINEAR PHASE FILTERS This linear phase filter description can be generalised into a formalism for four type of FIR filters: Type 1: symmetric sequence of odd length Type 2: symmetric sequence of even length Type 3: anti-symmetric sequence of odd length Type 4: anti-symmetric sequence of even length

Linear Phase Filter Zero Locations Type 1 FIR filter: Either an even number or no zeros at z = 1 and z=-1 Type 2 FIR filter: Either an even number or no zeros at z = 1, and an odd number of zeros at z=-1 Type 3 FIR filter: An odd number of zeros at z = 1 and and z=-1 Type 4 FIR filter: An odd number of zeros at z = 1, and either an even number or no zeros at z=-1 The presence of zeros at z=±1 leads to some limitations on the use of these linear-phase transfer functions for designing frequency-selective filters 1 1 1 1 Type 1 Type 3 1 1 1 1 Type 2 Type 4 Digital Signal Processing, 2010 Robi Polikar, Rowan University

A Type 2 FIR filter cannot be used to design a highpass filter since it always has a zero at z=-1 A Type 3 FIR filter has zeros at both z = 1 and z=-1, and hence cannot be used to design either a lowpass or a highpass or a bandstop filter A Type 4 FIR filter is not appropriate to design a lowpass filter due to the presence of a zero at z = 1 Type 1 FIR filter has no such restrictions and can be used to design almost any type of filter Digital Signal Processing, 2010 Robi Polikar, Rowan University

FIR or IIR??? Several advantages to both FIR and IIR type filters. Advantages of FIR filters (disadvantages of IIR filters): Can be designed with exact linear phase, Filter structure always stable with quantized coefficients The filter startup transients have finite duration Disadvantages of FIR filters (advantage of IIR filters) Order of an FIR filter is usually much higher than the order of an equivalent IIR filter meeting the same specifications higher computational complexity In fact, the ratio of orders of a typical IIR filter to that of an FIR filter is in the order of tens. The nonlinear phase of an IIR filter can be minimized using an appropriate allpass filter, however, by that time the computational advantage of IIR is lost. However, in most applications that does not require real-time operation, phase is not an issue. Why? A zero phase filter can be easily obtain through double-reverse processing (filtfilt) Digital Signal Processing, 2007 Robi Polikar, Rowan University

WINDOWING: zero coefficients outside M/2 n M/2 and a shift to the right yields finite series with length M+1 h LP [ n] sin( c ( n M / 2)) M, 0 n M, n ( n M /2) 2 c M, n 2

h HP sin( cn), n 0 n [ n] c 1-, n 0

FIR BPF/BSF Design H BP (e j ) H LP (e j ) H LP (e j ) 1 1 = - 1 c2 c1 c1 c2 c 0 c c = c2 c 0 c c = c1 H BP ( ) H LP ( ) h c BP[ n] c2 H LP ( ) c c1 sin c n M / 2 2 n M / 2 c 2 c1 M, n 2 sin c 1 h BP n M [ n] h n M / 2 / 2 LP, [ n] c c2 h LP 0 n M, n [ n] M 2 c c1 Similarly, H BS ( ) 1 H ( ) h [ n] [ n] h [ n] BP Digital Signal Processing, 2007 Robi Polikar, Rowan University BS BP

However? What happened? Digital Signal Processing, 2007 Robi Polikar, Rowan University

Gibbs Phenomenon H d : Ideal filter frequency response : Rectangular window frequency response H t : Truncated filter s frequency response Digital Signal Processing, 2007 Robi Polikar, Rowan University