About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
A computationally efficient decimation filter design for embedded systems
Abstract
As analog-to-digital converters become faster, this will allow them to become closer to their intended sensor. This will foster an environment that will continue to allow a paradigm shift in which digital systems replace analog ones, thus mitigating many non-ideal effects. In parallel with this trend, the importance of decimation filters will continue to expand - as the high speed data will need to be down-sampled prior to a decision making element, such as a digital signal processor (running CFAR algorithms, neural networks [1], and the like). Ideally, these decimation filters should have as much stop-band attenuation as possible. However, on a fixed point processor, like an FPGA, the finite word-length effects are in opposition to this goal. To break this nexus, this paper employs an integerization technique and explores how these integerized implementations improve performance in embedded systems. This technology creates fixed integer transforms with computationally optimal representations.