Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Similar documents
Time-Domain Representations of LTI Systems

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

ADVANCED DIGITAL SIGNAL PROCESSING

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Chapter 2 Systems and Signals

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

ECE 308 Discrete-Time Signals and Systems

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Frequency Response of FIR Filters

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

Solution of EECS 315 Final Examination F09

2D DSP Basics: 2D Systems

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

Signals & Systems Chapter3

DIGITAL SIGNAL PROCESSING LECTURE 3

Linear time invariant systems

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Computing the output response of LTI Systems.

Digital Signal Processing, Fall 2006

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.

Vibratory Motion. Prof. Zheng-yi Feng NCHU SWC. National CHung Hsing University, Department of Soil and Water Conservation

Chapter 7: The z-transform. Chih-Wei Liu

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

Question1 Multiple choices (circle the most appropriate one):

Solutions - Homework # 1

Classification of DT signals

Chapter 7 z-transform

6.003: Signal Processing

Chapter 8. DFT : The Discrete Fourier Transform

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

Discrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

ELEG3503 Introduction to Digital Signal Processing

Chapter 4 : Laplace Transform

Ch3 Discrete Time Fourier Transform

The Discrete Fourier Transform

M2.The Z-Transform and its Properties

Appendix: The Laplace Transform

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

1. Nature of Impulse Response - Pole on Real Axis. z y(n) = r n. z r

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

Finite-length Discrete Transforms. Chapter 5, Sections

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

Optimum LMSE Discrete Transform

AND SYSTEMS 2.0 INTRODUCTION

MAXIMALLY FLAT FIR FILTERS

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)

FIR Filter Design: Part II

Signal Processing in Mechatronics

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

6.003 Homework #3 Solutions

Frequency Domain Filtering

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

Discrete-Time System Properties. Discrete-Time System Properties. Terminology: Implication. Terminology: Equivalence. Reference: Section 2.

Digital Signal Processing, Fall 2010

Sinusoidal Steady-state Analysis

Web Appendix O - Derivations of the Properties of the z Transform

Exponential Moving Average Pieter P

Introduction to Digital Signal Processing

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2004 Lecture 2 Linear Systems. Topics

EE123 Digital Signal Processing

EE123 Digital Signal Processing

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

FIR Filter Design: Part I

8. Applications To Linear Differential Equations

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

EECE 301 Signals & Systems

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

FFTs in Graphics and Vision. The Fast Fourier Transform

mx bx kx F t. dt IR I LI V t, Q LQ RQ V t,

6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis

T Signal Processing Systems Exercise material for autumn Solutions start from Page 16.

Difference Equation Construction (1) ENGG 1203 Tutorial. Difference Equation Construction (2) Grow, baby, grow (1)

Infinite Series and Improper Integrals

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

A. Basics of Discrete Fourier Transform

Solution of Linear Constant-Coefficient Difference Equations

Introduction to Signals and Systems, Part V: Lecture Summary

AH Checklist (Unit 3) AH Checklist (Unit 3) Matrices

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

EE422G Homework #13 (12 points)

Notes 20 largely plagiarized by %khc

EEO 401 Digital Signal Processing Prof. Mark Fowler

Objective Mathematics

Transcription:

Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4 / Chapter Sigals Sigalsdescribe a wide variety of (physical) pheomea Sigals may be represeted i may ways Iformatio i a sigal is cotaied i a patter of variatios of some form, i.e. variatio of voltages over time i a circuit applied force ad resultig velocity of a car fluctuatios of acoustic pressure i speech productio by huma vocal mechaism Examples of Sigals A simple RC circuit with source voltage v s ad capacitor voltage v c A automobile respodig to a applied force f from the egie ad to a fractioal force ρv proportioal to the velocity v T-6.4 / Chapter 3 T-6.4 / Chapter 4 Examples of Sigals Examples of Sigals Example of a recordig of speech: The sigal represets acoustic pressure variatios as a fuctio of time for the spoke words: should we chase A moochromatic picture T-6.4 / Chapter 5 T-6.4 / Chapter 6

Represetatio of Sigals Sigals are represeted mathematically as fuctios of oe or more idepedet variables We will geerally refer the idepedet variable as time Two basic types of sigals: Cotiuous-time (CT) sigals ad Discrete-time (DT) sigals Cotiuous-Time ad Discrete-Time Sigals Symbol t is used to deote the idepedet variable of cotiuous-time sigals Symbol is used to deote the idepedet variable of discrete-time sigals Cotiuous-time sigal: x(t) Discrete-time sigal: x[ x[ is a sequece, defied oly for iteger values of T-6.4 / Chapter 7 T-6.4 / Chapter 8 Cotiuous-Time ad Discrete-Time Sigals Digital Image Two-dimesioal (digital) sigal: Itesity is a fuctio of spatial coordiates T-6.4 / Chapter 9 T-6.4 / Chapter Sigal Eergy ad Power Sigals are directly related to physical quatities capturig power ad eergy i a physical system Istataeous power, e.g., p ( t) = v( t ) i( t) = v R ( t) where v(t) ad i(t) are the voltage ad curret, respectively, across the resistor of resistace R Sigal Eergy ad Power Total eergy expeded over the time iterval t < t < t t p( t) dt = t t R v ( t ) dt Average power over this time iterval t t p t dt t t ( ) = t t R v t dt t ( ) t t T-6.4 / Chapter T-6.4 / Chapter

Sigals with Complex Values Total eergy over time iterval t < t < t of a cotiuous-time sigal x(t) t t x( t ) dt where x is the magitude of the (possibly complex) umber x Similarly, the total eergy of a discrete-time sigal x[ over time iterval t < t < t is x[ = T-6.4 / Chapter 3 Total Eergy over Ifiite Time Iterval I may systems we are iterested i examiig power ad eergy i sigals over ifiite time iterval ad T + E = lim x ( t ) dt = x ( t ) dt T T + N E = lim x[ N = N + = T-6.4 / Chapter 4 Total Power over Ifiite Time Iterval The time-averaged power over ifiite time iterval is defied as ad P P T = x t T T = lim ( ) T N N = N + N lim + dt x[ Three Importat Classes of Sigals (3) Sigals with fiite total eergy, E Such a sigal must have zero average power E P = lim = t T Example: A sigal that takes the value for < t< ad otherwise. I this case E ad P = = T-6.4 / Chapter 5 T-6.4 / Chapter 6 Three Importat Classes of Sigals (3) Sigals with fiite average power P If P > the, of ecessity, E = If there is ozero average eergy per uit time (i.e. ozero power), the itegratig or summig this over a ifiite time iterval yields a ifiite amout of eergy Three Importat Classes of Sigals 3(3) There are also sigals for which either or are ifiite P E A simple example is the sigal x(t) = t Example: Costat sigal x[ = 4 has ifiite eergy, but average power = 6 P T-6.4 / Chapter 7 T-6.4 / Chapter 8

Trasformatios of the Idepedet Variable Time shift: x[ - ] Time reversal: x[- obtaied from x[ Time scalig: x(t); x(t); x(t/) Trasformatio: x(t) -> x(αt + β) preserves the shape of x(t) ; liear stretchig if α < or liear compressio if α > time reversal ifα < time shift if β is ozero Time-Shift of a Discrete-Time Sigal Origial sequece x[ Delayed sequece x[- ] T-6.4 / Chapter 9 T-6.4 / Chapter Time-Reversal of a Discrete-Time Sigal Time-Scalig of a Cotiuous-Time Sigal T-6.4 / Chapter T-6.4 / Chapter Examples of Operatios Sigal x(t) Advace x(t+) (shiftto the left) Reversed versio of x(t+): x(-t+) Compressed versio of x(t): x((3/)t) Liearlycompressed ad advaced sigal: x((3/)t+) Periodic Sigals A sigal x(t) is periodic with period T if x(t) = x(t+t) for all values of t The fudametal period T of x(t) is the smallest positive value of T for which the above equality holds A sigal x(t) that is ot periodic is referred to as a aperiodic sigal T-6.4 / Chapter 3 T-6.4 / Chapter 4

Examples of Periodic Sigals x[ + 3] Eve ad Odd Sigals Cotiuous ad discrete eve sigals: x(-t) = x(t) or x[- Cotiuous ad discrete odd sigals: x(-t) = -x(t) or x[- = -x[ A odd sigal must be ecessarily zero at t = or = T-6.4 / Chapter 5 T-6.4 / Chapter 6 Examples of Eve ad Odd Sigals Eve-Odd Decompositio of a Sigal Eve part of x(t): Ev{x(t)} = [x(t)+x(-t)] / Odd part of x(t): Od {x(t)} = [x(t)-x(-t)] / T-6.4 / Chapter 7 T-6.4 / Chapter 8 Cotiuous-Time Complex Expoetial ad Siusoidal Sigals Complex expoetial sigal: x(t) = C e at where C ad a are i geeral complex umbers Real expoetial sigals: C ad a are real Growig expoetial: a> Decayig expoetial: a< T-6.4 / Chapter 9 Periodic Complex Expoetial ad Siusoidal Sigals jωt x( t) = e Number a is purelyimagiary: x(t) is periodic with period T : Sice e jω ( t + T ) j ωt jω T e = e e j ω t j ( t+ T ) = e ω j It follows that for periodicity, we must have e ω T = If ω = the x(t)= which is periodic for ay value of T. If ω is ozero, the the fudametal period T of x(t) is π T = ω T-6.4 / Chapter 3

Periodic Complex Expoetial ad Siusoidal Sigals A sigal closelyrelated to the periodic complex expoetialis the siusoidal sigal x( t) = Acos( ω t + φ) It is commo to write ω = πf f has uits of cycles per secod or Hertz (Hz) ω has uits of radias per secod Fudametal period: T Fudametal frequecy: ω =/T Illustratio: Siusoidal Sigal T < T < T3 ω > ω > ω 3 T-6.4 / Chapter 3 T-6.4 / Chapter 3 Discrete-Time Complex Expoetial Sigals Siusoidal Sigals (Sequeces) x[ β = Cα = Ce ; α = e β x[ = cos(π /) α > <α < < α < x[ = cos(8π /3) α < x [ = cos( /6) T-6.4 / Chapter 33 T-6.4 / Chapter 34 Geeral Complex Expoetial Sigals θ C = C e j, α = α e j ω ( ω + θ ) + j C α ( ω θ ) Cα = C α cos si + α > α < Periodicity Properties of Discrete-Time Complex Expoetials Cotiuous-time exp(jω t):. Icreasig ω icreases the rate of oscillatio. exp(jω t) is periodic for ayvalueof ω CosiderDT complex expoetial with frequecy ω +π: j ( ω j j j e + π ) ω e e π ω = = e The expoetial at frequecyω +π is the same as that of frequecy ω I CT case, the expoetial sigalsexp(jω t) are all distict for distict values of ω T-6.4 / Chapter 35 T-6.4 / Chapter 36

Periodicity Properties of Discrete-Time Complex Expoetials DT Siusoidal Sequeces I DT case, the sigalsare otdistict, as the sigal with frequecy ω is idetical to the sigalsto the sigalswith frequeciesω + π, ω + 4π etc. Cosiderig complex expoetialswe eed oly cosider a frequecy iterval of legth π, i.e., ω < π or -π ω < π T-6.4 / Chapter 37 T-6.4 / Chapter 38 Some Basic Sequeces The Uit Impulse ad the Uit Step Fuctios Uit sample sequece, δ[ =, = Uit step sequece, µ [ =, <... T-6.4 / Chapter 4 Relatios betwee Basic Sequeces Uit sample ad uit step sequeces are related as follows: δ [ ] = µ [ µ [ ] µ[ ] = δ[ m] m= Relatios betwee Basic Sequeces The uit sample is the first differece of the uit step: δ [ ] = µ [ µ [ ] µ[ µ [ ]...... µ[ D δ[ + - The above relatios ca be implemeted with simple computatioal structures cosistig of basic arithmetic operatios δ[ µ [ ] Realizatio T-6.4 / Chapter 4 T-6.4 / Chapter 4

Relatios betwee Basic Sequeces Uit step is the ruig sum of the uit step: µ [ ] = δ[ m] = δ [ m] + δ [ = µ [ ] + δ [ m= m= δ [ + D Realizatio µ[ µ [ ] Relatios betwee Basic Sequeces By chagig the variable of summatio i the ruig sum from m to k=-m, the discrete-time uit step ca be writte i terms of the uit sample as µ [ = = k = k= δ[ k] δ [ k] T-6.4 / Chapter 43 T-6.4 / Chapter 44 Cotiuous-Time ad Discrete-Time Systems A system ca be viewed as a process i which iput sigals are trasformed by the system resultig i other sigals as outputs x(t) Cotiuous-time system y(t) Examples Example.8: A RC circuit Example.9: A forces affectig the car Example.: A balace i a bak accout Example.: Digital simulatio of the differetial equatio x[ Discrete-time system y[ T-6.4 / Chapter 45 T-6.4 / Chapter 46 Mathematical Descriptios of Systems Classes of systems that have two importat characteristics: ) The systems have properties ad structures that ca be exploited to gai isight ito their behavior ad to develop effective tools for their aalysis ) May systems of practical importace ca be accurately modeled usig these systems Tools are developed for a particular class of systems referred to as liear ad time-ivariat systems T-6.4 / Chapter 47 Itercoectios of Systems Series or cascade itercoectio Iput System System Output Parallel itercoectio System Iput + Output System T-6.4 / Chapter 48

Itercoectios of Systems Combiatio of parallel ad cascade itercoectios Iput System System 3 System Feedback itercoectio Iput + System System + System 4 Output Output Basic System Properties Systems with ad without memory Ivertibility ad iverse systems Causality Stability Time ivariace Liearity Covolutio T-6.4 / Chapter 49 T-6.4 / Chapter 5 Memoryless Systems Idetity System Output for each value of the idepedet variable at a give time is depedet oly o the iput at the same time Example : y[ = ( x[ x [ ) Cotiuous time : y( t) = x( t) Discrete time : y[ A idetity system is a simple memoryless system whose output is idetical to its iput T-6.4 / Chapter 5 T-6.4 / Chapter 5 Accumulator y [ x[ k] = k = A accumulator is a discrete-time system with memory Delay y[ ] The output is the delayed versio of the iput Realizatio usig a memory locatio or register with delay T x [ T x[ ] T-6.4 / Chapter 53 T-6.4 / Chapter 54

Arbitrary Delay y[ k] A arbitrary delay of k time istats ca be realized usig a shift register of legth k x [ T T T x[ k] Accumulator or Ruig Sum y[ = k = x[ k] + x[ y [ = y[ ] + x[ The accumulator must remember the ruig sum of previous iput values to obtai the output at curret time T-6.4 / Chapter 55 T-6.4 / Chapter 56 Ivertible Systems Ivertible Systems x[ System y[ Iverse system w [ δ[ System u[ Iverse system δ[ If a system is ivertible, the a iverse system exists that whe cascaded with the origial system yields a output w[ equal to iput x[ u [ = δ [ k] δ[ = u[ u[ ] k = Accumulator is a ivertible discretetime system T-6.4 / Chapter 57 T-6.4 / Chapter 58 Causality A system is causal if the output at ay time depeds oly o the values of the iput at the same time ad i the past Example: Accumulator ad delay are causal systems All memoryless systems are causal Nocausality A system is ocausal if the output at ay time depeds also o the future values of the iput Nocausal systems are physically ot realizable Example : y[ x[ + ] T-6.4 / Chapter 59 T-6.4 / Chapter 6

Nocausality A ocausal averagig filter M y [ = x[ k] M + k = M The filter ca be realized with a delay of M samples Stability Iformally, a system is stable if small iputs lead to resposes that do ot diverge y(t) x(t) Pedulum x (t ) y(t) Iverted pedulum T-6.4 / Chapter 6 T-6.4 / Chapter 6 Time Ivariace A system is time ivariat if a time shift i the iput sigal results i a idetical time shift i the output sigal y [ = T ( x[ ) ( x[ ]) y[ ] = T The system properties do ot chage with time Time Ivariace A time ivariat cotiuous-time system [ x( )] y ( t) = si t A time variat discrete-time system y [ Coefficiet is chagig with time T-6.4 / Chapter 63 T-6.4 / Chapter 64 Liearity A liear system is a system that possesses the importat property of superpositio Additivity: The respose to x (t)+x (t) is y (t)+y (t) Scalig or homogeeity: The respose to ax (t) is ay (t) where a is ay complex costat Liearity Combiig the two properties of superpositio ito a sigle statemet Discrete-time: ax [ + bx[ ay [ + by[ where a ad b are ay complexcostats The superpositio property holds for liear systems i cotiuous ad discrete time T-6.4 / Chapter 65 T-6.4 / Chapter 66

Liearity Basic Operatios o Sequeces a x [ ] T[ ] y [ ] [ ] ay b + x [ ] T[ ] y [ ] by [ ] a x ax [ ] [ ] x [ ] bx [ ] ay + by [ ] [ b + T[ ] ay [ + by[ ax + bx [ ] [ Additio: Multiplicatio: Uit delay: x [ + x [ + x[ x [ a x [ ax[ x [ D x[ ] T-6.4 / Chapter 67 T-6.4 / Chapter 68 Arbitrary Sequece x[ x[-3] x[] Arbitrary Sequece x[ x[-3] x[] -7-6 -5-4 -3 - - 3 4 5 6 7 x[4] -7-6 -5-4 -3 - - 3 4 5 6 7 x[4] A arbitrary sequece x[ ca be expressed as a superpositio of scaled versios of shifted uit impulses, δ[-k] T-6.4 / Chapter 69 [ 3] δ [ + 3] x[ ] δ [ ] x[ 4] δ[ 4] x + I geeral: + k= x [ k] δ [ k] T-6.4 / Chapter 7 - Covolutio x[ is represeted as a superpositio of scaled versios of shifted uit impulses, δ[-k] Liearity: The respose of a liear system to x[ will be the superpositio of the scaled resposes of the system to each of these shifted impulses Time ivariace: The resposes of a time-ivariat system to time-shifted uit impulses are the timeshifted versios of oe aother Covolutio The uit impulse respose of a system is h[ T( ) δ () h() T-6.4 / Chapter 7 T-6.4 / Chapter 7

Covolutio y [ = T ( x[ ) = T x[ k] δ [ k] k = Additivity: Homogeeity : Shift ivariace : T k = x[ k= x k= ( ) y [ k] δ[ k] ( δ[ k ) y [ = k] T ] y [ = [ k] h[ k] T-6.4 / Chapter 73