By Topic

Performance limit of finite wordlength FIR digital filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. M. Kodek ; Fac. of Comput. & Inf. Sci., Univ. of Ljubljana, Slovenia

In many practical situations, it is necessary to represent the coefficients of a finite impulse response (FIR) digital filter by a finite number of bits. This not only degrades the filter frequency response but also introduces a theoretical limit on the performance of the filter. Derivation of a lower bound on filter degradation is the purpose of this paper. We consider a general case of a length N filter with a discrete set of allowable coefficients. A theorem that gives the lower bound on the increase in minimax approximation error that is caused by the finite wordlength restriction is presented. Its extension and application to filter design cases is demonstrated. The importance of this bound is not only theoretical. Its practical effectiveness is shown in the algorithm for optimal finite wordlength FIR filter design where it significantly reduces the amount of computation.

Published in:

IEEE Transactions on Signal Processing  (Volume:53 ,  Issue: 7 )