FIR Filter Design Based on Successive Approximation of Vectors

摘要

We present a novel method for the design of finite impulse response (FIR) filters with discrete coefficients that belong in the sum of powers-of-two (POT) space. The importance of this class of filters cannot be overstated, given the ever-increasing number of applications for which a specific hardware implementation is needed. Filters that have coefficients that belong to such a class are also referred to as multiplierless filters, given that the operations performed by the filter can all be implemented by using appropriately designed shifts of the input data, making them a perfect choice whenever implementation simplicity and processing speed are the ultimate goal. To produce such a design, we employ a vector successive approximation technique successfully used in data compression that has a very low computational complexity, the Matching Pursuits Generalized BitPlanes algorithm (MPGBP). We derive optimality conditions for the approximation dictionary. We compare filters obtained with the proposed method with those derived in previous works. Based on this comparative analysis, we show that this new and powerful way of producing the filters' coefficients is also among the simplest available in the literature.