Fourier analysis

From testwiki
Revision as of 21:54, 27 November 2022 by 2001:bb6:3c6c:4d00:8945:9262:bd7f:1651 (talk) (Fixed LaTeX for exponential form)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Introduction

Fourier analysis is a method of analysing functions. These functions may be electrical signals (say, from an electronic circuit being tested), pure mathematical functions, or any kind of data being analysed on a computer. Regardless, if the function is single-valued, Fourier analysis can be used to produce an imperfect approximation.

Basics

The trigonometric form

Fourier analysis works by breaking down the function being considered into a Fourier Series. The Fourier Series, in simplest terms, is a summation of sine and cosine functions. Each of these trigonometric functions looks something like this:

ancos(ωnt)+bnsin(ωnt)

The exponential form

Consider f(x) as real valued function

f(x)=n=Aneinx [1]