summable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.

Similar documents
CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

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

Music 270a: Complex Exponentials and Spectrum Representation

Review of Discrete-Time System

Chap 2. Discrete-Time Signals and Systems

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

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

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

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Discrete-Time David Johns and Ken Martin University of Toronto

Question Paper Code : AEC11T02

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Discrete-Time Fourier Transform (DTFT)

EC Signals and Systems

Discrete Time Systems

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

Discrete-time signals and systems

z-transform Chapter 6

Multidimensional digital signal processing

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

Very useful for designing and analyzing signal processing systems

Digital Filters Ying Sun


7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.

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

EE 521: Instrumentation and Measurements

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

CITY UNIVERSITY LONDON. MSc in Information Engineering DIGITAL SIGNAL PROCESSING EPM746

Discrete-time Signals and Systems in

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Signals & Systems Handout #4

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

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

EE 224 Signals and Systems I Review 1/10

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

Final Exam January 31, Solutions

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

Analog vs. discrete signals

ECE-314 Fall 2012 Review Questions for Midterm Examination II

E : Lecture 1 Introduction

Ch. 7: Z-transform Reading

Digital Signal Processing Lecture 8 - Filter Design - IIR

Solutions. Number of Problems: 10

Fourier Series. Spectral Analysis of Periodic Signals

ECE503: Digital Signal Processing Lecture 5

EEL3135: Homework #4

Chapter 4 The Fourier Series and Fourier Transform

Review of Linear Time-Invariant Network Analysis

Discrete Time Systems

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

The Discrete-Time Fourier

Chapter 4 The Fourier Series and Fourier Transform

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

Ch.11 The Discrete-Time Fourier Transform (DTFT)

Grades will be determined by the correctness of your answers (explanations are not required).

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Grades will be determined by the correctness of your answers (explanations are not required).

Discrete Fourier Transform

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.

Table 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients

Lecture 7 Discrete Systems

VI. Z Transform and DT System Analysis

Discrete-Time Signals and Systems

Detailed Solutions to Exercises

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

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

ECGR4124 Digital Signal Processing Midterm Spring 2010

Question Bank. UNIT 1 Part-A

Transform Analysis of Linear Time-Invariant Systems

Problem Value

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

Problem Value

University Question Paper Solution

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

3 Fourier Series Representation of Periodic Signals

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

Stability Condition in Terms of the Pole Locations

ELEG 305: Digital Signal Processing

Discrete Time Fourier Transform

2.161 Signal Processing: Continuous and Discrete Fall 2008

A. Relationship of DSP to other Fields.

Signal Analysis, Systems, Transforms

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ω

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Digital Signal Processing Lecture 4

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

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

Review of Fundamentals of Digital Signal Processing

z-transforms Definition of the z-transform Chapter

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 )

Problem Value

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

Chapter 5 Frequency Domain Analysis of Systems

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

LAB 6: FIR Filter Design Summer 2011

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

VU Signal and Image Processing

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

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

Transcription:

EECS 206 DSP GLOSSARY c Andrew E. Yagle Fall 2005 absolutely impulse response: h[n] is finite. EX: n=0 ( 3 4 )n = 1 = 4 but 1 3 n=1 1 n. 4 summable Necessary and sufficient for BIBO stability of an LI system. Also see poles. affine y[n] = ax[n] + b for constants a and b 0. his is a linear-plus-constant function. system Affine systems are not linear systems, although they do look like linear systems. aliasing EX: x(t) = cos(2π6t) sampled at 10 Hz: t = n 10 x[n] = cos(1.2πn) = cos(0.8πn). Ideal interpolation (for a sinusoid) n = 10t x(t) = cos(2π4t). 6 Hz aliased to 4. Can avoid aliasing by sampling faster than Nyquist rate, or use an antialias filter. amplitude of a sinusoid: A in sinusoidal signal A cos(ωt + θ). Amplitude is always 0. antialias Analog lowpass filter that ensures that the sampling rate exceeds Nyquist rate, filter ensuring that aliasing does not occur during interpolation of the sampled signal. argument of a complex number: another name for phase. Matlab: angle(1+j)=0.7854=π/4. ARMA Auto-Regressive Moving-Average difference equation. #y[n] > 1 and #x[n] > 1. average Continuous time: Average power=ms(x) = 1 0 x(t) 2 dt for x(t) period=. power Discrete time: Average power=ms(x) = 1 N 1 N n=0 x[n] 2 for x[n] period=n. band-pass Filter with frequency response H(e jω ) small at DC ω = 0 and small at ω = π, filter (BPF) but large at some intermediate band a < ω < b. BPFs reduce high-frequency noise. bandwidth Maximum frequency in a cont.-time signal x(t). Sometimes defined as twice this. beat EX: cos(99t) + cos(101t) = 2 cos(1t) cos(100t) like varying amplitude cos(100t). signal his beating sound can be used to tune a piano; also models a tone on AM radio. BIBO Bounded-Input-Bounded-Output system: x[n] BIBO y[n]. Means: stable If x[n] M for some constant M, then y[n] N for some constant N. An LI system is BIBO stable iff all of its poles are inside the unit circle. cascade connection of systems: x[n] g[n] h[n] y[n]. Overall impulse response: y[n] = h[n] (g[n] x[n]) = (h[n] g[n]) x[n] convolve their impulse responses. causal: signal: x[n] = 0 for n < 0; causal system has a causal impulse response h[n]. comb y[n] = x[n] + x[n 1] +... + x[n M + 1] eliminates all A k cos( 2π M kn + θ k) in x[n]. filter transfer function=h(z) = (z e j 2π M )... (z e j 2π M (M 1) )/z M 1 has zeros at e j 2π M k, which are the M th roots of unity. Eliminates all harmonics of periodic function. complex of complex number z = x + jy is z = x jy; of z = Me jθ is z = Me jθ. conjugate Properties: z 2 = zz ; Re[z] = 1 2 (z + z ); Im[z] = 1 2j (z z ); e j2 z = z z. complex Continuous time: x(t) = e jωt. Discrete time: x[n] = e jωn where ω=frequency. exponential Fourier series are expansions of periodic signals in terms of these functions.

complex Plot of Imaginary part of complex number vs. real part of complex number. plane You can visualize z = 3 + j4 at Cartesian coordinates (3, 4) in the complex plane. conjugate If x(t) is real-valued, then x k = x k in its Fourier series expansion, where symmetry x k is complex conjugate of x k. DF: If x[n] is real-valued, then X N k = Xk convolution y[n] = h[n] x[n] = n i=0 h[i]x[n i] = n i=0 h[n i]x[i] if h[n] and x[n] causal. x[n] LI y[n] = h[n] x[n] where h[n]=impulse response of LI system. correlation Continuous time: C(x, y) = x(t)y(t) dt. Discrete time: C(x, y) = x[n]y[n]. correlation C N (x, y) = C(x,y) C(x,x)C(y,y) where C(x, y)=correlation and C(x, x) = E(x)=energy. coefficient C N (x, y) 1 by Cauchy-Schwarz, so C N (x, y)=(the similarity of x[n] and y[n]). DC term in Fourier series is constant x 0 or a 0 (continuous time) or X 0 (discrete time). DC means Direct Current, which does not vary with time, vs. AC, which is a sinusoid. delay x[n] delayed by D > 0 is x[n D]: D seconds later; shift x[n] graph right by D > 0. DF N-point DF of {x[n]} is X k = 1 N 1 N n=0 x[n]e j 2π N nk for k = 0, 1... N 1. Use fft. Discrete Fourier ransform computes coefficients X k of the discrete-time Fourier series x[n] = X 0 + X 1 e j 2π N n + X 2 e j 4π N n N 1 j2π +... + X N 1 e N n where x[n] has period=n. difference y[n] + a 1 y[n 1] +... + a N y[n N] = b 0 x[n] + b 1 x[n 1] +... + b M x[n M]. equation ARMA; describes an LI system; this is how it is actually implemented on a chip. duration Continuous time: If signal support=[a, b] duration=(b a)=how long it lasts. Discrete time: If signal support=[a, b] duration=(b a + 1). Note the +1. energy Continuous: E(x) = b a x(t) 2 dt. Discrete: E(x) = b n=a x[n] 2 if support=[a, b]. Euler s formula: e jθ = cos θ + j sin θ. Polar rectangular: Me jθ = M cos θ + jm sin θ. even x(t) = x( t): x(t) is symmetric about the vertical axis t = 0. EX: cos(t), t 2, t 4. function A periodic even function has Fourier series having b k = 0 and x k real numbers. fft Matlab command that computes DF. Use: fft(x,n)/n. See also fftshift. fftshift Matlab command that swaps first and second halves of a vector. Used with fft. Displays the line spectrum with negative frequencies to left of positive ones. filter LI system with frequency response performing some task, e.g., noise reduction. FIR Finite Impulse Response system: its impulse response h[n] has finite duration. FIR systems are: also MA systems; always BIBO stable; all poles are at origin. Fourier x(t) = x 0 + x 1 e j 2π t + x 2 e j 4π N t + x 3 e j 6π N t +... + x 1 series where x k = 1 e j 2π t + x 2 e j 4π N t + x 3 e j 6π N t +... 0 x(t)e j 2π kt dt for integers k and x(t) is real-valued with period=.

Fourier x(t) = a 0 + a 1 cos( 2π t) + a 2 cos( 4π t) +... + b 1 sin( 2π t) + b 2 cos( 4π t) +... where series a k = 2 2π x(t) cos( 0 kt) dt and b k = 2 2π x(t) sin( 0 kt) dt and x(t) has period=. (trig form) BU: note a 0 = 1 0 x(t) dt = M(x)=DC term is a special case: note 1, not 2. frequency of a sinusoid: ω in signal A cos(ωt + θ). Units of ω : RAD SEC. Units of f = ω 2π : Hertz. frequency H(e jω ) = H(z) z=e jω where H(z) is transfer function. Sometimes write: H(ω). response cos(ω o n) LI A cos(ω o n + θ) where H(e jω o ) = Ae jθ. A=gain of system. x[n] = X k e j 2π N kn LI y[n] = Y k e j 2π N kn where Y k = H(e j 2π N k )X k. fundamental Sinusoid c 1 cos( 2π t + θ 1) at frequency 1 Hertz in Fourier series of periodic x(t). gain Gain= H(e jω ) =magnitude of frequency response. Describes filtering effect. harmonic Sinusoid c k cos( 2π kt + θ k) at frequency k Hz in Fourier series of periodic x(t). high-pass Filter with frequency response H(e jω ) small at DC ω = 0 and large at ω = π. filter (HPF) HPFs enhance edges in images and signals, but also amplify high-frequency noise. histogram Plot of #times a signal value lies in a given range vs. range of signal values (bins). Can be used to compute good approximations to mean, mean square, rms, etc. IIR Infinite Impulse Response system: impulse response h[n] has infinite duration. imaginary of a complex number: Im[x+jy] = y; Im[Me jθ ] = M sin θ. Matlab: imag(3+4j)=4. part Note that the imaginary part of 3 + j4 is 4, NO j4! A VERY common mistake! impulse Discrete time: δ[n] = 0 unless n = 0; δ[0] = 1. Continuous time: wait for EECS 306. impulse h[n]: Response to an impulse: δ[n] LI h[n]. y[n]=b 0 x[n]+...+b M x[n-m], response x[n] LI y[n] = h[n] x[n]; see convolution. then h[n] = {b 0, b 1... b M }. inter- A signal nature (60 Hz) or humans (jamming) adds to a desired signal that obscures ference the desired signal. Unlike added noise, interference is usually known approximately. interp- he act of reconstructing x(t) from its samples x[n] = x(t = n ). Also: D-to-A. olation Zero-order hold: ˆx(t) = x[n] for {n < t < (n + 1) }; linear; exact using a sinc. Exact interpolation of discrete Fourier series: set n = t/ in all the sinusoids. inverse Get x[n] from its z-xform X(z) = Z{x[n]}. EX: X(z) = z z 3 x[n] = 3n u[n]. z-xform Do this by inspection or partial fraction expansion of rational function X(z). line Plot of the x k in Fourier series of a signal vs. frequency ω. Also for X k in DF. spectrum x k is depicted in plot by a vertical line of height x k at ω = 2π k where =period.

linear of two signals x 1 [n] and x 2 [n] is the signal (ax 1 [n] + bx 2 [n]) for constants a and b. combination Lin. system: Response to linear combination is linear combination of responses. linear his means that if x 1 [n] LINEAR y 1 [n] and x 2 [n] LINEAR y 2 [n] system then (ax 1 [n] + bx 2 [n]) LINEAR (ay 1 [n] + by 2 [n]) for any constants a and b. Often works: if doubling input x[n] doubles output y[n], system is likely to be linear. low-pass Filter with frequency response H(e jω ) large at DC ω = 0 and small at ω = π. filter (LPF) LPFs smooth edges in images and signals, but they do reduce high-frequency noise. LI system is both Linear and ime-invariant. So what? See IMPULSE RESPONSE and FREQUENCY RESPONSE. MA Moving-Average difference equation: y[n] = b 0 x[n] + b 1 x[n 1] +...+ b M x[n M]. MA systems are: also FIR systems; always BIBO stable; all poles are at origin. magnitude of a complex number: Me jθ = M; x + jy = x 2 + y 2. Matlab: abs(3+4j)=5. Matlab Computer program used universally in communications, control, and signal processing. Matlab has been known to drive people crazy (look at what happened to me :)). mean Cont.: M(x) = 1 Disc.: M(x) = 1 N 0 x(t)dt for x(t) period=. M(x) = x 0 = a 0 in Fourier series. N 1 n=0 x[n] for x[n] period=n. M(x) = X 0 in the DF of x[n]. 0 mean Cont.: MS(x) = 1 x(t) 2 dt = M(x 2 ) (M(x)) 2 for x(t) periodic with period=. square Disc.: MS(x) = 1 N 1 N n=0 x[n] 2 for x[n] period=n. Mean square=average power. mean Fourier series Periodic x(t) = x 0 + x 1 e j 2π t +... + x 1e j 2π t +... (infinite series). square ˆx(t) = x 0 + x 1 e j 2π t +... + x M e j 2π Mt + x 1e j 2π t +... + x 2π Me j Mt (finite series). error MSE=MS(x(t) ˆx(t)) is the mean square error in approximating x(t) with ˆx(t). noise An unknown signal that nature adds to a desired signal that obscures desired signal. A lowpass filter often helps reduce noise, while (mostly) keeping the desired signal. notch y[n] = x[n] 2 cos(ω o )x[n 1] + x[n 2] eliminates A cos(ω o n + θ) component in x[n]. filter transfer function=(z e jω o )(z e jω o )/z 2 has: zeros at e ±jω o ; poles at origin. Nyquist Sampling a continuous-time signal x(t) at twice its bandwidth (minimum rate). sampling he minimum sampling rate for which x(t) can be interpolated from its samples. odd x(t) = x( t): x(t) is antisymmetric about the vertical axis t = 0. EX: sin(t), t, t 3. function A periodic odd function has Fourier series having a k = 0 and x k pure imaginary. order of this MA (also FIR) system is M: y[n] = b 0 x[n] + b 1 x[n 1] +... + b M x[n M]. origin of the complex plane is at Cartesian coordinates (0, 0). An elegant name for 0+j0. orthogonal signals x(t) and y(t) have correlation C(x, y) = 0; MS(x + y) = MS(x) + MS(y). complex exponentials and sinusoids that are harmonics yields Fourier series.

Parseval s Cont.: 1 theorem Discrete time: 1 N 0 x(t) 2 dt = k= x k 2 = a 2 0 + 1 2 k=1 (a2 k + b2 k ) (see Fourier series). 0 x[n] 2 = N 1 k=0 X k 2 where {X k } are the N-point DF of x[n]. States that average power can be computed in either the time or Fourier domains. partial of RAIONAL FUNCION H(z) = N(z) D(z) = A 1 z p 1 +... + A N z p N. Need: degree D(z) > degree N(z). fraction {p 1... p N } are the poles of the transfer function H(z); {A n } are its residues. expansion Used to compute the inverse z-transform of a rational function by inspection. periodic x(t) has period= x(t) = x(t ± ) = x(t ± 2 ) = x(t ± 3 ) =... for ALL time t. function A cos(ωt+θ) has period = 2π ω ; RAIONAL A cos(ωn+θ) is not periodic unless ω = 2π NUMBER. phase of complex number: (Me jθ ) = θ; (x + jy) = tan 1 ( y ). Use angle(1+j)=π/4. x phase of a sinusoid: θ in the sinusoid A cos(ωt + θ). Add π if M < 0, A < 0 or x < 0 above. phasor Complex number Me jθ used to represent sinusoid M cos(ωt + θ). So why do this? A cos(ωt + θ) + B cos(ωt + φ) = C cos(ωt + ψ) Ae jθ + Be jφ = Ce jψ (much easier!). polar of complex number: Me jθ ; M=magnitude=distance from origin of complex plane form at angle θ=phase from real axis. z=x+jy M= x 2 + y 2 ; θ = tan 1 ( y ) if x > 0. x poles of a rational-function transfer-function H(z) = N(z) are the roots of D(z) = 0. D(z) EX: H(z) = z2 3z+2 z 2 7z+12 z2 7z+12 = 0 {poles} = {3, 4}. roots([1-7 12]=3,4. An LI system is BIBO stable if and only if all poles are inside the unit circle. pole-zero Plot of poles using X s and zeros using O s of LI system in the complex plane. diagram If all X s are inside the unit circle, then system is BIBO stable. Matlab: zplane(n,d). quantiz- of x[n] represents each value of x[n] with a finite #bits=n, so x[n] can take 2 N values. ation Produces slight roundoff error, which is neglected in EECS 206 since N=16 or 32. rational of z is the ratio of two polynomials in z, so it has a partial fraction expansion. function ransfer functions in EECS 206 are rational functions with finite #poles & zeros. residues he constants {A n } in the partial fraction expansion of a rational function. real part of a complex number: Re[x+jy] = x; Re[Me jθ ] = M cos θ. Matlab: real(3+4j)=3. rectangular of complex number: x + jy. Coordinates (x, y) in complex plane. cf. polar form. form x=real part; y=imaginary part. z=me jθ x=m cos θ; y=m sin θ P R key. rms 1 0 x(t) 2 dt = MS(x) = M(x 2 ). EX: rms[a cos(ωt + θ)] = A 2 if ω 0. M roots he M solutions to z M = 1, which are z = e j 2π M k for k = 1... M. Unity means 1. of unity he zeros of a comb filter are the M th roots of unity, excluding the root z = 1.

running Correlation between a signal and delayed versions of another signal, regarded as correlation a function of the delay: RC[n] = C(x[i], y[i n]). Used for time delay estimation. sampling Act of constructing x[n] = x(t = n ) from values of x(t) at integer multiples of. sawtooth Periodic x(t) = at for 0 < t < b and x(t) = 0 for b < t < c (like chain of triangles). sinc sinc(x) = sin πx πx. Used in ideal interpolator, and also in h[n] for ideal lowpass filter. sinusoid A function of time of the form x(t) = A cos(ωt + θ) = ( A 2 ejθ )e jωt + ( A 2 e jθ )e jωt. spectrum See line spectrum. In EECS 206, all spectra are line spectra. Not so in EECS 306. square Periodic x(t) = a for c < t < d and x(t) = b for d < t < e (like chain of squares). wave x(t) has period=e-c and duty cycle d c e c if a > b, so that a= on and b= off. stem plot Plot of discrete-time signal using chain of vertical lines topped with circles. stem(x). step function u(t) = { 1 for t > 0 0 for t < 0 and u[n] = { 1 for n 0. Note that u[0] = 1. 0 for n 1 step response s[n]: Response of a system to a step function: u[n] LI s[n] super- of two signals x 1 [n] and x 2 [n] is the signal (ax 1 [n] + bx 2 [n]) for constants a and b. position Linear system: Response to a superposition is the superposition of the responses. Another term for linear combination, but applied specifically to system inputs. support of x(t) is interval [a, b] means that x(t) = 0 for all t > a and t < b. Same for x[n]. system function Another name for transfer function H(z). erm used mostly in DSP. ime- If x[n] I y[n] then x[n D] I y[n D] for any constant delay D. Invariance A system is I if there are no n s outside brackets. EX: y[n] = nx[n] is not I. time scale x(at) is x(t) compressed if a > 1; expanded if 0 < a < 1; time-reversed if a < 0. transfer H(z) = Z{h[n]}=z-transform of impulse response of an LI system. So what? function Relates: IMPULSE RESPONSE, FREQUENCY RESPONSE, DIFFERENCE EQUAION, POLE ZERO DIAGRAM descriptions. triangle Periodic x(t) = a t for t < a and x(t) = 0 rest of period (chain of triangles). unit he circle {z : z = 1} = {z : z = e jω } in the complex plane, centered at origin. circle An LI system is BIBO stable if and only if all poles are inside the unit circle. zeros of a rational-function transfer-function H(z) = N(z) are the roots of N(z) = 0. D(z) EX: H(z) = z2 3z+2 z 2 7z+12 z2 3z + 2 = 0 {zeros} = {1, 2}. roots([1-3 2]=1,2. z-xform of x[n] is X(z) = Z{x[n]} = x[0] + x[1]z 1 + x[2]z 2 +... EX: Z{3, 1, 4} = 3z2 +z+4 z 2.