4 Discrete Fourier Transformation

1 Discrete Fourier Transformation

Denote cf=(cos⁡(2πft),t=0,1,⋯,n−1), and sf=(sin⁡(2πft),t=0,1,⋯,n−1).

cos⁡(2πft)=e2πift+e−2πift2,sin⁡(2πft)=e2πift−e−2πift2i.

Denote uf=(exp⁡(2πift),t=0,1,⋯,n−1). f=0,1n,2n,⋯,n−1n.

Fact

u0,u1n,⋯,un−1n forms an orthogonal basis for Cn.

Now, given time series data y0,y1,⋯,yn−1. Because u0,u1n,⋯,un−1n form a basis, y=a0u0+a1u1n+⋯+an−1un−1n, for some a0,a1,⋯,an−1∈C. Then ⟨y,ujn⟩=⟨a0u0+a1u1n+⋯+an−1un−1n,ujn⟩=
Here aj=1n⟨y,u1n⟩. So define discrete Fourier Transform (DFT) of y=(y0,⋯,yn−1): (yi∈R) bj=⟨y,ujn⟩=∑t=0n−1ytexp⁡(−2πijnt)=∑t=0n−1ytcos⁡(2πjnt)−i∑t=0n−1ytsin⁡(2πjnt),j=0,1,⋯,n−1.
We can use np.fft.fft() to compute it.

Example

y=(2,−5,3,0), n=4. Then b0=⟨y,u0⟩=⟨y,(1,1,1,1)⟩=y0+y1+y2+y3=0,b1=⟨y,u1n⟩=y0+y1e−2π1n+y2e−2π1n2+y3e−2π1n3.

1.1 Properties of DFT

  1. b0=∑t=0n−1yt=y0+⋯+yn−1.
  2. \begin{align*}

&= \overline{\sum_{t=0}^{n-1}y_{t}\exp \left(-2\pi \mathrm{i} \frac{j}{n}\right)t}=\overline{b_{j}}.
\end{align*}$$

Inverse DFT

The formula is given by yt=1n∑j=0n−1bjexp⁡(2πijtn).

2 Periodogram

Define periodogram I(jn)=|bj|2n,0<jn<12.

Since bj=∑t=0n−1ytexp⁡(−2πijtn)=∑t=0n−1yt(cos⁡2πjtn−isin⁡2πjtn), periodogram can be written as I(jn)=1n[(∑t=0n−1ytcos⁡2πjtn)2+(∑t=0n−1ytsin⁡2πjtn)2],0<jn≤12.

Use of periodogram:

  1. If you are trying to fit yt=β0+β1cos⁡2πft+β2sin⁡2πft+εt, we know by here posterior(f)∝(1RSS(f))n−32|XfTXf|−12I{0<f<12}. If you use Fourier frequencies, F={1n,⋯,[n/2]2}, then RSS(f)=∑t=1n(yt−y―)2−2I(f).

  2. Periodogram can suggest other models for the data. For yt=β0+β1cos⁡2πf1t+β2sin⁡2πf1t+β3cos⁡2πf2t+β4sin⁡2πf2t+εt.