Академический Документы
Профессиональный Документы
Культура Документы
SUBMITTED TO:
MAM SIDRA AYUB
SUBMITTED BY:
UW-15-ME-BSC-010
UW-15-ME-BSC-022
UW-15-ME-BSC-003
UW-15-ME-BSC-006
UW-15-ME-BSC-029
When the French mathematician Joseph Fourier (17681830) was trying to solve a
problem in heat conduction, he needed to express a function as an infinite series of
sine and cosine functions.
Earlier, Daniel Bernoulli and Leonard Euler had used such series while investigating
problems concerning vibrating strings and astronomy. The series in Equation 1 is
called a trigonometric series or Fourier series and it turns out that expressing a
function as a Fourier series is sometimes more advantageous than expanding it as a
power series. In particular, astronomical phenomena are usually periodic, as are
heartbeats, tides, and vibrating strings, so it makes sense to express them in terms of
periodic functions.
nx nx
(
f ( x )=a 0+ an cos
n=1 L
+bn sin
L )
Where interval lies form ( to + )
a0= f ( x )dx
an=
f ( x )cosnx
bn=
f ( x ) sinnx
where n =1, 2, 3,..
Applications OF Fourier series:
ANALYTICAL APPLICATIONS
H()
Hn.(1)
Comparing equation (6) with the Fourier series given in equation (1), it is clear that
this is a form of the Fourier series with non-integer frequency components. Currently,
the most common and efficient method of numerically calculating the DFT is by using
a class of algorithms called Fast Fourier Transforms (FFTs). The first known discovery
of the FFT was by Gauss in 1805; however, the first modern rediscovery of the FFT
was done in 1942 by Danielson and Lanczos4. They were able to show one may divide
any DFT into a sum of two DFTs which each correspond to N 2 1 points.
The most useful part of this formula is that it can be used recursively, since each of
these He n and HO n terms may be independently expanded using the same
algorithm, each time reducing the number of calculations by a factor of 2. In fact, this
class of FFT algorithm shrinks the computation time from O(N2 ) operations to the
much more manageable O(N log2 N) operations. There are many different FFT
algorithms; the one presented here is simply the most common one, known as a
Cooley-Turkey FFT algorithm. There are other algorithms which can decrease
computation time by 20 or 30 percent (so-called base-4 FFTs or base-8 FFTs) 4 . Most
importantly, both classes of FFT algorithms are fast enough to embed into modern
digital oscilloscopes and other such electronic equipment. Thus, FFTs have many
modern applications, such as Spectrum Analyzers, Digital Signal Processors (DSPs),
and the numerical computation arbitrary-size multiplication operations.
Which means that the previously described methods of the FFT apply to the function.
Thus, any digital oscilloscope that is sufficiently fast and equipped with a FFT
algorithm is capable of providing the user with the frequency components of the
source signal.
Spectrum Analyzers have many uses in the laboratory, but one of the most common
uses is for signal noise studies. As shown above, the FFT of the signal gives the
amplitudes of the various oscillatory components of the input. After normalization, this
allows for the experimentalist to determine what frequencies dominate their signal.
For example, if you have a DC signal, you would expect the FFT to show only very low
frequency oscillations (i.e., the largest amplitudes should correspond to f 0).
However, if you see a sharp peak of amplitudes around 60 Hz, you would know that
something is feeding noise into your signal with a frequency of 60 Hz (for example, an
AC leakage from your power source).
There are many advantages to doing DSP as opposed to doing analog signal
processing. To begin with, practically speaking, you can have a much more
complicated filtering function (the function that transforms the coefficients of the DFT)
with DSP than analog signal processing. While it is fairly easy to make a single band
pass, low pass, or high pass filter with capacitors, resistors, and inductors, it is
relatively difficult and time consuming to implement anything more complicated than
these three simple filters. Furthermore, even if a more complicated filter was
implemented with analog electronics, it is difficult to make even small modifications to
the filter (there are exceptions to this, such as FPGAs, but those are also more difficult
to implement than simple software solution). DSP is not limited by either of these
effects since the processing is (usually) done in software, which can be programmed
to do whatever the user desires.
1.5 DIGITAL SIGNAL PROCESSING:
We have already seen how the Fourier Series allows experimentalists to identify
sources of noise. It may also be used to eliminate sources of noise by introducing the
idea of the Inverse Fast Fourier Transform (IFFT). In general, the goal of an Inverse
Fourier Transform is to take the An (the ones that appear in eq (5) and use them to
reconstruct the original function, f(t).
Analytically, this is done by multiplying each An by e2ik then taking the sum over all
N
n
n. However, this is an inefficient algorithm to use when the calculation must be done
numerically. Just as there is a fast numerical algorithm for approximating the Fourier
coefficients (the FFT), there is another efficient algorithm, called the IFFT, which is
capable of calculating the Inverse Fourier Transform much faster than the brute-force
method.
In 1988, it was shown by Duhamel, Piron, and Etcheto 7 that the IFFT is simply.In other
words, you can calculate the IFFT directly from the FFT; you simply flip the real and
imaginary parts of the coefficients calculated by the original FFT. Thus, the IFFT
algorithms are essentially the same as the FFT algorithms; all one must do is flip the
numbers around at the beginning of the calculation.Since the IFFT inherits all of the
speed benefits of the FFT, it is also quite practical to use it in real time in the
laboratory. One of the most common applications of the IFFT in the laboratory is to
provide Digital Signal Processing (DSP). In general, the idea of DSP is to use
configurable digital electronics to clean up.
Mechanical vibration is a subject you study during course have a few applications of fourier series. Some other
applications are:
The synchronizing signal generator 215 the construction of which will be described
later is responsive to the pulse signal from the engine speed detector 105 via a line L
150b to produce a timing signal and supply it via a line L 215. In the speed regulating
unit 201, the timing signal is formed from the engine speed signal.
The mathematical expression of the periodic function f(x) in one period must be
available
The function in one period is defined in an interval (c < x < c+2L) in which c = 0
or any arbitrarily chosen value of x, and L = half period
The function f(x) and its first order derivative f(x) are either continuous or
piece-wise continuous in c < x < c+2L
1.10Convergence in fourier series:
In engineering applications, the Fourier series is generally presumed to converge
everywhere except at discontinuities, since the functions encountered in engineering
are better behaved than the ones that mathematicians can provide as counter-
examples to this presumption. In particular, the Fourier series converges absolutely
and uniformly to s(x) whenever the derivative of s(x) (which may not exist
everywhere) is square integral. If a function is square-integral on the interval [x0, x0+P],
then the Fourier series converges to the function at almost every point. Convergence of
Fourier series also depends on the finite number of maxima and minima in a function
which is popularly known as one of the Dirichlet's condition for Fourier series . See Convergence of
Fourier series. It is possible to define Fourier coefficients for more general functions or
distributions, in such cases convergence in norm or weak convergence is usually of
interest.
Laplace transform:
1.12Brief history:
This is much easier to state than to motivate! We state the definition in two ways, first
in words to explain it intuitively, then in symbols so that we can calculate transforms.
Definition 1 Given f, a function of time, with value f(t) at time t, the Laplace
transform of f is denoted f and it gives an average value of f taken over all positive
values of t such that the value f(s) represents an average of f taken over all possible
time intervals of length s.
This immediately raises the question of why to use such a procedure. In fact the
reason is strongly motivated by real engineering problems. There, typically we
encounter models for the dynamics of phenomena which depend on rates of change
of functions, eg velocities and accelerations of particles or points on rigid bodies,
which prompts the use of ordinary differential equations (ODEs). We can use ordinary
calculus to solve ODEs, provided that the functions are nicely behavedwhich means
continuous and with continuous derivatives. Unfortunately, there is much interest in
engineering dynamical problems involving functions that input step change or spike
impulses to systemsplaying pool is one example. Now, there is an easy way to
smooth out discontinuities in functions of time: simply take an average value over all
time. But an ordinary average will replace the function by a constant, so we use a kind
of moving average which takes continuous averages over all possible intervals of t.
This very neatly deals with the discontinuities by encoding them as a smooth function
of interval length s.
1.14Finding Laplace transform?
Formal definition
The Laplace transform of a function f(t), defined for all real numbers t 0, is the
function F (s),defined by
2 Laplace in Engineering:
Future recommendations:
The main objective to carry out this project to become faamiliarize with applications
of fourier and laplace transform in real life or in engineering field.fourier series are
commonly used in the field of mechanical vibration whereas the laplace is using in the
field of electrical engineering more.
It is common in engineering education to find the perspective that the Laplace
transform is just a theoretical and mathematical concept (outside of the real world)
without any application in others areas. The transforms are considered as a tool to
make mathematical calculations easier.