Вы находитесь на странице: 1из 12

UNIT IV

TIME FREQUENCY SIGNAL ANALYSIS


METHODS

By :- Mr. B.M.Daxini

Fourier Transform Basics


The basic idea behind all those horrible looking formulas is
rather simple, even fascinating: it is possible to form any
function f(x) as a summation of a series of sine and cosine
terms of increasing frequency.
In other words, any space or time varying data can be
transformed into a different domain called the frequency space.
A fellow called Joseph Fourier first came up with the idea in the
19th century, and it was proven to be useful in various
applications, mainly in signal processing.
Frequency domain offers some attractive advantages for image
processing. It makes large filtering operations much faster, and
it collects information together in different ways that can
sometimes separate signal from noise or allow measurements
that would be very difficult in spatial domain. Furthermore, the
Fourier transform makes it easy to go forwards and backwards
A.V.P.T.I
from
the spacial domain to the frequency space.

Application of Fourier Transform


A biomedical signal is often corrupted by noise (e.g., powerline
interference, muscle or motion artifacts, RF interference from
electrosurgery or diathermy apparatus).
Therefore, it is useful to know the frequency spectrum of the
corrupting signal in order to be able to design a filter to
eliminate it.
If we want to find out, for example, how well the patients
cardiac output is correlated with the area of the QRS complex,
then we need to use proper correlation techniques.

A.V.P.T.I

THE FOURIER TRANSFORM


The digital computer algorithm for Fourier analysis called the
fast Fourier transform (FFT) serves as a basic tool for
frequency-domain analysis of sign.

The Fourier transform of a discrete nonperiodic


signal
Assuming that a discrete-time aperiodic signal exists as a
sequence of data sampled from an analog prototype with a
sampling period of T, the angular sampling frequency being s
= 2/T, we can write this signal in the time domain as a series
of weighted Dirac functions. Thus
The Fourier transform of this expression is

A.V.P.T.I

The ordering of integration and summation can be changed to


give

Thus we obtain

A.V.P.T.I

Similarly, the Inverse Fourier Transform is

It is modern practice to use normalized frequencies, which


means that the sampling period T is taken to be 1.
Therefore, the Fourier transform pair for discrete signals,
considering normalized frequencies, is

A.V.P.T.I

(a) A discrete-time signal, and (b) the modulus of its Fourier transform

A.V.P.T.I

The important properties of the Fourier transform,


Is its repetition at intervals of the sampling frequency in both
positive and negative directions.
Also it is remarkable that the components in the interval 0 <
< s/2 are the complex conjugates of the components in the
interval s/2 < < s.

A.V.P.T.I

The discrete Fourier transform for a periodic signal


The discrete Fourier transform (DFT) is the name given to the
calculation of the Fourier series coefficients for a discrete
periodic signal. The operations are similar to the calculation of
Fourier coefficients for a periodic signal, but there are also
certain marked differences.
1) The integrals become summations in the discrete time
domain.
2) The second difference is that the transform evaluates only a
finite number of complex coefficients, the total being equal
to the original number of data points in one period of
original signal.
Because of this, each spectral line is regarded as the k-th
harmonic of the basic period in the data rather than identifying
with a particular frequency expressed in Hz or radian/s.
A.V.P.T.I

Algebraically, the forward and reverse transforms are


expressed as

A.V.P.T.I

(a) A discrete periodic signal and (b) the real and imaginary parts of its DFT.

A.V.P.T.I

Using the symmetry of the DFT, algorithms for fast computation


have been developed. Also, the symmetry has two important
implications.
The first is that the transformation will yield N unique complex
spectral lines.
The second is that half of these are effectively redundant
because all of the information contained in a real time domain
signal is contained within the first N/2 complex spectral lines.
These facts permitted the development of the Fast Fourier
Transform (FFT).

A.V.P.T.I

Вам также может понравиться