NASSP Masters 5003F - Computational Astronomy - 2009 Lecture 11 Single-dish spectra: baselines. Complex numbers refresher Fourier refresher Correlation.

Slides:



Advertisements
Similar presentations
Computer Vision Lecture 7: The Fourier Transform
Advertisements

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.
Lecture 15 Orthogonal Functions Fourier Series. LGA mean daily temperature time series is there a global warming signal?
Exponential Functions Logarithmic Functions
Lecture 11 (Was going to be –Time series –Fourier –Bayes but I haven’t finished these. So instead:) Radio astronomy fundamentals NASSP Masters 5003F -
Fourier Transform (Chapter 4)
Theoretical basis for data communication
Fourier Series Eng. Ahmed H. Abo absa. Slide number 2 Fourier Series & The Fourier Transform Fourier Series & The Fourier Transform What is the Fourier.
NASSP Masters 5003F - Computational Astronomy Lecture 13 Further with interferometry – Resolution and the field of view; Binning in frequency and.
ELEC 303 – Random Signals Lecture 20 – Random processes
Noise. Noise is like a weed. Just as a weed is a plant where you do not wish it to be, noise is a signal where you do not wish it to be. The noise signal.
Environmental Data Analysis with MatLab Lecture 17: Covariance and Autocorrelation.
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
Environmental Data Analysis with MatLab Lecture 24: Confidence Limits of Spectra; Bootstraps.
Slide 1EE100 Summer 2008Bharathwaj Muthuswamy EE100Su08 Lecture #11 (July 21 st 2008) Bureaucratic Stuff –Lecture videos should be up by tonight –HW #2:
Ninth Synthesis Imaging Summer School Socorro, June 15-22, 2004 Cross Correlators Walter Brisken.
Basic Image Processing January 26, 30 and February 1.
Binary Arithmetic Math For Computers.
Lock-in amplifiers
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Lecture for Week Spring.  Numbers can be represented in many ways. We are familiar with the decimal system since it is most widely used in everyday.
Image Processing Fourier Transform 1D Efficient Data Representation Discrete Fourier Transform - 1D Continuous Fourier Transform - 1D Examples.
CSC589 Introduction to Computer Vision Lecture 8
Fourier Transforms Section Kamen and Heck.
CSC589 Introduction to Computer Vision Lecture 7 Thinking in Frequency Bei Xiao.
storing data in k-space what the Fourier transform does spatial encoding k-space examples we will review:  How K-Space Works This is covered in the What.
ELE130 Electrical Engineering 1 Week 5 Module 3 AC (Alternating Current) Circuits.
The Story of Wavelets.
NASSP Masters 5003F - Computational Astronomy Lecture 9 – Radio Astronomy Fundamentals Source (randomly accelerating electrons) Noisy electro- magnetic.
INF380 - Proteomics-101 INF380 – Proteomics Chapter 10 – Spectral Comparison Spectral comparison means that an experimental spectrum is compared to theoretical.
A NMR pulse is often designed to detect a certain outcome (state) but often unwanted states are present. Thus, we need to device ways to select desired.
Week 7 Lecture 1+2 Digital Communications System Architecture + Signals basics.
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
Astronomical Data Analysis I
1“Principles & Applications of SAR” Instructor: Franz Meyer © 2009, University of Alaska ALL RIGHTS RESERVED Dr. Franz J Meyer Earth & Planetary Remote.
Basic Time Series Analyzing variable star data for the amateur astronomer.
NASSP Masters 5003F - Computational Astronomy Lecture 12: The beautiful theory of interferometry. First, some movies to illustrate the problem.
NASSP Masters 5003F - Computational Astronomy Lecture 14 Reprise: dirty beam, dirty image. Sensitivity Wide-band imaging Weighting –Uniform vs Natural.
NASSP Masters 5003F - Computational Astronomy Lecture 12 Complex numbers – an alternate view The Fourier transform Convolution, correlation, filtering.
Geology 5600/6600 Signal Analysis 16 Sep 2015 © A.R. Lowry 2015 Last time: A process is ergodic if time averages equal ensemble averages. Properties of.
NASSP Masters 5003F - Computational Astronomy Lecture 16 Further with interferometry – Digital correlation Earth-rotation synthesis and non-planar.
Fourier Transform.
Lecture 8 Source detection NASSP Masters 5003S - Computational Astronomy
Geology 6600/7600 Signal Analysis 21 Sep 2015 © A.R. Lowry 2015 Last time: The Cross-Power Spectrum relating two random processes x and y is given by:
Lens to interferometer Suppose the small boxes are very small, then the phase shift Introduced by the lens is constant across the box and the same on both.
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
Geology 6600/7600 Signal Analysis 23 Oct 2015
Environmental and Exploration Geophysics II tom.h.wilson
16722 Fr: how to beat the noise77+1 topics we will cover next... how to beat the noise, i.e.,... how to make the best possible measurements.
Frequency domain analysis and Fourier Transform
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
M.P. Rupen, Synthesis Imaging Summer School, 18 June Cross Correlators Michael P. Rupen NRAO/Socorro.
Fourier Transform and Spectra
Geology 6600/7600 Signal Analysis Last time: Linear Systems The Frequency Response or Transfer Function of a linear SISO system can be estimated as (Note.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Linear Filters and Edges Chapters 7 and 8
Lecture 1.26 Spectral analysis of periodic and non-periodic signals.
Lecture 15 Deconvolution CLEAN MEM Why does CLEAN work? Parallel CLEAN
Lecture 03: Linear Algebra
Digital Image Processing
EEL 3705 / 3705L Digital Logic Design
Basic Image Processing
9.4 Enhancing the SNR of Digitized Signals
Correlation, Energy Spectral Density and Power Spectral Density
8.6 Autocorrelation instrument, mathematical definition, and properties autocorrelation and Fourier transforms cosine and sine waves sum of cosines Johnson.
Intensity Transformation
Presentation transcript:

NASSP Masters 5003F - Computational Astronomy Lecture 11 Single-dish spectra: baselines. Complex numbers refresher Fourier refresher Correlation in general.

NASSP Masters 5003F - Computational Astronomy Spectra - baselines The spectrum of interest sits on top of a high ‘mesa’ due to system and background ‘temperature’ (ie noise). We usually want to subtract the mesa and just leave the spectrum. We could do that by alternating between on- and off-source observations, and subtracting the two: –But this needs 4 times as much observing time to reach the same SNR!

NASSP Masters 5003F - Computational Astronomy Spectra - baselines More commonly, the mesa is slowly varying compared to the spectrum, so one can fit some fairly smooth function to the mesa, then subtract it. The examples (for which this has already been done) show it is not always so simple! These show the infamous ‘Parkes ripple.’

NASSP Masters 5003F - Computational Astronomy The ‘Parkes ripple’ A weak Fabry-Perot resonance occurs between the dish and the feed. D ~ 26 m 2D = nλ = (n+1)(λ-Δλ) => Δ ν ~ 5.5 MHz.

NASSP Masters 5003F - Computational Astronomy Complex numbers REAL IMAGINARY

NASSP Masters 5003F - Computational Astronomy Complex numbers REAL IMAGINARY NONSENSE! There IS no √-1.

NASSP Masters 5003F - Computational Astronomy Let’s ‘forget’ about complex numbers for a bit......and talk about 2-component vectors instead. x y v x y θ

NASSP Masters 5003F - Computational Astronomy What can we do if we have two of them? x y v1v1 v2v2 We could define something like addition: There are lots of operations one could define, but only a few of them turn out to be interesting. v sum

NASSP Masters 5003F - Computational Astronomy The following has interesting properties: x y v1v1 v2v2 But it isn’t very like scalar multiplication except when all ys are zero. It’s fairly easy to show that: v prod θ2θ2 θ1θ1 θ prod =θ 1 + θ 2

NASSP Masters 5003F - Computational Astronomy These are just complex numbers! Note that: This, plus the angle-summing properties of the product, leads to the following typographical shorthand: Instead of the mysterious we should just note the simple identity

NASSP Masters 5003F - Computational Astronomy The lessons to learn: Complex numbers are just vectors. The ‘imaginary’ part is just as real as the ‘real’ part. Don’t be fooled by the fact that the same symbols ‘+’ and ‘x’ are used both for scalar addition/multiplication and for what turn out to be vector operations. This is a historical typographical laziness. –Be aware however that the notation I have used here, although (IMO) more sensible, is not standard. –So better go with the flow until you get to be a big shot, and stick with the silly x+iy notation.

NASSP Masters 5003F - Computational Astronomy fringes  point (delta function). Fourier refresher

NASSP Masters 5003F - Computational Astronomy higher spatial frequency  further from the origin. Fourier refresher

NASSP Masters 5003F - Computational Astronomy multiplication  convolution. Fourier refresher

NASSP Masters 5003F - Computational Astronomy gaussian  gaussian. Fourier refresher

NASSP Masters 5003F - Computational Astronomy Fourier refresher Hermitian  real.

NASSP Masters 5003F - Computational Astronomy Correlation in general. The (normalized) correlation (or cross- correlation) R 1,2 ( τ ) between two signals y 1 (t) and y 2 (t) is Its Fourier transform F {R} is ie the FT of y 1 times the conjugate of the FT of y 2.

NASSP Masters 5003F - Computational Astronomy This has many uses. We can calculate at τ =0. (Note, this single number R 1,2 (0) is sometimes written ie the expectation value of the product.) 1.Suppose y 1 and y 2 come from the same source, but different antennas. Suppose for simplicity that the signals are narrow-band. There is in general a phase difference of φ radians between signals gathered from different antennas. (In the next lecture I’ll show why.) In other words, y 1 (t) = |y| cos(2 πν t) y 2 (t) = |y| cos(2 πν t + φ)

NASSP Masters 5003F - Computational Astronomy R 1,2 (0) or is given by If however we have some way to shift the phase of y 2 by 90° (and such circuits exist), then and These are just the two components (‘real’ and ‘imaginary’ parts if you will) of a complex number |y| 2 e i φ which encodes the phase φ. Cross-corr for different antennas continued. y 2 (t) = |y| cos(2 πν t + φ – π/2 ) = |y| sin(2 πν t + φ)

NASSP Masters 5003F - Computational Astronomy Cross-corr to get polarization. 2.Suppose now that y 1 and y 2 come from the same antenna, but from feeds sensitive to opposite polarisations – say one sensitive to left-hand polarized, the other to RH. Let’s rename the signals y L and y R for clarity in this case. Then the coherency matrix of slide 6 lecture 10 is just (I haven’t got this entirely figured out to my own satisfaction yet.)

NASSP Masters 5003F - Computational Astronomy Cross-correlation at a range of τ : We can calculate R over a range of values of τ. The Fourier transform of this is a cross-power spectrum. –If y 1 =y 2 =y: the correlation is an autocorrelation (already mentioned in slide 14, lecture 3). Its FT is the power spectrum of y. –If y 1 and y 2 come from the same source, but different antennas: the FT is complex valued, and contains both spatial and spectral information.

NASSP Masters 5003F - Computational Astronomy The first thing necessary is to sample each continuous y at a number of times kΔt. Then R 1,2 (kΔt) is approximated by But, how many bits to use to store each y k value? Digital correlation y ykyk t k

NASSP Masters 5003F - Computational Astronomy Digital correlation 1 Surprisingly, 1 bit works pretty well! Multiplication becomes a boolean NOT(XOR). Allows us to use simple boolean logic circuits (cheap). SNR drops by about 2/ π though. 2 or 3 bits improves the SNR without too much increase in circuit cost y y k >0 k t