A SuperDARN Tutorial. Kile Baker

Similar documents
Notes: Pythagorean Triples

- a value calculated or derived from the data.

3 What You Should Know About Complex Numbers

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2013

Week 2 Techniques of Integration

ODEs. September 7, Consider the following system of two coupled first-order ordinary differential equations (ODEs): A =

2.3 Damping, phases and all that

Getting Started with Communications Engineering

Second-Order Homogeneous Linear Equations with Constant Coefficients

Lecture 14: Superposition & Time-Dependent Quantum States

13 Spherical Coordinates

Discrete Fourier Transform

Tutorial 4. Fast Fourier Transforms Phase factors runs around on the unit circle contains Wave forms

Partial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions.

Bayesian Gaussian / Linear Models. Read Sections and 3.3 in the text by Bishop

ANALOG AND DIGITAL SIGNAL PROCESSING ADSP - Chapter 8

Worksheet # 2: Higher Order Linear ODEs (SOLUTIONS)

Conceptual Explanations: Radicals

Exploratory Factor Analysis and Principal Component Analysis

CSC2515 Winter 2015 Introduction to Machine Learning. Lecture 2: Linear regression

Some Review Problems for Exam 2: Solutions

2. FUNCTIONS AND ALGEBRA

The free electron. EE 439 free electrons & scattering

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]

Chapter 7: Trigonometric Equations and Identities

Partial Fractions. (Do you see how to work it out? Substitute u = ax + b, so du = a dx.) For example, 1 dx = ln x 7 + C, x x (x 3)(x + 1) = a

SOLUTION GUIDE TO MATH GRE FORM GR9367

CS5540: Computational Techniques for Analyzing Clinical Data. Prof. Ramin Zabih (CS) Prof. Ashish Raj (Radiology)

Exploratory Factor Analysis and Principal Component Analysis

MA1131 Lecture 15 (2 & 3/12/2010) 77. dx dx v + udv dx. (uv) = v du dx dx + dx dx dx

Algebra Review. Finding Zeros (Roots) of Quadratics, Cubics, and Quartics. Kasten, Algebra 2. Algebra Review

Lesson 21 Not So Dramatic Quadratics

Utility of Correlation Functions

Math 1302 Notes 2. How many solutions? What type of solution in the real number system? What kind of equation is it?

1 What a Neural Network Computes

Line Broadening. φ(ν) = Γ/4π 2 (ν ν 0 ) 2 + (Γ/4π) 2, (3) where now Γ = γ +2ν col includes contributions from both natural broadening and collisions.

One important way that you can classify differential equations is as linear or nonlinear.

Practical Algebra. A Step-by-step Approach. Brought to you by Softmath, producers of Algebrator Software

CSC 2541: Bayesian Methods for Machine Learning

Part II. Fundamentals of X-ray Absorption Fine Structure: data analysis

Gregory's quadrature method

Signal Processing COS 323

Correlation, discrete Fourier transforms and the power spectral density

Differential Equations

The Derivative of a Function

Algebra Exam. Solutions and Grading Guide

Section 3.1 Quadratic Functions

V(t) = Total Power = Calculating the Power Spectral Density (PSD) in IDL. Thomas Ferree, Ph.D. August 23, 1999

AC analysis. EE 201 AC analysis 1

ACCUPLACER MATH 0311 OR MATH 0120

Descriptive Statistics (And a little bit on rounding and significant digits)

Tips and Tricks in Real Analysis

Algebra. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Assignment 16 Assigned Weds Oct 11

STEP Support Programme. STEP 2 Trigonometry Questions: Solutions

Massachusetts Institute of Technology

The trick is to multiply the numerator and denominator of the big fraction by the least common denominator of every little fraction.

Notes 11: OLS Theorems ECO 231W - Undergraduate Econometrics

NIT #7 CORE ALGE COMMON IALS

The Discrete Fourier Transform

1 1.27z z 2. 1 z H 2

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

UCSD SIO221c: (Gille) 1

BRIDGE CIRCUITS EXPERIMENT 5: DC AND AC BRIDGE CIRCUITS 10/2/13

FOURIER TRANSFORMS. f n = 1 N. ie. cyclic. dw = F k 2 = N 1. See Brault & White 1971, A&A, , for a tutorial introduction.

Math 1320, Section 10 Quiz IV Solutions 20 Points

Filter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany

5.1 Simplifying Rational Expressions

A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

The Gram-Schmidt Process

Other Optimization Techniques. Similar to steepest descent, but slightly different way of choosing direction of next step: x r +1 = x.

This is a Gaussian probability centered around m = 0 (the most probable and mean position is the origin) and the mean square displacement m 2 = n,or

Complex Numbers. 1 Introduction. 2 Imaginary Number. December 11, Multiplication of Imaginary Number

Introduction to Algorithms

1.4 Fourier Analysis. Random Data 17

ABE Math Review Package

1 Using standard errors when comparing estimated values

Complex Numbers. Math 3410 (University of Lethbridge) Spring / 8

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

Lecture 5: Random numbers and Monte Carlo (Numerical Recipes, Chapter 7) Motivations for generating random numbers

CS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works

How to Use Calculus Like a Physicist

Topic 4 Notes Jeremy Orloff

Physics 509: Error Propagation, and the Meaning of Error Bars. Scott Oser Lecture #10

Push-pull PDV analysis

System Identification & Parameter Estimation

1.1.1 Algebraic Operations

TIME-FREQUENCY ANALYSIS: TUTORIAL. Werner Kozek & Götz Pfander

Densità spettrale di clutter

28. Fourier transforms in optics, part 3

Chapter 10 Operators of the scalar Klein Gordon field. from my book: Understanding Relativistic Quantum Field Theory.

13.1 Convolution and Deconvolution Using the FFT

GEOPH 426/526: Signal Processing in Geophysics

1 GSW Sets of Systems

Math53: Ordinary Differential Equations Autumn 2004

Matrix-Exponentials. September 7, dx dt = ax. x(t) = e at x(0)

2. As we shall see, we choose to write in terms of σ x because ( X ) 2 = σ 2 x.

A polynomial expression is the addition or subtraction of many algebraic terms with positive integer powers.

Checking the Radioactive Decay Euler Algorithm

Time series models in the Frequency domain. The power spectrum, Spectral analysis

Transcription:

A SuperDARN Tutorial Kile Baker

Introduction n Multi-pulse Technique and ACFs Why ACFs? Bad and missing lags n Basic Theory of FITACF n Basic Fitting Technique Getting the Power and Width Getting the Velocity n Dealing with Noise n Error Estimation n Future Directions

t Consider a Double Pulse v n By comparing the relative phase of the signal received at time t 0 (signal received from first pulse) with phase received at time t 0 + t (signal from second pulse) we can determine by much much the irregularities have moved in time t.

How do we integrate over many pulse sequences? n Let S 11 be the complex signal received from pulse sequence #1, pulse 1. Let S 1 be the signal received from pulse sequence #1, pulse. S 11 A 1 exp(ij 1 ) S 1 A 1 exp(ij 1 + iwt ) n Let S 1 be the complex signal received from pulse sequence #, pulse 1. Let S be the signal received from pulse sequence #, pulse. S 1 A exp(ij ) S A exp(ij + iwt ) We can t simply sum the two because of the random phase.

Double Pulse ACF R * i ϕ 1,0 11 11 ( 1 1 iϕ S S A e )( A 1 1 e ) A 1 R * i( ϕ + τ ) iϕ 1,1 S1S11 ( A1 e )( A1 e 1) 1 A 1 e iτ Since the ACF is independent of the random phase we can sum ACFs from different pulse pairs to get a sensible result.

Range Aliasing n Suppose our two pulses are separated by time t n Suppose we also have two regions of backscatter and they are separated by a distance, dct / n Then, we will get a signal back from range # scattering pulse #1 at the same time as we get a signal from range #1 scattering pulse #.

S 11 Range Aliasing and ACFs Signal from pulse 1 A e 1 iϕ 1 1 From pulse range 1 1 i( ϕ + τ ) S A e + 1 From pulse 1 range B e 1 iϑ 1 S 1 A iϕ e i( ϕ + τ ) S A e + B e iϑ R 1,1 S 1 S * 11 A 1 e iτ + A B e 1 1 i( ϑ 1 ϕ 1 ) R,1 S S * 1 A e iτ + A B e i( ϑ ϕ ) Random phases in second terms will tend to cancel

t What about a triple pulse? t Obs. T0 Obs. Tt Obs. Tt

S 1 iϕ Ae i( ϕ+ τ ) S Ae + i( ϕ+ τ ) i( ϑ+ τ ) S Ae + Be + 3 Now have ways to calculate R 1 : * 1 S1 R S 1 1 * 1 3S R S Ce iξ Be iϑ This represents the general case. Any time we make a measurement we can be receiving signals from all three pulses if there is scatter coming from all possible ranges.

R 1 for triple pulse R 1 A e + * 1 3S R S i1τ iτ B e + ( ϕ ϑ + τ ) ( ϑ ϕ + τ + i 1 AB[ e i e ACe 1 τ i( ξ ϕ 1τ ) i( ξ ϑ ) + BCe No random phase ) ]

Three Pulse Pattern 3t t t S 3 S S 0

ACF from Multi-pulse Pattern R R R R * 0 S3S3 A +... i1τ e * 1 S3S A + * i1τ SS0 A e + * i31τ 3 S3S0 A e +.... Indicates terms with random phase.......

Repeated Pulse vs Multi- Pulse Pattern n n n Sequence of repeated pulses gives you all the different lags of an ACF - BUT you get range aliasing for every lag and it does NOT go away. Multi-pulse pattern solves the range aliasing problem - BUT You cannot have every lag UNLESS You have redundant lag pairs, which causes range aliasing again. It only solves the problem to the extent that terms with random phase go away as we average a large number together. We try to minimize redundancy, but this means we always have missing lags.

Bad Lags (1) Sample Transmit RF T/R Switch attenuators Section of a timing sequence

Bad lags () n General form of a lag in an ACF from a single pulse sequence is: R A exp(iwt ) + AB exp(random phase) n When we average ACFs from N pulse sequences R A exp(iwt ) + AB/ N If the power from range B is significantly greater than the power from range A, then we get contamination of the ACF from unwanted power at range B, even though the contamination is decreasing as 1/ N.

Bad Lags (3) n An ACF characterized by a single frequency should have its maximum value at lag-0 and each successive lag should have pwr(n) pwr(n-1). Allow for the possibility of a small increase due to the effect of noise. If condition is not met then identify the lag as a bad lag.» The presumption is that the lag has been affected by a burst of noise.» But it might really be due to a failure of the assumption that the ACF is characterized by a single frequency.

Finally we come to n Goose Bay Radar was built in Oct. 1983 n In 1984 Christian Hanuise developed the first code to attempt to determine the velocity by fitting all the lags of an ACF. n 1985 after Hanuise returned to France, improved versions of Hanuise s code were developed. n 1985 or 86? The first version of FITACF was produced. Improved flexibility Improved error estimation Introduction of estimation of spectral width

Basic Theory of FITACF n The ACF can be characterized by a single frequency n The ACF will decorrelate as the lag increases. We will model the decorrelation two different ways: Power ~ exp(-l t) ) Log(pwr pwr) ) decreases linearly Power ~ exp(-s t ) Log(pwr pwr) ) decreases quadratically n Convolution Theorem: Fourier transform of an ACF is the power spectrum.

Example of a perfect ACF ACF True phase 1.5 1 0.5 0-0.5 lag -1 1 3 5 7 Lag 9 11 13 15 Real Imag 18 16 14 1 10 8 6 4 0 0 1 3 4 5 6 7 8 9 10 11 1 13 14 15 16 log pwr Measured phase 0-0. -0.4-0.6-0.8-1 -1. -1.4-1.6 1 3 4 5 6 7 8 9 10 11 1 13 14 15 16 17 Lag 4 3 1 0-1 - -3-4 0 5 10 15 0 Lag

Why bother with the ACF? Why not just work with the power spectrum? n n n Getting the velocity (frequency) is difficult in the power spectrum. Unless the true frequency is an exact value of the discrete Fourier transform, you have leakage from the central peak to other points in the FFT. The leakage problem also makes it difficult to accurately determine the spectral width from the spectrum. We always have missing lags and often have bad lags. This complicates the calculation of the power spectrum from the ACF and makes interpretation of the power spectrum more difficult.

ACF Model R Ae it λt e R Ae it σ e t Lambda Model Sigma Model Power R Ae λt R Ae σ t tan( t ) Im( R) Re( R) NOTE: The Power and the Phase are completely independent

Fitting Technique n Conceptually things are now straightforward. Take Log(power) and do a Least Squares Fit» Log(pwr pwr) ) A l t for Lambda Model» Log(pwr pwr) ) A s t for the Sigma Model Calculate true phase at each lag and do a Least Squares FIT with condition that phase at lag-0 must be 0.» j wtw n Bad or missing lags in the ACF are simply ignored in the fitting process. n No leakage problems like there are when dealing with the power spectrum.

The lambda power spectrum The lambda power spectrum dt e e e R t i t t i λ 0 ) ( The real part is an even function while the imaginary part is an odd function. The imaginary part therefore integrates to 0 and for the real part we can write: + + ) ( 1 Re Re ) ( 0 0 ) ( 0 λ λ i dt e R t i

We now multiply the numerator and denominator by the complex conjugate of the denominator and then take the real part of the result. This gives us the power spectrum as a function of w and l. λ R( ) λ + ( ) 0 This is a Lorentzian power spectrum with a maximum at w 0. To determine the full width at half-max, simply solve for the value of w that gives R(w) 1/l. 0 ± 1 λ

We do the same thing to get the spectrum and spectral width for the Gaussian decay model. To integrate this we look for a quadratic such that This gives us dt e R t i t + ] ) ( [ 0 ) ( σ k t i t q t + + ) ( ] [ 0 σ σ 0 0 4 ) (, ) ( σ σ q i q

We can then write the power spectrum as: Then perform the variable substitution: x st-q, dx sdt Substituting in the value of q we then have dt e e R q q t ) ( ) ( σ π σ σ ) ( q x q e dx e e R 0 4 ) ( ) ( σ σ π e R

Getting Physical Parameters from l, s R R ( Power Spectrum ) λ + ( λ 0 ( 0 ) π ( ) e 4σ σ ) Full width at ½ max W l l W σ 4σ log()

Converting from Frequency to velocity The relation between the Doppler shift and the velocity is usually given by: f v f c However, for a Doppler shift produced by a reflection from a moving target, the effective velocity is twice the true velocity so we have: f v Now, w is the angular frequency f c of the Doppler shift, so w p Df, and we then have (next page)

Velocity and width in terms of velocity v c 4πf Where v is velocity in m/s, c is speed of light, f is transmitter frequency in Hz, w is radial Doppler shift frequency from the phase fit. The same conversion factor is used to convert the spectral width from frequency to velocity. W λ 4 c π f ( λ ) W σ 4 c π f (4 σ log())

Complications n Should we use lags where the power in the ACF is less than the noise level? NO. n What IS the noise level? n Is the error associated with the measurement of each lag the same? If not, how do we weight the points when doing the fit? n How do we determine the true phase from the measured phase?

Determining the True Phase n Measured phase is between + p and p n In the ACF example it was obvious where the jumps in phase occurred but When we add noise it s not so obvious When we don t have all the lags it s not so obvious n We have to assume that the phase for lag-1 is between p and +p +. n Start with an initial guess for w and do the fit one point at a time. Predict phase and then adjust.

Guess, Predict, Adjust n How do we make the initial guess? The basic assumption is that between neighboring lags (e.g. lag-4 to lag-5) the phase change must lie between p and +p p. Find all good 1-lag pairs and calculate the average phase difference. Then w 0 <Dj< >/t. n Go lag by lag: Predict the true phase at lag-n from w n-1 (nt ) Compare the predicted phase with j meas + kp» Adjust k so that the result lies with +/- p of the predicted value. This is the true value of the phase. Use the new true value of j to calculate w n (least squares fit).

Check and Iterate n If you have a reasonably good guess for the initial value of w,, you are not terribly bothered by missing or bad lags. This is because you are allowed to jump the phase up (down) by more than one multiple of p. n Check the final result for w by redoing the fit using that value of w as the initial guess. Iterate until you get a new value of w that is the same as the previous value. Usually this only takes one pass.

Dealing with Noise n Types of noise Random cosmic noise» We have never really investigated the statistical properties of this cosmic noise. This would be really good to do! Bursts from other transmitters CW noise from other transmitters n Is there a noise ACF that can be removed? If we find CW noise from other transmitter it may be possible to (partially) remove the signal n Noise and decorrelation n Weighting the fits

Cosmic Noise n Things that would be nice to know about the cosmic noise (but we don t) Does the power truly behave like a random variable? If so, what is it s distribution? Does the measured phase of the noise behave like a random variable? What is it s distribution? Is there a clear diurnal variation in the noise? Can the radars be used as oblique riometers by measuring the noise?

Determining the noise characteristics n n During Clear Frequency Search we determine a noise level characteristic of the clearest frequency during the brief period of the search. That value is saved in the NOISE parameter in the parameter block. In FITACF Find the average lag-0 power for the 10 lowest power ranges. We call these 10 lowest power ranges the noise range gates. This value is saved in the parameter skynoise skynoise in the FIT files. Find the average noise from all lags (not just lag-0) for the noise range gates. This value is called the noise_pwr pwr and is used in the fitting process.» Compare this value and its variance to the skynoise to see if there appears to be a coherent signal present in the noise range gates. If so, we assume that a CW transmitter has contaminated all range gates.» If there is a coherent noise signal, calculate the average ACF for all noise range gates and then subtract that noise ACF from each ACF.» If you subtract a noise ACF, recalculate all the noise parameters.

Noise and Decorrelation n n n If you could pick out the true ACF from a single pulse sequence, there would hardly be any decorrelation.. The decorrelation comes about because parameters such as frequency and spectral width have some random character and change from pulse sequence to pulse sequence. The ideal ACF is only achieved in the limit of a large number of pulse sequences in the average. When looking at the Power fit, there is an artificial noise level determined by the lag-0 power, the random characteristics of frequency and spectral width, and the number of pulse sequences. This is often higher than the true noise level. We may not use the same number of lags in the phase fit and the power fit.

Weighting the Phase Fit n You can show that the error in the phase measurement at any given lag is proportional to Noise/Signal. This implies that the phase fit should be weighted by the power at each lag (that is, the signal strength at that lag). n The error in the power at any given lag is constant (proportional to the Noise level), BUT when we take the log of the power you again find that the error is proportional to N/S (assuming S>>N). So again, the power fit should be weighted by the power at each lag. NOTE: the weighting is by the actual power in the lag, NOT the log of the power.

Error Estimates n The method for estimating the error in fitted parameters from a least-squares fit is well established and can be found in many books. The error estimate for a -parameter linear fit (such as the power fit) is obtained from an overall estimate of the error in the fit and the covariance matrix. n Very straightforward for the power fit n We have a complication, however, with the phase fit.

Error in the phase fit (velocity error) n If we had no p ambiguities the process would be just as straightforward as in the power fit. n Suppose when we calculate our initial guess for w we find that the variance in the 1-lag phase differences is large. It is then, very likely that we will have a small value of w. If the predicted value at each lag for the phase always lies within +/- p, we will get a small velocity with a somewhat large error (comparable to the velocity estimate itself) but the true velocity may be a much larger value.

Initial Guess for Initial Guess for w M k k M k k k W W 1 1 0 τ ϕ M k k M k k k W W 1 1 0 τ ϕ ( ) ( ) 0 0 0

w n n τ ( ) n k ϕ k W W k k k ( k ) Wk ϕk n τ W k Value of w using all good lags. Weighted by Power at each lag Error estimate for w based solely on the phase fit.

Final estimate of frequency error n We now have two different errors related to the frequency. Error estimate on w 0, the initial guess Error estimate on w n, from the phase fit n Combine the two using the geometric mean 0 ( )( ) n

Is there a better way? n n n If we have a good initial guess then that implies we are putting the p s in the right place. And that means we should be using the error estimate from the phase fit and not the geometric mean of the error in the initial guess and the phase fit error. Suppose we re-did the fitting process but used as our initial guess w 0 + Dw 0? (and similarly for w 0 - Dw 0 ). If, after going through this process we ended up with the same final value of w then our initial guess was right and we should use the error estimate from the phase fit. If they aren t the same, then let Dw w + - w -. The downside of this is that we triple (at least) the amount of computer time needed for the phase fit. Recommendation: Some one should try this using real data from DAT files.

Future? n Dealing with mixed frequencies (particularly ionospheric scatter + ground scatter) MUSIC? (Andre and Villain) Subtract mean value of Re(ACF)? (only for ground scatter, causes errors when ionospheric velocity is low, could mess up spectrum) Fourier transform?» Identify ranges that have the problem» Remove unwanted peak(s)» Transform back Can we do this reliably? Unwanted by whom?

More for the future n Improved recognition of ground scatter FITACF has changed a lot since our definition of ground scatter was made. n FITACF treats each range completely independently? Could we improve things by including information from neighboring ranges? What about neighboring beams? Would we have to analyze data differently depending on which direction the radar was oriented? If we try to use information from neighboring beams, how do we handle non-standard scan modes?

Dealing with raw data? n Currently the only way we deal with raw data is by calculating ACFs. Shouldn t we investigate alternate approaches? n We should have some truly RAW data in other words, the actual samples from the A-D converter, totally unprocessed.

Conclusion It s been a good approach for many years, but that doesn t mean improvements can t be made. But improvements should be done very carefully and tested thoroughly before they are implemented.