Fourier series - by Ray Betz: Difference between revisions

From Class Wiki
Jump to navigation Jump to search
SDiver (talk | contribs)
SDiver (talk | contribs)
Line 77: Line 77:


<math> X(f) = \mathcal{F}^{-1}[x(t)] = \int_{-\infty}^\infty  x(t) e^ {j 2 \pi f t} dt</math>
<math> X(f) = \mathcal{F}^{-1}[x(t)] = \int_{-\infty}^\infty  x(t) e^ {j 2 \pi f t} dt</math>
We can take the derivitive of <math> x(t) </math> and then put in terms of the reverse fourier transform. 
<math> \frac{dx}{dt} = \int_{-\infty}^\infty  j 2 \pi f X(f) e^ {j 2 \pi f t} df = \mathcal{F}^{-1}[j 2 \pi f X(f)]
</math>

Revision as of 14:35, 20 October 2005

Fourier Series

If

  1. x(t)=x(t+T)
  2. Dirichlet conditions are satisfied

then we can write

x(t)=∑k=−∞∞αkej2πktT

The above equation is called the complex fourier series. Given x(t), we may determine αk by taking the inner product of αk with x(t). Let us assume a solution for αk of the form ej2πntT. Now we take the inner product of αk with x(t). <αk|x(t)>=<ej2πntT|∑k=−∞∞αkej2πktT> =∫−T2T2x(t)e−j2πntTdt =∫−T2T2∑k=−∞∞αkej2πktTe−j2πntTdt =∑k=−∞∞αk∫−T2T2ej2π(k−n)tTdt

If k=n then,

∑k=−∞∞αk∫−T2T2ej2π(k−n)tTdt=∫−T2T21dt=T

If k≠n then,

∑k=−∞∞αk∫−T2T2ej2π(k−n)tTdt=0

We can simplify the above two conclusion into one equation.

∑k=−∞∞αk∫−T2T2ej2π(k−n)tTdt=∑k=−∞∞Tδk,nαk=Tαn

So, we may conclude αn=1T∫−T2T2x(t)e−j2πntTdt

Orthogonal Functions

The function yn(t) and ym(t) are orthogonal on (a,b) if and only if <yn(t)|ym(t)>=∫abyn*(t)ym(t)dt=0.

The set of functions are orthonormal if and only if <yn(t)|ym(t)>=∫abyn*(t)ym(t)dt=δm,n.

Linear Systems

I may come back to this latter...

Fourier Series (indepth)

I would like to take a closer look at αk in the Fourier Series. Hopefully this will provide a better understanding of αk.

We will seperate x(t) into three parts; where αk is negative, zero, and positive. x(t)=∑k=−∞∞αkej2πktT=∑k=−∞−1αkej2πktT+α0+∑k=1∞αkej2πktT

Now, by substituting n=−k into the summation where k is negative and substituting n=k into the summation where k is positive we get: ∑k=1∞α−ne−j2πntT+α0+∑k=1∞αnej2πntT

Recall that αn=1T∫−T2T2x(u)e−j2πntTdt

If x(t) is real, then αn*=α−n. Let us assume that x(t) is real.

x(t)=α0+∑n=1∞(αnej2πntT+αn*e−j2πntT)

Recall that y+y*=2Re(y) Here is further clarification on this property

So, we may write:

x(t)=α0+∑n=1∞2Re(αnej2πntT)

Fourier Transform

Fourier transforms emerge because we want to be able to make Fourier expressions of non-periodic functions. We can take the limit of those non-periodic functions to get a fourier expression for the function.

Remember that: x(t)=x(t+T)=∑k=−∞∞αkej2πktT=∑k=−∞∞1/T∫−T2T2x(u)e−j2πkuTduej2πktT


So, limx→∞x(t)=∫−∞∞(∫−∞∞x(u)e−j2πfudu)ej2πftdf

From the above limit we define x(t) and X(f).

x(t)=ℱ−1[X(f)]=∫−∞∞X(f)ej2πftdf

X(f)=ℱ−1[x(t)]=∫−∞∞x(t)ej2πftdt

We can take the derivitive of x(t) and then put in terms of the reverse fourier transform.

dxdt=∫−∞∞j2πfX(f)ej2πftdf=ℱ−1[j2πfX(f)]