Computationally Efficient MultiplierFree Fir Filter Design
This paper presents a very simple multiplier-free finite impulse response (FIR) lowpass filter design procedure. It involves approximation of an equiripple FIR by rounding operation and application of the sharpening technique. In that way the overall filter is based on combining one simple filter wi...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2007 |
| País: | México |
| Institución: | Instituto Nacional de Astrofísica, Óptica y Electrónica |
| Repositorio: | Redalyc-INAOE |
| OAI Identifier: | oai:redalyc.org:61509804 |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=61509804 |
| Access Level: | acceso abierto |
| Palabra clave: | Computación rounding FIR filter sharpening multiplier free filter |
| Sumario: | This paper presents a very simple multiplier-free finite impulse response (FIR) lowpass filter design procedure. It involves approximation of an equiripple FIR by rounding operation and application of the sharpening technique. In that way the overall filter is based on combining one simple filter with integer coefficients. The parameters of the design are the rounding constant and the parameters of the sharpening polynomials such as the order of tangencies m and l. Our analysis indicates that utilizing this approach the required number of total nonzero bits becomes quite low and less than in the minimum number of signed powers-of-two (MNSPT) design. The cost is the increase of the total numbers of sums and the delays. |
|---|