Next  |  Prev  |  Up  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

The Running-Sum Lowpass Filter

Impulse Response:

$\displaystyle h(n) \isdef \left\{\begin{array}{ll}
1, & n=0,1,2,...,N-1 \\ [5pt]
0, & \hbox{otherwise} \\
\end{array} \right.
$

Implementation:

\epsfig{file=eps/blackbox.eps}

\begin{eqnarray*}
y(n) &=& (h\ast x)(n)
\isdef \sum_{m=-\infty}^{\infty} h(m) x(n-m)
= \sum_{m=0}^{N-1} x(n-m)\\
&=& x(n) + x(n-1) + \cdots + x(n-N+1)
\end{eqnarray*}

(``Unnormalized moving average'' FIR filter)



Transfer Function:

$\displaystyle H(z) = 1 + z^{-1}+ \cdots + z^{-N+1} = \frac{1-z^{-N}}{1-z^{-1}}
$


Next  |  Prev  |  Up  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

[Comment on this page via email]

``FFT Signal Processing: The Filter-Bank Summation (FBS) Method for Fourier Analysis, Modification, and Resynthesis'', by Julius O. Smith III, (From Lecture Overheads, Music 421).
Copyright © 2020-06-27 by Julius O. Smith III
Center for Computer Research in Music and Acoustics (CCRMA),   Stanford University
CCRMA  [Automatic-links disclaimer]