Dynamic spectrum.

Slides:



Advertisements
Similar presentations
Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
Advertisements

ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
Chapter 4 Modelling and Analysis for Process Control
Lecture 7: Basis Functions & Fourier Series
Fourier Transform (Chapter 4)
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
ELEC 303 – Random Signals Lecture 20 – Random processes
EE-2027 SaS 06-07, L11 1/12 Lecture 11: Fourier Transform Properties and Examples 3. Basis functions (3 lectures): Concept of basis function. Fourier series.
For s.e. of flux multiply cv by mean flux over time period Damage: penetration depends on size.
Image Warping : Computational Photography Alexei Efros, CMU, Fall 2008 Some slides from Steve Seitz
Cedar movie. Cedar Fire Operations/systems. Processes so far considered: Y(t), 0
Lecture 14: Laplace Transform Properties
APPLICATIONS OF FOURIER REPRESENTATIONS TO
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
1 Lavi Shpigelman, Dynamic Systems and control – – Linear Time Invariant systems  definitions,  Laplace transform,  solutions,  stability.
Chapter 3 1 Laplace Transforms 1. Standard notation in dynamics and control (shorthand notation) 2. Converts mathematics to algebraic operations 3. Advantageous.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
1 Consider a given function F(s), is it possible to find a function f(t) defined on [0,  ), such that If this is possible, we say f(t) is the inverse.
Linear Shift-Invariant Systems. Linear If x(t) and y(t) are two input signals to a system, the system is linear if H[a*x(t) + b*y(t)] = aH[x(t)] + bH[y(t)]
1 I. Phasors (complex envelope) representation for sinusoidal signal narrow band signal II. Complex Representation of Linear Modulated Signals & Bandpass.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Effective Computation of Linear Filters The following properties are used to shorten the computation time f  g = g  f, f  (g  h) = (f  g)  h, f 
1 Chapter 1 Fundamental Concepts. 2 signalpattern of variation of a physical quantity,A signal is a pattern of variation of a physical quantity, often.
Signals and Systems Dr. Mohamed Bingabr University of Central Oklahoma
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin Lecture 4 EE 345S Real-Time.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
10. Laplace TransforM Technique
Input Function x(t) Output Function y(t) T[ ]. Consider The following Input/Output relations.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Causality Linearity Time Invariance Temporal Models Response to Periodic.
LAPLACE TRANSFORMS INTRODUCTION. Definition Transforms -- a mathematical conversion from one way of thinking to another to make a problem easier to solve.
Fourier Transform.
The Story of Wavelets Theory and Engineering Applications
ABE 463 Electro-hydraulic systems Laplace transform Tony Grift
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 UniMAP.
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
Óbudai Egyetem Dr. Neszveda József Open and Closed loop Control II. Block diagram model.
Eeng360 1 Chapter 2 Linear Systems Topics:  Review of Linear Systems Linear Time-Invariant Systems Impulse Response Transfer Functions Distortionless.
Computer Vision – 2D Signal & System Hanyang University Jong-Il Park.
Company LOGO Laplace Transform Ch # 5 1. Company LOGO Topics 1. Get to know: Laplace Transform 2. Laplace Theory and Properties 3. Applications 2.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
© Dr. Elmer P. Dadios - DLSU Fellow & Professor
Chapter 4 Transfer Function and Block Diagram Operations
State Space Representation
Transfer Functions.
Recap: Chapters 1-7: Signals and Systems
Image Enhancement in the
Laplace and Z transforms
Research Methods in Acoustics Lecture 7: Convolution and Fourier Transform Jonas Braasch Partly based on Jens Blauert’s Communication Acoustics script.
Filtering/smoothing. Use of A(,). bandpass filtering
Operations/systems. Processes so far considered:
Chapter 2. Fourier Representation of Signals and Systems
Automatic Control System
Digital Control Systems (DCS)
Digital Control Systems (DCS)
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
LAPLACE TRANSFORMS INTRODUCTION.
Chapter 1 Fundamental Concepts
UNIT-I SIGNALS & SYSTEMS.
Modeling in the Time Domain
State Space Analysis UNIT-V.
Digital Image Processing Week IV
6. Time and Frequency Characterization of Signals and Systems
Chapter4 Bandpass Signalling Bandpass Filtering and Linear Distortion
Fourier Transforms.
Lecture 4 Image Enhancement in Frequency Domain
Linear Time Invariant systems
Sampling and Aliasing.
Presentation transcript:

dynamic spectrum

Operations/systems. Processes so far considered: Y(t), 0<t<T time series using Dirac deltas includes point process Y(x,y), 0<x<X, 0<y<Y image includes spatial point process Y(x,y,t), 0<x<X, 0<y<Y, 0<t<T spatial-temporal includes trajectory and more

Manipulating process data All functions, so can expect things computed and parameters to be functions also Operations that are common in nature Differential equations - Newton's Laws Systems - input and (unique) output box and arrow diagrams

Operations. carry one function/process into another Domain D = {X(t), t in Rp or Zp} Map A[. ] notice [ ] Range {Y(.) = A[X](.), X in D} X, Y may be vector-valued Examples. running mean {X(t-1)+X(t)+X(t+1)}/3 running median Y(x,y) = median{X(u,v), u= x,x1, v=y1} gradient Y(x,y)=  X(x,y)  = (/x,/y) level crossings Y(t) = |X'(t)|(X(t)-a) t.s. ==> p.p.

Time invariance. t in Z or R translation operator Tu X(.) = X(.+u) Tu X(t) = X(t+u), for all t operator A is time invariant if A[Tu X](t) = A[X](t+u), for all t,u Examples. previous slide Non example. Y(t) = sup0<s<t |X(s)|

Operator A[.] is linear if A[α1X1 + α2X2] = α1A[X1] + α2A[X2] α's in R, X's in D α, X can be complex-valued complex numbers: z=u + iv, i = sqrt(-1) |z| = sqrt(u2 + v2) , arg z=tan-1 (Re(z),Im(z)) De Moivre: exp{ix} = cos x + i sin x

Linear time invariant A[.]. filter Lemma. If {e(t)=exp{it}, t in Z} in DA, then there is A() with A[e](t) = exp{it}A() A(.): transfer function notice ( ) arg(A(.)): phase |A(.)|: amplitude Example: If Y(t) = A[X](t) = u a(u)X(t-u), u in Z A() = u a(u) exp{-it} FT u: lag A[X]: convolution

Proof. T: translation e(t) = exp(it) e(t+u) = Tue(t) A[e](t+u) = A[Tue](t) definition = A[exp{iu}e](t) definition = exp{iu}A[e](t) linear A[e](u) = exp{iu}A[e](0) set t = 0 A[e](t) = exp{it}A()

Properties of transfer function. A(+2) = A(), exp{i2}=1 fundamental domain for : [0,]

Vector case. a is s by r Y(t) =  a(u)X(t-u) A() =  a(u) exp{-iu} Continuous. Y(t) =  a(u)X(t-u)du A() =  a(u) exp{-iu} du Spatial. Y(x,y) =  a(u,v)X(x-u,y-v) A(,)=u,v a(u,v) exp{-i(u+v)} Point process. Y(t) =  a(u)dN(t-u) =  a(t-j ) A() =  a(u) exp{-iu}du

Algebra (of manipulating linear time invariant operators). Linear combination A[X] + B[X] A() + B()  a(t) + b(t) successive application B[A[X]] B()A()  ba(t) inverse A-1[X] B() = A()-1

Impulse response. Dirac delta (u), u in R Kronecker delta u = 1 if u=0, and = 0 otherwise A[](t) = a(t) impulse response a(u) = 0, t<0 realizable

Examples. Running mean of order 2M+1. Y(t) =  M-M X(t+u)/(2M+1) take X(t) = exp{-it} Difference Y(t) = X(t) - X(t-1) A() = 2i sin(/2) exp{-i/2} |A()|

Bandpass A() = Lowpass Smoothers

Nonlinear. Quadratic instantaneous. Y(t) = X(t)2 X(t) = cos t Y(t) = (1 + cos 2t)/2 Yariv "Quantum Electronics"

Quadratic, time lags (Volterra) Y(t) =  a(u)X(t-u) + u,v b(u,v) X(t-u) X(t-v) quadratic transfer function B(,) = u,v b(u,v) exp{-i(u+iv)}

Transforms. Fourier. dT() = t Y(t) exp{-it}  real =  Y(t) exp{-it}dt Laplace. LT(p) = t0 Y(t) exp{-pt} p complex =  Y(t) exp{-pt}dt z. ZT(z) = t0 Y(t)zt z complex

Hilbert. Y(t) = u a(u) X(t-u) a(u) = 2/u, u odd = 0, u even u tX(u)/(t-u)du cos t ==> sin t Radon. Y(x,y) R(,) =  Y(x,+x)dx Short-time/running Fourier. Y(t) =  w(t-u) exp{-iu)X(u)du Gabor: w(u) = exp{-ru2}

Wavelet. eg. w(t) = w0(t) exp{-it} Walsh.  (t) Y(t) dt n(t): Walsh function s(t) = [s](t)[t](s) values: ±1 Chirplet. C(,) =  Y(t)exp{-i(+t)t}dt

Use of A(,). Suppose X(x,y)  j,k jk exp{i(j x + k y)} Y(x,y) = A[X](x,y)  j,k A(j,k) jk exp{i(j x + k y)} e.g. If A(,) = 1, | ± 0|, |±0|   = 0 otherwise Y(x,y) contains only these terms Repeated xeroxing

Chapters 2,3 in D. R. Brillinger "Time Series: Data Analysis and Theory". SIAM paperback