What is the point of Fourier Series if you can do the Fourier Transform?

In summary, Fourier series and transforms are both important tools in mathematics and engineering. Fourier series are defined for periodic functions on a finite interval, while Fourier transforms are defined for functions integrable over the real line. They have different contexts and applications, but they are closely related. Fourier series can be seen as a special case of Fourier transforms, and they are often used in practical applications due to their convenience and computational efficiency. It is important to understand both concepts and their connections in order to fully utilize them in problem-solving.
  • #1
Rib5
59
0
Hey,

I was wondering. Since the Fourier Series coefficients can just be represented in the form of a Fourier Transform, what is the point of ever finding the Fourier coefficients and not doing the transform?
 
Mathematics news on Phys.org
  • #2
For example, to reconstruct a bandlimited signal from Fourier coefficients (happen to be the samples in time domain)
 
  • #3
Rib5 said:
Hey,

I was wondering. Since the Fourier Series coefficients can just be represented in the form of a Fourier Transform, what is the point of ever finding the Fourier coefficients and not doing the transform?
Fourier series are defined for periodic functions (finite interval) while Fourier transforms are defined for functions integrable over the real line. They just have different contexts.
 
  • #4
mathman said:
Fourier series are defined for periodic functions (finite interval) while Fourier transforms are defined for functions integrable over the real line. They just have different contexts.


Yes, but the OP's point is that all functions that can be expanded in Fourier series can also be Fourier transformed so why bother with Fourier series at all. And I can't say I really have a reason to disagree.
 
  • #5
maverick_starstrider said:
Yes, but the OP's point is that all functions that can be expanded in Fourier series can also be Fourier transformed so why bother with Fourier series at all. And I can't say I really have a reason to disagree.

I asked my teacher about it in class today, and he pretty much said the same thing. He said that the main reason we learn about Fourier series is that it helps students understand the Fourier transform more intuitively, and also for historical reasons about how the Fourier transform was developed.
 
  • #6
How about, you do the Fourier series because it is easier.
 
  • #7
An example: the density function for the normal distribution is Ke-x2/2. It has a Fourier transform, but you cannot expand it with a Fourier series.
 
  • #8
mathman said:
An example: the density function for the normal distribution is Ke-x2/2. It has a Fourier transform, but you cannot expand it with a Fourier series.

The OP's question concerns the other way around. Any function that has a Fourier series also has a Fourier transform. How are they related? The following argument has been taken from Brad Osgood's excellent course that's available online.

Let [itex]\Phi[/itex] be a periodic function of period T. Then [itex]\Phi[/itex] can be written as
[tex]\Phi(t) = \phi(t) \ast \sum_{k = -\infty}^\infty \delta(t-kT) [/tex]
where [itex]\phi[/itex] is one period of [itex]\Phi[/itex] and [itex]\ast[/itex] denotes convolution. Now, by the convolution theorem (the Fourier tranform of a convolution is the product of the Fourier transforms),
[tex]
\begin{align*}
\mathcal{F}\Phi(s) &=
\Bigl(\mathcal{F}\phi(s) \Bigr) \frac{1}{T}\sum_{k = -\infty}^\infty \delta\left(s-\frac{k}{T}\right) \\
&= \frac{1}{T}\sum_{k = -\infty}^\infty \mathcal{F}\phi\left(\frac{k}{T}\right)\delta\left(s-\frac{k}{T}\right)
\end{align*}
[/tex]

Taking the inverse Fourier transform gives us back [itex]\Phi[/itex]. Since [itex]\mathcal{F}\phi\left(k/T\right)[/itex] are constants and the inverse Fourier transform of a shifted delta function is a complex exponential,
[tex]
\Phi(t) = \sum_{k = -\infty}^\infty \frac{1}{T}\mathcal{F}\phi\left(\frac{k}{T}\right) e^{2\pi i k t/T}
[/tex]
However,
[tex]
\frac{1}{T}\mathcal{F}\phi\left(\frac{k}{T}\right) =
\frac{1}{T} \int_{-\infty}^{\infty} e^{-2\pi i (k/T)t}\phi(t) \, dt \\
= \frac{1}{T} \int_{0}^{T} e^{-2\pi i (k/T)t}\Phi(t) \, dt
[/itex]

But this is the k-th Fourier coefficient [itex]c_k[/itex] of [itex]\Phi[/itex]. In other words, the Fourier series is a consequence of Fourier transform theory.
[tex]
\Phi(t) = \sum_{k = -\infty}^\infty c_k e^{2\pi ikt/T}, \qquad \text{where} \qquad
c_k = \frac{1}{T} \int_{0}^{T} e^{-2\pi i (k/T)t}\Phi(t) \, dt
[/tex]
 
Last edited:
  • #9
One reason for using Fourier series is simply practical. When analyzing something numerically you have to stop somewhere. You can't calculate it to the infinite decimal place. In calculating an integral this amounts to (1) using a finite domain, and (2) approximating the integral with a summation. With the Fourier transform integral the most convenient and obvious way to do this is to use a Fourier series. Even then, it is not a true Fourier series since you have to stop the summation after a finite number of terms.

Indeed, computational physicists use the terms "Fourier transform" and "Fourier series" interchangeably in casual conversation.
 
  • #10
A lot of times Fourier series and transforms show up in applications like solving linear eigenvalue problems. For some problems sinusoids are the eigenfunctions, and if the operator has a discrete set of eigenvalues it is natural to represent the solution to the eigenvalue problem in the form of a Fourier series - it kind of "falls out" when solving the problem and throwing an integral transform at the problem (especially without an understanding of Fourier series!) can be more cumbersome. If the operator has a continuous set of eigenvalues then it is natural to represent the solution as an integral transform. Some problems even have both kinds of eigenvalues, so the solution can be nicely written as a the combination of a sum and an integral. Usually there are clear physical interpretations for the various terms, so it is nice to keep them separate. Facility dealing with both the series and the transform allows you to use whatever is most convenient for the problem at hand, and to easily make the transition to other sets of basis functions that many applications require.

Also, as noted by pellman, Fourier series show up in numerics all the time. And in the era of digitized data, the DFT (usually implemented as an FFT whenever possible) is used all the time to look at spectral content or to quickly do convolutions. What is the DFT? It effectively assumes your data are periodic and that you only have one period sampled, so it does the periodic extension of the data (like you learn about with simple Fourier series problems!) and finds the discrete Fourier series.

So of course you are right, and it is probably good for you to lump them together in your head (along with Laplace transforms, etc.), but I would claim that making yourself work through some of the Fourier series results in a class is still a useful exercise.

jason
 

1. What is the difference between Fourier Series and Fourier Transform?

Fourier Series and Fourier Transform are both mathematical tools used to analyze periodic signals. The main difference between them is that Fourier Series is used for analyzing signals that are periodic over time, whereas Fourier Transform is used for analyzing signals that are non-periodic or have a finite duration.

2. Why do we need Fourier Series if we have Fourier Transform?

Fourier Transform is a more general and powerful tool as it can be used for analyzing both periodic and non-periodic signals. However, Fourier Series is still useful for analyzing periodic signals as it provides a simpler and more intuitive representation of the signal in terms of its frequency components.

3. Can Fourier Transform be applied to all types of signals?

Yes, Fourier Transform can be applied to any signal, regardless of its nature or complexity. This is because all signals can be represented as a combination of different frequency components, which is the basis of Fourier Transform.

4. How does Fourier Series help in understanding signals?

Fourier Series breaks down a complex periodic signal into its individual frequency components, making it easier to understand the behavior and characteristics of the signal. This allows scientists to analyze and manipulate signals in a more intuitive and efficient manner.

5. Are there any practical applications of Fourier Series and Fourier Transform?

Yes, both Fourier Series and Fourier Transform have a wide range of practical applications in various fields such as signal processing, image and sound analysis, communications, and many more. They are essential tools for understanding and manipulating signals in many scientific and technological fields.

Similar threads

Replies
12
Views
2K
Replies
23
Views
4K
Replies
7
Views
2K
Replies
4
Views
749
  • General Math
Replies
33
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
248
Replies
5
Views
3K
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
310
  • Calculus and Beyond Homework Help
Replies
6
Views
387
Back
Top