answersLogoWhite

0

Still curious? Ask our experts.

Chat with our AI personalities

ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan

Add your answer:

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

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

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.


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 are the limitation of fourier series?

what are the limitations of forier series over fourier transform


How does the graph of Fourier Series differ to the graph of Fourier Transform?

You can graph both with Energy on the y-axis and frequency on the x. Such a frequency domain graph of a fourier series will be discrete with a finite number of values corresponding to the coefficients a0, a1, a2, ...., b1, b2,... Also, the fourier series will have a limited domain corresponding to the longest period of your original function. A fourier transforms turns a sum into an integral and as such is a continuous function (with uncountably many values) over the entire domain (-inf,inf). Because the frequency domain is unrestricted, fourier transforms can be used to model nonperiodic functions as well while fourier series only work on periodic ones. Series: discrete, limited domain Transform: continuous, infinite domain.


Is there away to sort an array of data using the fast Fourier transform and finding the highest lower or average value finding his value or even best his position?

The Fast Fourier Transform is an implementation of the Discrete Fourier Transform. The DFT is a method of processing a time-sampled signal (eg, an audio wave) into a series of sines and cosines. As such, it is not a sorting algorithm, so this question does not make any sense.