Exercise: Sawtooth Wave Fourier Transform: Difference between revisions

From Class Wiki
Jump to navigation Jump to search
No edit summary
Cdxskier (talk | contribs)
No edit summary
 
(7 intermediate revisions by 3 users not shown)
Line 131: Line 131:
<br />
<br />


<math>2\left[\left(\frac{1}{2\pi n}\sin 2\pi n-0\right)-\left[-\left(\frac{1}{2\pi n}\right)^2\cos 2\pi nt\right]_0^1\right]</math>
<math>=2\left[\left(\frac{1}{2\pi n}\sin 2\pi n-0\right)-\left[-\left(\frac{1}{2\pi n}\right)^2\cos 2\pi nt\right]_0^1\right]</math>


<br />
<br />
Line 153: Line 153:
<br />
<br />


The figures below graph the first few iterations of this solution.  The first graph shows the solution truncated after the first 100 terms of the infinite sum, as well as each of the contributing sine waves with offset.  The second figure shows the function truncated after 1, 3, 5, 10, 50, and 100 terms.  These figures were constructed using the following matlab code: [[SawToothFourier]].
==Solution Graphs==
The figures below graph the first few iterations of the above solution.  The first graph shows the solution truncated after the first 100 terms of the infinite sum, as well as each of the contributing sine waves with offset.  The second figure shows the function truncated after 1, 3, 5, 10, 50, and 100 terms.  The last figure shows the Error between the Fourier Series truncated after the first 100 terms and the function itself.  These figures were constructed using the following matlab code: [[SawToothFourier]].


<br />
<br />
Line 161: Line 162:
<br />
<br />
[[Image:First_n_Terms.jpg|thumb|800px|center]]
[[Image:First_n_Terms.jpg|thumb|800px|center]]
<br />
[[Image:Error.jpg|thumb|800px|center]]
<br />
[[Image:Sawtooth.gif|thumb|800px|Solution as number of terms varies from 1 to 30.|center]]


==Author==
==Author==
Line 167: Line 175:


==Read By==
==Read By==
 
[[Lau, Chris|Christopher Garrison Lau I]]
==Reviewed By==
==Reviewed By==
Colby Fullerton
*[[Vier, Michael | Michael Vier]]

Latest revision as of 21:37, 17 January 2010

Problem Statement

Find the Fourier Tranform of the sawtooth wave given by the equation


x(t)=tt



Solution

As shown in class, the general equation for the Fourier Transform for a periodic function with period T is given by


x(t)=a02+n=1[ancos2πntT+bnsin2πntT]


where


{an=2Tcc+Tx(t)cos2πntTdtbn=2Tcc+Tx(t)sin2πntTdtn=0,1,2,3


For the sawtooth function given, we note that T=1, and an obvious choice for c is 0 since this allows us to reduce the equation to x(t)=t. It remains, then, only to find the expression for an and bn. We proceed first to find bn.


bn=2101tsin2πntdt


which is solved easiest with integration by parts, letting


u=tdu=dt


dv=sin2πntdtv=12πncos2πnt


so


bn=2[t(12πn)cos2πnt|01+12πn01cos2πntdt]


=2[(12πncos2πn0)+(12πn)2sin2πnt|01]


=2[12πn(1)+0]


=1πn

Now, for an we must consider the case when n=0 separately.


a0=2101tdt=t2|01=1


For n=1,2,3, we have


an=2101tcos2πntdt


which again is best solved using integration by parts, this time with


u=tdu=dt


dv=cos2πntdtv=12πnsin2πnt


so


an=2[t(12πn)sin2πnt|010112πnsin2πntdt]


=2[(12πnsin2πn0)[(12πn)2cos2πnt]01]


=2[0+(12πn)2(cos2πncos0)]


=0


Therefore, the Fourier Transform representation of the sawtooth wave given is:


x(t)=12n=11πnsin2πnt


Solution Graphs

The figures below graph the first few iterations of the above solution. The first graph shows the solution truncated after the first 100 terms of the infinite sum, as well as each of the contributing sine waves with offset. The second figure shows the function truncated after 1, 3, 5, 10, 50, and 100 terms. The last figure shows the Error between the Fourier Series truncated after the first 100 terms and the function itself. These figures were constructed using the following matlab code: SawToothFourier.


Error creating thumbnail: File missing


Error creating thumbnail: File missing


Error creating thumbnail: File missing


Solution as number of terms varies from 1 to 30.

Author

John Hawkins

Read By

Christopher Garrison Lau I

Reviewed By

Colby Fullerton