JAYPEE INSTITUTE OF INFORMATION TECHNOLOGY,

NOIDA

B.TECH II SEMESTER
REPORT FOR PBL

MATHEMATICS-2(15B11MA211)

SUITABLE APPLICATIONS OF
FOURIER SERIES FOR ENGINEERING PROBLEMS
S.NO ENROLLMENT NAME BATCH

1 23102186 Varun Srivastava A5

2 23102189 Aishwarya Dwivedi A5
3 23102109 Ritish Jaiswal A5
4 23102130 Krishna Sharma A6
Under the Supervision of:
Prof Neha Singhal
Department of Mathematics
JIIT,Sector 62,Noida

INTRODUCTION TO FOURIER SERIES-

Fourier series is a mathematical tool used to represent periodic functions as a sum

of sine and cosine functions (or complex exponentials). It's named after the French
mathematician Jean-Baptiste Joseph Fourier, who introduced the concept in the
early 19th century.

The basic idea behind Fourier series is that any periodic function with a certain
period can be decomposed into an infinite sum of sine and cosine functions, each
with a specific frequency or wavelength. These frequencies are integer multiples
of the fundamental frequency of the periodic function.

Mathematically, if f(x) is a
periodic function with period 2π, then its Fourier series representation is given by:

A0 the average value of the function over one period.

An and Bn are called the Fourier coefficients, and they determine the amplitude of
the cosine and sine terms, respectively.

The Fourier series is particularly useful in various fields, including signal

processing, image analysis, and physics, where periodic phenomena
are encountered.
APPLICATIONS OF FOURIER SERIES-
1) SIGNAL PROCESSING-

Signal processing involves analysing and manipulating signals to extract

information efficiently. It encompasses diverse applications like
telecommunications, audio processing, and medical imaging. Through techniques
such as Fourier analysis, signals are dissected in time or frequency domains to
uncover patterns and trends. Engineers use this insight to design filters for noise
reduction, modulate signals for efficient transmission, and compress data for
storage optimization. By shaping signals to meet specific needs, signal processing
drives innovation across industries, enhancing communication systems, medical
diagnostics, and multimedia technologies, ultimately advancing our ability to
interpret and utilize information carried by signals.

In signal processing, Fourier analysis plays a pivotal role in understanding and

manipulating signals. By decomposing signals into their constituent frequencies
using Fourier transforms, engineers can analyse complex waveforms and extract
meaningful information efficiently. This enables tasks such as identifying dominant
frequencies, detecting periodicity, and characterizing signal properties accurately.
Moreover, Fourier analysis facilitates the design of filters to manipulate signals in
the frequency domain. Engineers can utilize techniques like Fourier series and the
Fourier transform to design filters for noise reduction, remove unwanted
frequency components, and enhance specific frequency bands. This ensures that
signals are processed effectively, leading to improved signal quality and reliability
in various applications such as telecommunications, audio processing, and medical
imaging. Overall, Fourier analysis is indispensable in signal processing, providing
essential tools for
analysing,
manipulating, and
interpreting
signals across
diverse domains.

2) MUSIC
RECOGNITION

The Fourier series of a 1 Hz square wave is shown in the video below, as well as
how an (approximate) square wave can be created from sinusoidal components.
Above is the signal in the time domain, and below is
the signal in the frequency domain.
A Fourier Analysis must be performed to extract this frequency magnitude data.
Because the audio signal data is discrete, the Fast Fourier Transform (FFT)
algorithm in MATLAB (on optimised implementation of the Discrete Fourier
Transform) was used to analyse audio signals. The FFT function takes the form
FFT(x,N) where x is the signal and N the number of frequency points.
F is a vector with 44100 elements, which is the result of the FFT of Smono.

Each row, n = 1, 2, 3, 4, …, 44100 , contains the complex number fn, where n is the
index. The whole number n is the frequency, and the magnitude of f is the
magnitude of the frequency n9.

is the magnitude of that frequency n, where Re(fn) is the real part of fn, and Im(fn)
is the imaginary part of fn.

For example, the magnitude of the first row, which is the magnitude of n 1Hz.
CONCLUSION:-

The basic equations of the Fourier series led to the development of the Fourier
transform, which can decompose a nonperiodic function much like the Fourier
series decomposes a periodic function. Because this type of analysis is very
computation intensive, different FastFourier Transform algorithms have been
devised, which lower the order of growth of the number of operations from
order(N2) to order (n log(n)).

With these new techniques, Fourier series and Transforms have become an
integral part of the toolboxes of mathematicians and scientists. Today, it is used
for applications as diverse as file compression (such as the JPEG image format),
signal processing in communications and astronomy, acoustics, optics, and

cryptography.

REFRENCES-

D. Ballard and C. Brown Computer Vision, Prentice-Hall, 1982, pp 24 - 30.

R. Gonzales, R. Woods Digital Image Processing, Addison-Wesley Publishing

Company, 1992, pp 81 - 125.
B. Horn Robot Vision, MIT Press, 1986, Chaps 6, 7.

A. Jain Fundamentals of Digital Image Processing, Prentice-Hall, 1989, pp 15 - 20.

A. Marion An Introduction to Image Processing, Chapman and Hall, 1991, Chap. 9.

Eric W. Weisstein Fourier Series, MathWorld--A Wolfram Web Resource

https:// mathworld.wolfram.com/FourierSeries.html

Jovan Jovanovic How does Shazam work? Music Recognition Algorithms,

Fingerprinting, and Processing, Online

Article, https://www.toptal.com/algorithms/shazam-it-music-processing-
fingerprinting-and-recognition

Joseph Edmond DeChicchis A Music Identification Algorithm which Utilizes the

Fourier Analysis of Audio Signals,2016,pp 2-7.