DFT

DFT#

Abstract notations#

History#

The Fourier transform is one of the key tools in Biomedical Data Science. Its namesake is Jean Baptiste Fourier, who was a 18th century French mathemetician who made fundamental discoveries into harmonic analysis. Its fair to say that Fourier’s discoveries are some of the most fundamental in all of a mathematics and engineering and is the foundation for signal processing.

One of his main discoveries was the Fourier series, the idea that a function can be decomposed into building blocks of trigonometric functions.

Some notation#

Let $<, >$ be a so-called inner product. For example $< a, b >= \sum_{m = 1}^{n} a_{m} b_{m}$ if $a$ and $b$ are two vectors. But, $< a, b >= \int_{0}^{1} a (t) b (t) d t$ if $a$ and $b$ are two functions on $[0, 1]$ . (There is a nice generality between Fourier results on data and Fourier results on functions and other spaces. However, we’ll largely focus on discrete data, so think of the first definition.) We can define the norm as $< a, a >= | | a | |^{2}$ , so that, the distance between two vectors is $| | a - b | |$ .

Consider a basis, that is a set of vectors, $b_{k}$ so that $| | b_{k} | | = 1$ and $< b_{k}, b_{j} >= I (k = j)$ and the set of vectors, $H$ , that can be written as $\sum_{k = 1}^{k} b_{k} c_{k}$ for some constants $c_{k}$ , then for any element $x \in H$ we have that the best approximation using any subset of the indices, $S$ , is of the form

\sum_{k \in S} b_{k} < b_{k}, x > .

For real vectors and the basis we consider, every vector can be written as a sum of the basis elements. You can have weird functions that can’t be written out as sums of the basis elements, but they’re weird functions.

More practically#

The basis we’re interested in is $b_{k}$ which has element $m$ equal to $e^{- 2 π i m k / n} = \cos (2 π m k / n) + i \sin (2 π m k / n)$ for $k = 0, . . ., n - 1$ . Here, notice, we quit using the index $i$ since now it stands for the complex unit. This basis satisfies our rules of $< b_{k}, b_{j} >= I (j = k)$ and having norm 1. So that, given any vector $x$ , our best approximation to it is

\sum_{k = 0}^{n - 1} b_{k} < b_{k}, x >= \sum_{k = 0}^{n - 1} b_{k} F_{k}

where

F_{k} = \sum_{m = 0}^{n - 1} x_{m} e^{- 2 π i m k / n} = \sum_{m = 0}^{n - 1} x_{m} [\cos (2 π m k / n) + i \sin (2 π m k / n)] .

The collection of elements, $F = (F_{0}, \dots F_{n - 1})$ are called the (discrete) Fourier coeficients and the operation that takes $x$ and converts it into $F$ is called the (discrete) Fourier transform.

Let’s consider the case where $x = (1 4 9 16)^{'}$ . So then

import numpy as np
import matplotlib.pyplot as plt
x = np.arange(1,5,1) ** 2
t = np.arange(0, 4, 1)
n = 4
F0 = np.sum(x * np.exp(-2 * 1j * np.pi * t * 0 / n))
F1 = np.sum(x * np.exp(-2 * 1j * np.pi * t * 1 / n))
F2 = np.sum(x * np.exp(-2 * 1j * np.pi * t * 2 / n))
F3 = np.sum(x * np.exp(-2 * 1j * np.pi * t * 3 / n))

np.round([F0, F1, F2, F3], 3)

array([ 30. +0.j,  -8.+12.j, -10. -0.j,  -8.-12.j])

F = np.fft.fft(x)
F

array([ 30. +0.j,  -8.+12.j, -10. +0.j,  -8.-12.j])

Let’s give a more realistic example. Consider two cosine waves, one fast, one slow. Let’s add them together and see if the FFT can figure out what we’ve done.

n = 1000
t = np.arange(0, n, 1)
c1 = np.cos(2 * np.pi * t * 5 / n)
c2 = np.cos(2 * np.pi * t * 20 / n)
plt.plot(t, c1)
plt.plot(t, c2)
plt.show

<function matplotlib.pyplot.show(close=None, block=None)>

_images/cfd33f6225683a56eaa9dfe84f9b9b3ac13f546b1aa3543ec18cc8f4a04c8a22.png

x = c1 + .5 * c2
plt.plot(t, x)
plt.show

<function matplotlib.pyplot.show(close=None, block=None)>

_images/41fa1ec19309043b55873d20a5bddbd8e96789334f4e5dc1d18bee882c873887.png

a = np.fft.fft(x)
b = a.real ** 2 + a.imag ** 2
plt.plot(b)
plt.show()
np.where(b > 1e-5)

_images/390b96cdd543b6bb35874d46e5caae43abe21d45e080bc12033cceb03ebcd258.png

(array([  5,  20, 980, 995]),)

Some notes#

We can go backwards from the Fourier coefficients to the signal using the inverse transform. Also, for real signals sometimes people will multiply the signal by $(- 1)^{t}$ in order for the plot of the norm of the coeficients (the power spectrum as its called) to look nicer.

## Plotting the spectrum so that it's in the middle
a = np.fft.fft(x * (-1) ** t)
b = a.real ** 2 + a.imag ** 2
plt.plot(b)
plt.show()

_images/b0e91aa411549927bce7af4b32c5f7d84ff8780ce36741661d4f0573cc3243f0.png

## demonstrating going backwards
a = np.fft.fft(x)
b = np.fft.ifft(a)

plt.plot(b)
plt.show()

/home/bcaffo/miniconda3/envs/ds4bio_new/lib/python3.10/site-packages/matplotlib/cbook.py:1699: ComplexWarning: Casting complex values to real discards the imaginary part
  return math.isfinite(val)
/home/bcaffo/miniconda3/envs/ds4bio_new/lib/python3.10/site-packages/matplotlib/cbook.py:1345: ComplexWarning: Casting complex values to real discards the imaginary part
  return np.asarray(x, float)

Filtering#

Filtering is the process of allowing certain frequency bands to be retained while others to be discarded. Imagine in our case that we want the low frequency band to pass and to get rid of the higher frequency. In this case we want a low pass filter. There’s a lot of ways to filter signals, but let’s just do it by simple thresholding. The slightly tricky thing about this in practical problems, is making sure that you’re filtering at the frequencies that you want to. As an example, we have 1,000 time points. Say one time point is 1/100 of a second so that we have ten second of data. We have two cosine functions, one that is at 5 oscillations per 10 seconds (0.5 Hz) and one at 20 oscillations per 10 seconds (2 hz). Let’s filter out anything ove 0.5 Hz.

## demonstrating hard filtering
a = np.fft.fft(x)
n = a.size
timestep = 1/100
## a function that shows what the frequencies are in the units you want
w = np.fft.fftfreq(n, timestep)


b = a
b[(abs(w) > .5)] = 0
c = np.fft.ifft(b).real
plt.plot(c)
plt.show()

_images/2036cb4bf808ad8de2119cb756db9555314a9fab760210baffb908a044fb06de.png

DFT

Contents