Copyright	(c) Matthew Donadio 2003
License	GPL
Maintainer	m.p.donadio@ieee.org
Stability	experimental
Portability	portable
Safe Haskell	Safe
Language	Haskell98

DSP.Filter.FIR.FIR

Description

Finite Impuse Response filtering functions

Synopsis

fir :: (Num a, Eq a) => Array Int a -> [a] -> [a]
test :: Bool

Documentation

fir Source #

Arguments

:: (Num a, Eq a)
=> Array Int a	h[n]
-> [a]	x[n]
-> [a]	y[n]

Implements the following function, which is a FIR filter

y[n] = sum(k=0,M) h[k]*x[n-k]

We implement the fir function with five helper functions, depending on the type of the filter. In the following functions, we use the O&S convention that m is the order of the filter, which is equal to the number of taps minus one.

test :: Bool Source #