05.07.2013 Views

BSA Flow Software Installation and User's Guide - CSI

BSA Flow Software Installation and User's Guide - CSI

BSA Flow Software Installation and User's Guide - CSI

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Rxy(τ)<br />

True correlation<br />

Circular contribution<br />

T<br />

Figure 7-92: Separating true <strong>and</strong> circular correlation using zero padding.<br />

With zero padding the correlation function can thus be estimated with lag<br />

times as big as τ=T. For large lags you should remember however that<br />

within the original data set used for the calculation only a very limited<br />

number of samples have been available with this long time between them.<br />

Consequently the correlations estimated at large lag times may not be very<br />

accurate.<br />

Improved resolution Apart from removing cyclic noise, zero padding has the benefit of improving<br />

the frequency resolution of the calculated spectra. By adding a number of<br />

zeroes after your true samples, the sampling period T is artificially increased.<br />

Without zero padding the frequency resolution is ∆f=1/T, but increasing the<br />

sampling period to 2T will change the resolution to ∆f=1/2T. In principle<br />

more zeroes can be added to improve the resolution further, but since no new<br />

information is really added, you should think of this technique as nothing but<br />

an intelligent form of interpolation between raw estimates.<br />

Calculation speed Since the amount of data going into the FFT-analysis increases, zero padding<br />

will obviously slow down the calculations. With the number of samples<br />

included in a typical LDA-experiment, the FFT-approach will however<br />

remain superior to a direct calculation of correlations <strong>and</strong> spectra.<br />

Filters<br />

As explained in section 0, the “raw” spectrum estimates may deviate<br />

considerably from the true value. Dividing the resampled data into blocks to<br />

perform ensemble smoothing will improve this, <strong>and</strong> further smoothing of the<br />

calculated spectrum can be achieved by averaging neighboring spectrum<br />

estimates. In practice this so-called frequency smoothing is implemented as<br />

filter-functions, sometimes referred to as lag-windows due to the way they<br />

are implemented. Frequency-smoothing could be programmed as a sweep<br />

over the frequency-range for which estimates have been calculated, but again<br />

FFT-algorithms are used to increase speed by swapping back <strong>and</strong> forth<br />

between frequency- <strong>and</strong> time-domain:<br />

1. Switch to time-domain performing a Fourier-transform of the<br />

spectrum.<br />

2. Apply a so-called Lag-window to the resulting correlation estimate.<br />

3. Fourier-transform back to frequency-domain.<br />

The lag-window is implemented by multiplying each correlation estimate<br />

with a factor wL(τ) depending on the lag-time τ of the estimate itself.<br />

7-136 <strong>BSA</strong> <strong>Flow</strong> <strong>Software</strong>: Reference guide<br />

2T<br />

τ

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!