Finite word length FIR filter design using integer programming over a discrete coefficient space

It is demonstrated that the improvement achieved by using integer programming over simple coefficient rounding in the design of finite impulse response (FIR) filters with discrete coefficients is most significant when the discrete coefficient space is the powers-of-two space or when a specification is to be met with a given coefficient word length by increasing the filter length. Both minimax and least square error criteria are considered.