Error Function Filter Robert L. Coldwell University of Florida LSC August 2005 Reducing the number of data points LIGO-G050352-00-Z.

Slides:



Advertisements
Similar presentations
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Advertisements

Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
Fourier Transform (Chapter 4)
Environmental Data Analysis with MatLab Lecture 11: Lessons Learned from the Fourier Transform.
Review of Frequency Domain
Chapter 8: The Discrete Fourier Transform
Sampling theorem, I  Suppose function h(t) is sampled at evenly spaced intervals in time; – 1/  : Sampling rate  For any sampling interval , there.
Lecture 14: Laplace Transform Properties
Lecture 9: Fourier Transform Properties and Examples
Continuous-Time Fourier Methods
Discrete-Time Convolution Linear Systems and Signals Lecture 8 Spring 2008.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
Sampling of Continuous-Time Signals
Systems: Definition Filter
Basics of Signal Processing. frequency = 1/T  speed of sound × T, where T is a period sine wave period (frequency) amplitude phase.
Discrete-Time Fourier Series
Chapter 4: Sampling of Continuous-Time Signals
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
Discrete-Time and System (A Review)
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
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 Jamshid Shanbehzadeh.
1 Orthonormal Wavelets with Simple Closed-Form Expressions G. G. Walter and J. Zhang IEEE Trans. Signal Processing, vol. 46, No. 8, August 王隆仁.
Fourier Series Summary (From Salivahanan et al, 2002)
Digital Signal Processing
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
Image Enhancement in the Frequency Domain Spring 2006, Jen-Chang Liu.
Lecture 9 Fourier Transforms Remember homework 1 for submission 31/10/08 Remember Phils Problems and your notes.
ECE 4710: Lecture #6 1 Bandlimited Signals  Bandlimited waveforms have non-zero spectral components only within a finite frequency range  Waveform is.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Hasliza A Samsuddin EKT.
Vibrationdata 1 Unit 5 The Fourier Transform. Vibrationdata 2 Courtesy of Professor Alan M. Nathan, University of Illinois at Urbana-Champaign.
Integral Transform Method CHAPTER 15. Ch15_2 Contents  15.1 Error Function 15.1 Error Function  15.2Applications of the Laplace Transform 15.2Applications.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Department of Computer Eng. Sharif University of Technology Discrete-time signal processing Chapter 3: THE Z-TRANSFORM Content and Figures are from Discrete-Time.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Z TRANSFORM AND DFT Z Transform
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Digital Signal Processing
Fourier Transform.
Sampling of Continuous-Time Signals Quote of the Day Optimist: "The glass is half full." Pessimist: "The glass is half empty." Engineer: "That glass is.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
Fourier Representation of Signals and LTI Systems.
2D Fourier Transform.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
1 Fourier Representation of Signals and LTI Systems. CHAPTER 3 School of Computer and Communication Engineering, UniMAP Amir Razif B. Jamil Abdullah EKT.
EC1358 – DIGITAL SIGNAL PROCESSING
Fourier Transform and Spectra
The Fourier Transform.
Math for CS Fourier Transforms
 Signal: Physical quantity that varies with time, space or any other independent variable/s.  System: Physical device that performs an operation on.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Discrete Time Signal Processing Chu-Song Chen (陳祝嵩) Institute of Information Science Academia Sinica 中央研究院 資訊科學研究所.
Chapter 4 Discrete-Time Signals and transform
Review of DSP.
Lecture 7: Z-Transform Remember the Laplace transform? This is the same thing but for discrete-time signals! Definition: z is a complex variable: imaginary.
Digital Signal Processing Lecture 4 DTFT
Image Enhancement in the
Advanced Digital Signal Processing
Signals and Systems EE235 Leo Lam ©
8.6 Autocorrelation instrument, mathematical definition, and properties autocorrelation and Fourier transforms cosine and sine waves sum of cosines Johnson.
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Review of DSP.
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

Error Function Filter Robert L. Coldwell University of Florida LSC August 2005 Reducing the number of data points LIGO-G Z

Introduction Discrete Fourier Transform Definitions The Nyquist Theorem Ideal Filter/Error Function Filter Pulsar numbers Dramatically reducing the number of needed data points

DFT definitions

Convolution Frequency Time

Nyquist Theorem 1 Define 1 Loosely based on Alan V. Oppenheimer, Ronald W. Schafer with John R. Buck, Discrete-time Signal Processing – Prentice Hall Signal Processing Series – Alan V. Oppenheimer, editor, Second edition 1999 – first 1989

Data versus time

The function s(t) Note upper limit of N/2-1 This sum is N for m=kN, zero otherwise

This is set up for convolution

Nyquist theorem in frequency Inserting S(f) D samp is periodic by construction

Back Transform The back transform over all N  points is not wanted since it will produce the spiky function transformed forward. Define an ideal filter as

With appropriate restrictions This form is a setup for convolution The sum is over M as in N  =M  N But in any case define

Using the convolution theorem The Nyquist Theorem in time The time t m is any time, the time t k is for a data point. This is where the dramatic reduction in data points needed takes place.

Ideal Filter/Error Function Filter The ideal f 0 to f 1 filter H is not required to extend from -1/2  t to 1/2  t

Details of the filter near the two ends

Ideal filter transformation A few steps are skipped involving 1/(1-exp(-j2  1/T)). All steps are rigorous for the sums The fact that this sum is to N  includes the extra point at N/2 The extra term ↑ Subrtacting ½ the first term ↑

Ideal h(t,f 0,f 1 ) The second term as T   

Error function filter Let x=(f-f 0 )/w, then for f<f 0 And for f > f 0 Equivalent erfs allow overlapping regions to exactly sum to 1

H errf (f,f 0,f 1 ) The f 0 = 59 Hz, f 1 =61 Hz w = Hz.

Error function filter/ ideal filter  f = 1/7 sec. w=  f

h errf (t,f 0,f 1,w) Approximation of the integral result requires integration by parts This now differs from the ideal filter only by the exponential factor. In a reversal of the Nyquist theorem, the correctly periodic version is The exp(-(  wt) 2 ) term makes the sum rapidly convergent

Limiting the convolution range For |t-tk| > 6/(  w), the exponential part of h(t,f0,f1,w) is less then This leads to a definition k min (t)=(t-6/(  w))/  t such that Even for infinite T, this sum is finite. For t such that k min (t) > -N/2 and k max (t)<N/2 d H (t) does not depend on T

|h(t,f 0,f 1,w)| Time in seconds.

h(t,f 0,f 1,w) Small region of time showing the oscillations in real and imaginary h(t) The oscillations can be used to shift the frequency. Note that h can be calculated once, then shifted and re-used over and over, the sine and cosines need not be recalculated. Convolution reduces to a single set of multiplications and sums for each output data point.

Splitting the Space

Second region The convolution with h(t,f 1,f 2,w) produces complex data. The imaginary part is shown above.

Second region in frequency Real part of transform of convoluted data between 32/Time and 50/time using data points

Second region in frequency Real part of transform of convoluted data between 32/Time and 50/time using data points Ignoring the 10, the data reduction factor is

Pulsar numbers The size of F was found by Cornish and Larson to be ~ 0.01 Hz[i], Thus there needs to be an output point every 10 seconds to follow the Doppler motion of B which has a quadrupole frequency of  0.01 Hz.[i] [i] Neil J. Cornish and Shane L. Larson, “LISA data analysis: Doppler demodulation”, Class. Quantum Grav. 20 (2003) S163-S170 – online at stacks.iop.org/CQG/20/S163 stacks.iop.org/CQG/20/S163 Data reduction factor ~ 16384/0.02 =

|h(t)| for 0.02 width signal The time range on this plot is from –500 seconds to seconds.

Omissions If the convolution went straight from the input data, noise in the region would in principle rise as T 1/2 while the signal would rise as T. The noise is systematic and has many properties that identify it, an intermediate step in which known sources of frequencies that overlap the pulsar frequency are examined and removed will be investigated. The phase will need to be monitored, if it drifts the signal will cancel to zero. – possibly the violin modes will help.