Deconvolution of a Causal Signal Roger Barlow. EM simulations and tracking Bunch wake from bunch and wake Need to deconvolute.

Slides:



Advertisements
Similar presentations
Michael Phipps Vallary S. Bhopatkar
Advertisements

Lecture 7: Basis Functions & Fourier Series
Filtering Filtering is one of the most widely used complex signal processing operations The system implementing this operation is called a filter A filter.
Solving Equations = 4x – 5(6x – 10) -132 = 4x – 30x = -26x = -26x 7 = x.
Leo Lam © Signals and Systems EE235. Fourier Transform: Leo Lam © Fourier Formulas: Inverse Fourier Transform: Fourier Transform:
Z Transform (2) Hany Ferdinando Dept. of Electrical Eng. Petra Christian University.
SIGNAL AND SYSTEM CT Fourier Transform. Fourier’s Derivation of the CT Fourier Transform x(t) -an aperiodic signal -view it as the limit of a periodic.
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.
Linear Time-Invariant Systems (LTI) Superposition Convolution.
Jeopardy comments/answers April Existence Uniqueness Each kind of differential equation we studied had a corresponding existence and uniqueness.
DIP Realized by IDL Author: Ying Li Course: computer for imaging science.
Autumn Analog and Digital Communications Autumn
EE-2027 SaS, L15 1/15 Lecture 15: Continuous-Time Transfer Functions 6 Transfer Function of Continuous-Time Systems (3 lectures): Transfer function, frequency.
Math for CSLecture 11 Mathematical Methods for Computer Science Lecture 1.
Lecture 9: Fourier Transform Properties and Examples
FILTERING GG313 Lecture 27 December 1, A FILTER is a device or function that allows certain material to pass through it while not others. In electronics.
Basic Image Processing January 26, 30 and February 1.
Power Amplifiers Power Amplifiers are used in the transmitter
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Computational Geophysics and Data Analysis
Digital Signals and Systems
Taylor Series.
From Bunch Wakes to Delta Wakes Adriana Bungau / Roger Barlow COLSIM meeting CERN, 1 st March 2007.
GG 313 Lecture 26 11/29/05 Sampling Theorem Transfer Functions.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
1 Review of Continuous-Time Fourier Series. 2 Example 3.5 T/2 T1T1 -T/2 -T 1 This periodic signal x(t) repeats every T seconds. x(t)=1, for |t|
Lecture 24: CT Fourier Transform
- State Observers for Linear Systems Conventional Asymptotic Observers Observer equation Any desired spectrum of A+LC can be assigned Reduced order.
Deconvolution in Reaction Kinetics Ernő Keszei Eötvös University Budapest, Hungary.
Signal and System I The unit step response of an LTI system.
Input Function x(t) Output Function y(t) T[ ]. Consider The following Input/Output relations.
Accelerators 2007 Wakefields and the nsFFAG Roger Barlow.
The ECG UConn BME 290. Buffers What is a buffer? –Non-inverting amplifier with a gain of 1 Why use a buffer? –Buffers provide a high input impedance.
Issues in Simulating the Effects of Wakefields Roger Barlow LET Workshop 13 th December 2007.
8th December 2004Tim Adye1 Proposal for a general-purpose unfolding framework in ROOT Tim Adye Rutherford Appleton Laboratory BaBar Statistics Working.
Spectrum Reconstruction of Atmospheric Neutrinos with Unfolding Techniques Juande Zornoza UW Madison.
ABE 463 Electro-hydraulic systems Laplace transform Tony Grift
Solutions Q1: a) False. The Fourier transform is unique. If two signals have the same Fourier transform, then there is a confusion when trying.
Leo Lam © Signals and Systems EE235 Lecture 25.
The general linear model and Statistical Parametric Mapping II: GLM for fMRI Alexa Morcom and Stefan Kiebel, Rik Henson, Andrew Holmes & J-B Poline.
Eeng360 1 Chapter 2 Linear Systems Topics:  Review of Linear Systems Linear Time-Invariant Systems Impulse Response Transfer Functions Distortionless.
Leo Lam © Signals and Systems EE235 Lecture 26.
Math for CS Fourier Transforms
CLIC Workshop 18 th -22 nd January 2016, CERN 1 Alfonso Benot Morell Manfred Wendt.
10.4 Matrix Algebra. 1. Matrix Notation A matrix is an array of numbers. Definition Definition: The Dimension of a matrix is m x n “m by n” where m =
 Signal: Physical quantity that varies with time, space or any other independent variable/s.  System: Physical device that performs an operation on.
Locating a Shift in the Mean of a Time Series Melvin J. Hinich Applied Research Laboratories University of Texas at Austin

The general linear model and Statistical Parametric Mapping
Signal processing.
Signals and Systems EE235 Lecture 26 Leo Lam ©
Engineering Analysis – Fall 2009
Chapter 5 Z Transform.
and Stefan Kiebel, Rik Henson, Andrew Holmes & J-B Poline
Signals and Systems Using MATLAB Luis F. Chaparro
Find 4 A + 2 B if {image} and {image} Select the correct answer.
Image Restoration and Denoising
Outline Derivatives and transforms of potential fields
Basic Image Processing
The general linear model and Statistical Parametric Mapping
Signals and Systems Lecture 3
9.5 Least-Squares Digital Filters
Homomorphic Speech Processing
Use power series to solve the differential equation. y ' = 7xy
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Juande Zornoza UW Madison
4. The Continuous time Fourier Transform
5a + 3 = 2a a = 2a a = 2a + 9 5a – 2a = 9 3a = 9 a = 9
Solving a System of Linear Equations
Presentation transcript:

Deconvolution of a Causal Signal Roger Barlow

EM simulations and tracking Bunch wake from bunch and wake Need to deconvolute

Problem Noise gives large high frequency components – meaningless Can remove somewhat with filter but – can we be clever?

Extra information We KNOW that the wake function is a ‘Causal Signal’: W(z)=0 for z<0 Can we tell the deconvolution procedure?

Fourier Transform Write series as (r goes from –N to N) d r =b 0 +  a k sin(kr  /N) +  b k cos(kr  /N) Or d=b 0 +S a + C b To have d r =0 for all (-N+1)<r<0 requires a =( 2 / N ) ( S b 0 + S C b) To have d -N =0 requires b 0 =b 1 -b 2 +b 3 -b 4 … For any b, the causality requirement uniquely specifies b 0 and a

Convolution and Deconvolution Unknown function with coeffts (a,b) Known smearing function ( ,  ) Convolved function (A,B) Where B 0 =2  b 0  0 B j =  (b j  j -a j  j ) A j =  (a j  j +b j  j ) d=B 0 +S A + C B = Qb Where Q is made out of known quantities Find b by minimising  2 =  (f r -d r ) 2 Gives equation linear in b – solve it!

Smoothing Result can still be spiky due to noise We know that the wake function should be ‘smooth’, i.e. not jump around from bin to bin Jumps are OK. Peaks are OK. 2 nd differential is ‘obviously’ wrong

Tikhonov Regularisation Add term d T T d to  2 where T is near- diagonal matrix. (Extra terms needed at r=0) is adjusted by hand to give reasonable results

Example…

Future More study needed to understand workings of process and tuning parameters Use to reconstitute delta wakes and apply in Merlin, etc