Choosing parameters for frequency domain forward modelling We will be running frequency domain software – part of the waveform tomography package At this.

Slides:



Advertisements
Similar presentations
Michael Phipps Vallary S. Bhopatkar
Advertisements

Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
3-D Computational Vision CSc Image Processing II - Fourier Transform.
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
The Discrete Fourier Transform. The spectrum of a sampled function is given by where –  or 0 .
Fourier Theory in Seismic Processing
Sampling theory Fourier theory made easy
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Geol 491: Spectral Analysis
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
SIMS-201 Characteristics of Audio Signals Sampling of Audio Signals Introduction to Audio Information.
Chapter 8: The Discrete Fourier Transform
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
Sep 15, 2005CS477: Analog and Digital Communications1 Modulation and Sampling Analog and Digital Communications Autumn
Course 2007-Supplement Part 11 NTSC (1) NTSC: 2:1 interlaced, 525 lines per frame, 60 fields per second, and 4:3 aspect ratio horizontal sweep frequency,
Sampling, Reconstruction, and Elementary Digital Filters R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
Short Time Fourier Transform (STFT)
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Image Fourier Transform Faisal Farooq Q: How many signal processing engineers does it take to change a light bulb? A: Three. One to Fourier transform the.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
Time and Frequency Representation
Unit 7 Fourier, DFT, and FFT 1. Time and Frequency Representation The most common representation of signals and waveforms is in the time domain Most signal.
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
First semester King Saud University College of Applied studies and Community Service 1301CT.
Sampling of Continuous Time Signal Section
Fourier Theory in Seismic Processing (From Liner and Ikelle and Amundsen) Temporal aliasing Spatial aliasing.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Frequency Domain Representation of Sinusoids: Continuous Time Consider a sinusoid in continuous time: Frequency Domain Representation: magnitude phase.
Chapter 4: Sampling of Continuous-Time Signals
1 Today's lecture −Concept of Aliasing −Spectrum for Discrete Time Domain −Over-Sampling and Under-Sampling −Aliasing −Folding −Ideal Reconstruction −D-to-A.
ENGI 4559 Signal Processing for Software Engineers Dr. Richard Khoury Fall 2009.
Optical Transfer Function
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Numerical Methods Discrete Fourier Transform Part: Discrete Fourier Transform
University of Ioannina - Department of Computer Science Filtering in the Frequency Domain (Fundamentals) Digital Image Processing Christophoros Nikou
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
Where we’re going Speed, Storage Issues Frequency Space.
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.
Basics of Signal Processing. SIGNALSOURCE RECEIVER describe waves in terms of their significant features understand the way the waves originate effect.
Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.
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|
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
Fundamentals of Digital Signal Processing. Fourier Transform of continuous time signals with t in sec and F in Hz (1/sec). Examples:
Judith C. Brown Journal of the Acoustical Society of America,1991 Jain-De,Lee.
Fourier Series Fourier Transform Discrete Fourier Transform ISAT 300 Instrumentation and Measurement Spring 2000.
Inverse DFT. Frequency to time domain Sometimes calculations are easier in the frequency domain then later convert the results back to the time domain.
1 NMR Data Processing FT Free Induction Decay (FID) Time DomainFrequency Domain Intensity decreases with time. Why?
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
2D Sampling Goal: Represent a 2D function by a finite set of points.
Professor A G Constantinides 1 Discrete Fourier Transforms Consider finite duration signal Its z-tranform is Evaluate at points on z-plane as We can evaluate.
2D Fourier Transform.
The Fourier series handles steady-state sinusoidal functions, but does not have the ability to model transients effectively. As we have seen, the Fourier.
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
The Fourier Transform.
Lecture 1.4. Sampling. Kotelnikov-Nyquist Theorem.
MECH 373 Instrumentation and Measurements
Lecture Signals with limited frequency range
Fourier Analyses Time series Sampling interval Total period
I. Previously on IET.
Example I: F.T. Integration Property
Discrete Fourier Transform
Discrete Fourier Transform
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Geol 491: Spectral Analysis
Finding the Popular Frequency!
Presentation transcript:

Choosing parameters for frequency domain forward modelling We will be running frequency domain software – part of the waveform tomography package At this stage we only want to demonstrate forward modelling Before we use the software, we will review the basic design steps for frequency domain finite differences Manual pages contain more detailed information

Time domain wraparound (aliasing) in the time domain, if we undersample (use too large a Δt ) then high frequencies “wrap” around the frequency axis and alias as low frequencies in the frequency domain, if we don’t sample adequately (i.e., use too large a Δf ), then “time wraparound”, or “time aliasing” occurs we choose Δf=1/T max – if T max is large (due to high order multiples, etc), then unless you use very small Δf you will always be undersampling

Time domain wraparound (aliasing)

due to periodicity in any discrete Fourier series if f(t) is non-zero for time greater than Tmax, the late time samples will alias at early time prevent this by using a complex-valued frequency, i.e., we compute differencing operators must use complex frequencies

Time domain wraparound (aliasing) F(ω ' ) is just the Fourier transform of f(t)e -t/τ thus the time function has effectively been multiplied by a decaying exponential to recover the desired function, we multiply by e t/τ : the unaliased components (n=0) are unaffected, the aliased components are suppressed

Time domain wraparound (aliasing)