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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Low pass filtering<br />

& Step noise<br />

Obviously these phenomena depend on both the resampling frequency <strong>and</strong><br />

the time between true samples. While the former is a matter of choice, the<br />

latter must be calculated from the probability distribution of seeding particle<br />

arrivals as discussed in section 0 below.<br />

With respect to the calculation of spectra, [Adrian & Yao (1987)] show the<br />

presence of two other phenomena associated with the sample <strong>and</strong> hold<br />

approach:<br />

• The sample <strong>and</strong> hold process acts like a first-order low pass filter<br />

attenuating the spectrum at frequencies above &n 2π .<br />

• The sample <strong>and</strong> hold process introduce white noise, so-called step noise,<br />

over the entire frequency range of the calculated spectrum.<br />

The low pass filtering is caused by the information loss that occurs during<br />

the hold periods, <strong>and</strong> the step noise is created by the r<strong>and</strong>om steps that occur<br />

when new samples arrive. Note that according to [Adrian & Yao (1987)] the<br />

step noise is itself low pass filtered above f= n&2π<br />

.<br />

Resampling frequency<br />

Poisson process The homogeneous, but r<strong>and</strong>om distribution of seeding particles in the fluid<br />

results in particle arrivals following a Poisson process:<br />

( , ∆ )<br />

Pk t<br />

=<br />

( n& t)<br />

k<br />

∆ −n&<br />

∆t<br />

k!<br />

e<br />

(7-72)<br />

-describing the probability P of k particle arrivals within the period ∆t, when<br />

the average datarate is &n particles per second. Actually the datarate &n is not<br />

constant, but depends on the instantaneous velocity (see velocity biasing on<br />

page 7-99), but except for highly turbulent flows (7-72) will be a good<br />

approximation to the true probability distribution.<br />

With the resampling frequency chosen as c times the average datarate of the<br />

original samples, we get: ∆t= 1 cn& ⇔ n& ∆t=<br />

1 c<br />

( )<br />

Inserting this in (7-72) we can calculate the probability of true samples<br />

(particle arrivals) during each of the resampling time slots of duration ∆t:<br />

( 0)<br />

P e<br />

1 c<br />

= −<br />

( > 1) = 1− ( 0) − ( 1) = 1− ( 1+ 1 )<br />

(No new particle arrivals)<br />

−1<br />

c<br />

P P P c e (Several new particle arrivals)<br />

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

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

Saved successfully!

Ooh no, something went wrong!