why is fft required? can you explain the evolution of Fourier series--> Fourier Transform--> DTFT---> DFT---> FFT.
4 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
amuka anurag
el 11 de Mzo. de 2021
Comentada: amuka anurag
el 11 de Mzo. de 2021
I want to know the reasons behind every transistion. Why Fourier Transform is used when Fourier series can be used to represent any signal. Is it about periodicity? If so please explain. Please take time and answer my question.
0 comentarios
Respuesta aceptada
Walter Roberson
el 11 de Mzo. de 2021
Fourier Transform is the general name of the technique, labeling that it is a Transform and marking which one it is.
Fourier Series is the formal ddefinition of the mathematics of the transformation.
The Fourier Series is an infinite series in most cases, and so often requires an infinite amount of memory except in situations where you can write mathematical formulas for the terms. However in most cases you do not know the mathematical formulas for the terms when you have arbitrary input.
fft, Fast Fourier Transform, is an adaptation to finite discrete signals and so is suitable for arbitrary input of unknown properties.
Más respuestas (0)
Ver también
Categorías
Más información sobre Discrete Fourier and Cosine Transforms en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!