answersLogoWhite

0

Fourier series is the sum of sinusoids representing the given function which has to be analysed whereas discrete fourier transform is a function which we get when summation is done.

User Avatar

Wiki User

16y ago

Still curious? Ask our experts.

Chat with our AI personalities

LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve

Add your answer:

Earn +20 pts
Q: What is the difference between fourier series and discrete fourier transform?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Math & Arithmetic

What is the difference between discrete fourier transform and fast fourier transform?

discrete fourier transformer uses digital signals whereas the fast fourier transform uses both analog and digital.


What is the difference between the fourier laplace transform?

They are similar. In many problems, both methods can be used. You can view Fourier transform is the Laplace transform on the circle, that is |z|=1. When you do Fourier transform, you don't need to worry about the convergence region. However, you need to find the convergence region for each Laplace transform. The discrete version of Fourier transform is discrete Fourier transform, and the discrete version of Laplace transform is Z-transform.


What is the difference between Fourier transform and Laplace transform and z transform?

Fourier transform and Laplace transform are similar. Laplace transforms map a function to a new function on the complex plane, while Fourier maps a function to a new function on the real line. You can view Fourier as the Laplace transform on the circle, that is |z|=1. z transform is the discrete version of Laplace transform.


What is the difference between fourier series and fourier transform with real life example please?

A Fourier series is a set of harmonics at frequencies f, 2f, 3f etc. that represents a repetitive function of time that has a period of 1/f. A Fourier transform is a continuous linear function. The spectrum of a signal is the Fourier transform of its waveform. The waveform and spectrum are a Fourier transform pair.


What is a fast Fourier transform?

A fast Fourier transform is an efficient algorithm for working out the discrete Fourier transform - which itself is a Fourier transform on 'discrete' data, such as might be held on a computer. Contrast this to a 'continuous Fourier transform' on, say, a curve. One would need an infinite amount of data points to truly represent a curve, something that cannot be done with a computer.Check out: The Scientist And Engineer's Guide To Digital Signal Processing. It is a free, downloadable book that deals, inter alia, with Fourier transforms; chapters 8-12are germane to your question. This is a highly practical, roll-yer-sleeves-up book for, as the title says, scientists and engineers, but Smith describes the underlying theory well. The sample code supplied with the book is in BASIC and FORTRAN, of all things; the author does this for didactic purposes to make the examples easy to understand rather than efficient.