Fourier transforms: Definition : refer to notes Property and its proof refer to this link http://fourier.eng.hmc.edu/e101/lectures/hand out3/node1.

html or Properties of Fourier Transform Ruye Wang 2009-07-05

 SAMPLING RATE The sampling rate, sample rate, or sampling frequency (fs ) defines the number of samples per unit of time (usually seconds) taken from a continuous signal to make a discrete signal. For time-domain signals, the unit for sampling rate is hertz (inverse seconds, 1/s, s1), sometimes noted as Sa/s or S/s (samples per second). The reciprocal of the sampling frequency is the sampling period orsampling interval, which is the time between samples Sampling theorem The NyquistShannon sampling theorem states that perfect reconstruction of a signal is possible when the sampling frequency is greater than twice the maximum frequency of the signal being sampled, or equivalently, when the Nyquist frequency (half the sample rate) exceeds the highest frequency of the signal being sampled. If lower sampling rates are used, the original signal's information may not be completely recoverable from the sampled signal. For example, if a signal has an upper band limit of 100 Hz, a sampling frequency greater than 200 Hz will avoid aliasing and would theoretically allow perfect reconstruction. Dirichlet conditions FT: the Dirichlet conditions are sufficient conditions for a real-valued, periodic function f(x) to be equal to the sum of its Fourier series at each point where f iscontinuous. Moreover, the behavior of the Fourier series at points of discontinuity is determined as well (it is the midpoint of the values of the discontinuity). These conditions are named after Peter Gustav Lejeune Dirichlet.

The conditions are: f(x) must be absolutely integrable over a period. f(x) must have a finite number of extrema in any given interval, i.e. there must be a finite number of maxima and minima in the interval. f(x) must have a finite number of discontinuities in any given interval, however the discontinuity cannot be infinite. f(x) must be bounded The last three conditions are satisfied if f is a function of bounded variation over a period.

The power spectrum is symmetric about the Nyquist frequency as the following illustration shows

CORRELATION in VI 1. 1D Cross Correlation (DBL)

1D Cross Correlation (CDB)

2D cross correlation (CDB) same as DBL but here input is complex value

Cross Correlation Details 1D Cross Correlation The cross correlation Rxy(t) of the sequences x(t) and y(t) is defined by the following equation:

where the symbol denotes correlation. The discrete implementation of the Cross Correlation VI is as follows. Let h represent a sequence whose indexing can be negative, let N be the number of elements in the input sequence X, let M be the number of elements in the sequence Y, and assume that the indexed elements of X and Y that lie outside their range are equal to zero, as shown by the following equations: xj = 0, j < 0 or j N and yj = 0, j < 0 or j M. Then the CrossCorrelation VI obtains the elements of h using the following equation:

for j = (N1), (N2), , 1, 0, 1, , (M2), (M1)

The elements of the output sequence Rxy are related to the elements in the sequence h by Rxyi = hi (N1) for i = 0, 1, 2, , N+M2. In order to make the cross correlation calculation more accurate, normalization is required in some situations. VI provides biased and unbiased normalization. 1. Biased normalization If the normalization is biased, LabVIEW applies biased normalization as follows: Rxy(biased)j =

for j = 0, 1, 2, , M+N2 where Rxy is the cross correlation between x and y with no normalization.
2. Unbiased normalization If the normalization is unbiased, LabVIEW applies unbiased normalization as follows: Rxy(unbiased)j = for j = 0, 1, 2, , M+N2

where Rxy is the cross correlation between x and y with no normalization.

AUTO CORRELATION VI

WINDOWING AND FILTERING

1. FIR Windowed Filter

In filtered window type,the values for low cutofffreq: fl and high cutofffreq: fh must observe the following relationship: 0 < f1 < f2 < 0.5fs where f1 is low cutofffreq: fl, f2 is high cutofffreq: fh, and fs is sampling freq: fs.

0 1 2

Rectangle (default) Hanning Hamming

3
4 5 6 7 8 9

Blackman-Harris
Exact Blackman Blackman Flat Top 4 Term B-Harris 7 Term B-Harris Low Sidelobe

11
30 31 32 33 34 60 61 62

Blackman Nuttall
Triangle Bartlett-Hanning Bohman Parzen Welch Kaiser Dolph-Chebyshev Gaussian