Rapport Année : 2022

What is Fast Fourier Transform?

Résumé

Historical background The history of the Fast Fourier Transform (FFT) is of an interesting nature. It began in the year 1805 when Carl Friedrich Gauss tried to calculate and determine the orbit of certain asteroids from sample locations which led to the development of Discrete Fourier Transform [1]. In calculating the DFT, he invented an algorithm which was similar and equivalent to that which was developed by Cooley and Tukey. However, this method was more general than that of Cooley and Tukey [1]. Jean-Baptiste-Joseph, Baron Fourier (1768-1830) a French mathematician is known for developing various mathematical concepts which now find their application in mathematics and engineering through his concept of "The Analytical Theory of Heat" where he was able to show that conduction of heat in solids can be analyzed in terms of infinite mathematical series now called the Fourier series. In the second part of the 19th century and the 20th-century scientist and mathematicians improved the idea of Fourier to become what it is today where the idea has been expanded and therefore find its application in almost all the engineering field [2]. Signal processing is one of such fields where Fourier Transform is applied.

Fichier principal
Vignette du fichier
Fast Fourier Transform.pdf (843.39 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-03741810 , version 1 (02-08-2022)

Licence

Identifiants

  • HAL Id : hal-03741810 , version 1

Citer

Amin Gasmi. What is Fast Fourier Transform?. [Technical Report] Société Francophone de Nutrithérapie et de Nutrigénétique Appliquée. 2022. ⟨hal-03741810⟩

Collections

850 Consultations
1687 Téléchargements

Partager

  • More