FIR Filter: Difference between revisions

From Class Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 2: Line 2:


<center>
<center>
<math> \sum_{l= -\infty}^ \infty h( \frac{l T}{2} ) \delta (t- \frac{l T}{2} ) * \sum_{k= -\infty}^ \infty x( k T ) \delta (t- k T )</math>
<math> \sum_{l= -\infty}^ \infty h \left ( \frac{l T}{2} \right ) \delta \left ( t- \frac{l T}{2} \right ) * \sum_{k= -\infty}^ \infty x( k T ) \delta (t- k T )</math>
</center>
</center>


Line 9: Line 9:
<center>
<center>
<math> \sum_{l= -M}^ M h( \frac{l T}{2} ) \delta (t- \frac{l T}{2} ) * \sum_{k= -\infty}^ \infty x( k T ) \delta (t- k T )</math>.
<math> \sum_{l= -M}^ M h \left ( \frac{l T}{2} \right ) \delta \left (t- \frac{l T}{2} \right ) * \sum_{k= -\infty}^ \infty x( k T ) \delta (t- k T )</math>


<math> \int_{-\infty}^{\infty} \sum_{l= -M}^ M h( \frac{l T}{2} ) \delta (\tau - \frac{l T}{2} ) \sum_{k= -\infty}^ \infty x( k T ) \delta (t- \tau - k T ) \, d \tau</math>.
<math> \int_{-\infty}^{\infty} \sum_{l= -M}^ M h \left ( \frac{l T}{2} \right ) \delta \left ( \tau - \frac{l T}{2} \right ) \sum_{k= -\infty}^ \infty x( k T ) \delta (t- \tau - k T ) \, d \tau</math>


<math> \sum_{k= -\infty}^ \infty \sum_{l= -M}^ M h( \frac{l T}{2} ) x( k T ) \int_{-\infty}^{\infty} \delta (\tau - \frac{l T}{2} ) \delta (t- \tau - k T ) \, d \tau</math>.
<math> \sum_{k= -\infty}^ \infty \sum_{l= -M}^ M h \left ( \frac{l T}{2} \right ) x( k T ) \int_{-\infty}^{\infty} \delta \left (\tau - \frac{l T}{2} \right ) \delta (t- \tau - k T ) \, d \tau</math>


<math> \sum_{k= -\infty}^ \infty \sum_{l= -M}^ M h\left ( \frac{l T}{2} \right ) x( k T ) \delta \left ( t- \frac{l T}{2} - k T \right ) </math>

Let <math> n=2k+l\, </math> so <math> k=\frac{n-l}{2}</math>

<math> \sum_{n= -\infty}^ \infty \sum_{l= -M}^ M h\left ( \frac{l T}{2} \right ) x\left ( \frac{n-l}{2} T \right ) \delta \left (t- \frac{nT}{2} \right ) </math>


</center>
</center>

Revision as of 16:05, 10 December 2004

A FIR filter is a type of digital interpolating filter. We will be looking at its use to both distort and interpolate a digital signal as in a CD Player. Mathematically this this is done by the following convolution:

Where the term on the left is ther filter and the term of the right is you data. So how do we do an infinite sum in a computer? Well we can't because we can't fit an infinite amount of data in a computer, so we have to trim it down. The above sum for the filter is the impulse responce of the filter. This is an infinite sum, and for your filter to work exactly as described you would need all of the terms. Since that is not possible you want to keep as many of the most important terms as you can. The most important terms are the ones centered around zero. So if you wanted three terms they would be and if you wanted 5 terms etc. Once you have your filter limited to a certain number of terms you can proceed as follows with the convolution.


Let so