2.2 : Simple Fringe Fitting

2.2.0: Constant Residual Delay

When we calculate the phase center delay to minimize the geometric delay between 2 stations, there will always be an error compare to the true delay :

If we treat this residual delay as constant, let's see its effect and how to find its value:


Now suppose we are inside the FX correlator.

The F step:

Start from the baseband signal for station 1:

and Fourier transform of is:

As for station 2's signal. After inserting calculated phase center time advancement and removing the fringe rotation, we have:

Now we make a new signal:

And we take the Fourier transform of :

Assuming is constant and using the time-shifting property:

The X step:

Now multiply the 2 Fourier transformed signals:

Looking at the output of the correlator, we have a linear phase term :

that will mess up the desired result. so we need to find and remove this



Continuous-time Discrete-time :

The visibility is in continuous-time but FX operates and output discrete time , let's find out what is :

Suppose the sampling rate is , and we are doing points FFT, then the visibility is with


Now for a particular :

its center frequency is:

and its channel bandwidth is:

and is:

As you can see because of the sinc function, if your is big, can be squashed to 0.



Finding :

We take FT of , think of the FT here as a weighted sum.

With sinc function, we can easily find by finding peak value of :

Continuous-time Discrete-time :

We take FFT of , think of the FFT here as a weighted sum.

Again with sinc function, we can easily find by finding peak value of :

FX correlator output a grid : , so we will take a total of FFTs that integrate over frequency index and produce numbers of . Meaning we will have a for each row of .




2.2.1: Linear Residual Delay
The F step:

Previously when trying to find residual delay, we assume is constant, which is false because of earth's rotation. We can approximate as a linear function of time:

so becomes:

plug in for :

Now we take the Fourier transform of .

Remember that the fourier transform we are taking is time dependent. i.e., we take fourier transform over short time intervals centered at time , this technique is referred as Short-Time Fourier Transform.




The X step:

So now the is:


Continuous-time Discrete-time :

The visibility is in continuous-time but FX operates and output discrete time , let's find out what is :

Suppose the sampling rate is , and we are doing points FFT, then the visibility is with


Now for a particular and :

its center frequency is:

and its channel bandwidth is:

and its center time is:

and is:

As you can see because of the sinc function, if your or is big, can be squashed to 0.




Finding :

We take 2D-FT of , again, think of the FTs here as weighted sum.

With 2 sinc functions, we can easily find by finding peak value of :


Continuous-time Discrete-time :

We take 2D-FFT of , think of the FFT here as a weighted sum.

Using the properties of sinc function, we can easily find by finding peak value of :

FX correlator output a grid : , so we will take a total of FFTs. And in this 2D-FFT grid , the pair that gives the maximum value will be our approximated values.