Lecture 17: Response of FIR filters to exponential inputs, response of FIR filters to periodic inputs, cascaded filters Sections 4.4.2,4.4.4, 4.4.5 Sections.

Slides:



Advertisements
Similar presentations
Lecture 4: Phasors; Discrete-Time Sinusoids Sections 1.4, 1.5.
Advertisements

DFT properties Note: it is important to ensure that the DFTs are the same length If x1(n) and x2(n) have different lengths, the shorter sequence must be.
Lecture 18: Linear convolution of Sequences and Vectors Sections 2.2.3, 2.3.
ELEC 303 – Random Signals Lecture 20 – Random processes
AMI 4622 Digital Signal Processing
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Review of Frequency Domain
Chapter 8: The Discrete Fourier Transform
MM3FC Mathematical Modeling 3 LECTURE 7 Times Weeks 7,8 & 9. Lectures : Mon,Tues,Wed 10-11am, Rm.1439 Tutorials : Thurs, 10am, Rm. ULT. Clinics : Fri,
Z-Transform Fourier Transform z-transform. Z-transform operator: The z-transform operator is seen to transform the sequence x[n] into the function X{z},
Image (and Video) Coding and Processing Lecture 2: Basic Filtering Wade Trappe.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
Lecture 8: Cascaded Linear Transformations Row and Column Selection Permutation Matrices Matrix Transpose Sections 2.2.3, 2.3.
3.0 Fourier Series Representation of Periodic Signals
Lecture 16: Introduction to Linear time-invariant filters; response of FIR filters to sinusoidal and exponential inputs: frequency response and system.
Systems: Definition Filter
Relationship between Magnitude and Phase (cf. Oppenheim, 1999)
Finite Impuse Response Filters. Filters A filter is a system that processes a signal in some desired fashion. –A continuous-time signal or continuous.
Random Processes and LSI Systems What happedns when a random signal is processed by an LSI system? This is illustrated below, where x(n) and y(n) are random.
1 Today's lecture −Concept of Aliasing −Spectrum for Discrete Time Domain −Over-Sampling and Under-Sampling −Aliasing −Folding −Ideal Reconstruction −D-to-A.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Discrete-Time and System (A Review)
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Signals and Systems Lecture 20: Chapter 4 Sampling & Aliasing.
Properties and the Inverse of
Motivation Music as a combination of sounds at different frequencies
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
Lecture 12: Introduction to Discrete Fourier Transform Sections 2.2.3, 2.3.
Digital Signal Processing – Chapter 10
Chapter 6 Digital Filter Structures
Finite-Length Discrete Transform
Ch.7 The z-Transform and Discrete-Time Systems. 7.1 The z-Transform Definition: –Consider the DTFT: X(Ω) = Σ all n x[n]e -jΩn (7.1) –Now consider a real.
1 Z-Transform. CHAPTER 5 School of Electrical System Engineering, UniMAP School of Electrical System Engineering, UniMAP NORSHAFINASH BT SAUDIN
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
Fourier Analysis of Discrete-Time Systems
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Z TRANSFORM AND DFT Z Transform
3.0 Fourier Series Representation of Periodic Signals 3.1 Exponential/Sinusoidal Signals as Building Blocks for Many Signals.
Chapter 5 Finite-Length Discrete Transform
DTFT Properties  Example - Determine the DTFT Y(e jω ) of  Let  We can therefore write  the DTFT of x[n] is given by.
1 Today's lecture −Cascade Systems −Frequency Response −Zeros of H(z) −Significance of zeros of H(z) −Poles of H(z) −Nulling Filters.
Digital Signal Processing
1 Lecture 4: March 13, 2007 Topic: 1. Uniform Frequency-Sampling Methods (cont.)
Linear filtering based on the DFT
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
Finite Impuse Response Filters. Filters A filter is a system that processes a signal in some desired fashion. –A continuous-time signal or continuous.
The Fourier Transform.
In summary If x[n] is a finite-length sequence (n  0 only when |n|
بسم الله الرحمن الرحيم Digital Signal Processing Lecture 14 FFT-Radix-2 Decimation in Frequency And Radix -4 Algorithm University of Khartoum Department.
Review of DSP.
1 Chapter 8 The Discrete Fourier Transform (cont.)
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Review of DSP.
Discrete-Time Structure
EE Audio Signals and Systems
UNIT V Linear Time Invariant Discrete-Time Systems
Chapter 8 The Discrete Fourier Transform
Lecture 13 Frequency Response of FIR Filters
Lecture 5: Sampling of Continuous-Time Sinusoids Sections 1.6
Tania Stathaki 811b LTI Discrete-Time Systems in Transform Domain Frequency Response Transfer Function Introduction to Filters.
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Signals and Systems Lecture 18: FIR Filters.
Review of DSP.
ENEE222 Elements of Discrete Signal Analysis Lab 9 1.
Lecture 21 Zeros of H(z) and the Frequency Domain
Presentation transcript:

Lecture 17: Response of FIR filters to exponential inputs, response of FIR filters to periodic inputs, cascaded filters Sections 4.4.2,4.4.4, Sections 2.2.3, 2.3

We have seen that if x[n]= z n is the input to an FIR filter with coe ffi cients b 0,...,b M, then the output y[ · ] is given by y[n]= H(z), where H(z)= b 0 + b 1 z −1 + ··· + b M z −M is the filter’s system function.

If the input is the real-valued sinusoid x[n] = cos(ω 0 n + φ)= (1/2)e jφ e jω0n +(1/2)e -jφ e -jω0n, then, by linearity, the output is given by y[n]= (1/2)H(e jω0 )e jφ e jω0n + (1/2)H(e −jω0 )e −jφ e −jω0n Since H(e -jω ), = H ∗ (e jω ), the expression above equals the sum of two complex conjugate terms, which is the same as twice the real part of either term: y[n]= Re{H(e jω0 )e j(ω0n+φ) )

Writing H(e jω0 ) in complex exponential form, i.e., H(e jω )= |H(e jω )| e j ∠ H(ejω), we obtain � y[n]= |H(e jω0 )|cos (ω 0 n + φ + ∠ H(e jω0 )) (n ∈ Z) The same approach can be applied to the oscillating exponential input x[n]= r n cos(ω0n + φ)= ((e jφ )/2) r n e jω0n + ((e -jφ )/2) r n e -jω0n Taking z = re ±jω0, we obtain in this case y[n]= |H(re jω0 )| r n cos (ω 0 n + φ + ∠ H(re jω0 )) (n ∈ Z)

Example: Let x[n]=2 -n · cos (πn/3 + πn/4), n ∈ Z and y[n]= x[n] + 2x[n − 1] + 2x[n − 2] + x[n − 3] Setting z =(e jπ/3 )/2, we obtain H(z) = 1+4e −j(π/3) +8e −j(2π/3 ) +8e −jπ = e −j2.285 The output sequence is therefore given by � y[n] = · 2 −n · cos(πn/3 − 1.499) �,n ∈ Z Your task: Repeat for x[n] = cos(πn/3+ π/4).

Periodic sequences are always expressible as sums of sinusoids. We have seen that if x[ · ] is periodic with period L, then it can be written as where X [0 : L − 1] is the DFT of its first period x[0 : L − 1]. Thus x[ · ] is a linear combination of L (or fewer) complex sinusoids, whose frequencies are multiples of 2π/L.

Example: Suppose x[n]= A 1 cos(2πf 1 n + φ 1 )+ A 2 cos(2πf 2 n + φ 2 )+ A 3 cos(2πf 3 n + φ 3 ), where the A i ’s are real and nonzero, and f1 = 1/8, f2 =3/20, and f3 = 5/12; Each f i is rational, therefore each sinusoid is periodic. Their sum x[ · ] is also periodic, and its period is the smallest value of L for which all three frequencies are multiples of 1/L. Thus L equals the least common multiple of 8, 20 and 12, namely L = 120. Obviously, the spectrum of x[ · ] has only six (out of 120 possible) lines in [0, 2π). Note: In discrete time, the sum of two or more periodic signals is always periodic. This is not true in continuous time.

If the periodic signal x[ · ] from above is the input to an FIR filter with frequency response H(e jω ), then, by linearity, the filter output is given by Thus the output sequence y[ · ] is also periodic with period L, and its first period y[0 : L − 1] has DFT Y[0 : L − 1] given by ( ♠ )

As we saw earlier, H(e −jωn ) =  � b n e −jωn (for n = 0 to M) can be computed for any set of M + 1 or more uniformly spaced frequencies by zero-padding the vector b and computing a DFT. Thus ( ♠ ) suggests a way of computing the response of an FIR filter to a periodic input of period L (where L ≥ M + 1) using a frequency domain-based tool, namely the element-wise multiplication of two DFT’s.

Example: Consider the filter with input-output relationship y[n]= x[n] − 4x[n − 1] + x[n − 2] Suppose that the input x[ · ] is periodic with period L = 4, such that x[0:3] = � [2 1 −3 5] T The MATLAB script below computes the first period y[0 : 3] of the output. x=[ ].’; X = fft(x) ; b=[1-4 1].’; H = fft(b,4) ; Y = H.*X ; y = ifft(Y)

Since element-wise multiplication of DFT’s is equivalent to circular convolution in the time domain, ( ♠ ) suggests that the response of an FIR filter to a periodic input can be computed using a circular convolution in the time domain. This is not surprising: by rewriting the input-equation y[n]= x[n] − 4x[n − 1] + x[n − 2] in the previous example as y[n]= x[n] − 4x[n − 1] + x[n − 2] + 0 · x[n − 3], we obtain This is the circular convolution of x[0 : 3] and [b; 0], which is precisely what the MATLAB script (above) computes.

If two FIR filters are connected in series, or in a cascade (as shown below), the resulting system function is given by the product of the two system functions, i.e., H(z)= H 1 (z)H 2 (z) (Note that the order in which the two filters are connected is immaterial.) This is proved by using x[n]= z n as the input to the cascade. The output of the first filter is y (1) [n]= H 1 (z)z n, (n ∈ Z) and, by linearity, the output of the second filter (same as the output of the cascade) is y (2) [n]= y[n]= H 1 (z)H 2 (z)z n = H 2 (z)H 1 (z)z n (n ∈ Z) H1H1 H2H2 x = x (1) y (1) = x (2) y (2) = y

Example Two FIR filters with coe ffi cient vectors b (1) = [ ] T b (2) = [1 -4 1] T are connected in cascade. The resulting filter has system function H(z) = (1+2z −1 +2z −2 + z −3 )(1 − 4z −1 + z −2 ) =1 − 2z −1 − 5z −2 − 5z −3 − 2z −4 + z −5 and is therefore an FIR filter with coe ffi cient vector b = � [1 −2 −5 −5 −2 1] T and input-output relationship y[n]= x[n] − 2x[n − 1] − 5x[n − 2] − 5x[n − 3] − 2x[n − 4] + x[n − 5]

Problems: 4.5, 4.7, 4.8,