An Algorithm for the Design of Low-Power Hardware-Efficient FIR Filters

A novel algorithm for designing low-power and hardware-efficient linear-phase finite-impulse response (FIR) filters is presented. The algorithm finds filter coefficients with reduced number of signed-power-of-two (SPT) terms given the filter frequency response characteristics. The algorithm is a branch-and-bound-based algorithm that fixes a coefficient to a certain value. The value is determined by finding the boundary values of the coefficient using linear programming. Although the worst case run time of the algorithm is exponential, its capability to find appreciably good solutions in a reasonable amount of time makes it a desirable CAD tool for designing low-power and hardware-efficient filters. The superiority of the algorithm on existing methods in terms of SPT term count, design time, hardware complexity, and power performance is shown with several design examples. Up to 30% reduction in the number of SPT terms is achieved over unoptimized Remez coefficients, which is 20% better than compared optimization methods. The average power saving is 20% over unoptimized coefficients, which is up to 14% better than optimized coefficients obtained with existing methods.

[1]  Tapio Saramäki,et al.  A systematic algorithm for the design of multiplierless FIR filters , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[2]  Lars Wanhammar,et al.  An MILP Approach for the Design of Linear-Phase FIR Filters with Minimum Number of Signed-Power-of-Two Terms , 2001 .

[3]  O. Gustafsson,et al.  Design of linear-phase FIR filters combining subexpression sharing with MILP , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..

[4]  Yong Ching Lim,et al.  A polynomial-time algorithm for designing digital filters with power-of-two coefficients , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[5]  Chao-Liang Chen,et al.  A trellis search algorithm for the design of FIR filters with signed-powers-of-two coefficients , 1999 .

[6]  A. Prasad Vinod,et al.  On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Chiang-Ju Chien,et al.  A Partial MILP Algorithm for the Design of Linear Phase FIR Filters with SPT Coefficients , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[8]  Arda Yurdakul.  Fast and E cient Algorithm for the Multiplierless Realiza-tion of Linear DSP Transforms , 2002 .

[9]  Yoshiaki Tadokoro,et al.  A simple design of FIR filters with powers-of-two coefficients , 1988 .

[10]  Patrick Schaumont,et al.  A new algorithm for elimination of common subexpressions , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Y. Lim,et al.  Discrete coefficient FIR digital filter design based upon an LMS criteria , 1983 .

[12]  Y. Lim.  Design of discrete-coefficient-value linear phase FIR filters with optimum normalized peak ripple magnitude , 1990 .

[13]  R. Hartley.  Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[14]  H. Samueli,et al.  An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients , 1989 .

[15]  O. Gustafsson,et al.  A detailed complexity model for multiple constant multiplication and an algorithm to minimize the complexity , 2005, Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005..

[16]  Y. Lim,et al.  FIR filter design over a discrete powers-of-two coefficient space , 1983 .

[17]  D. Kodek.  Design of optimal finite wordlength FIR digital filters using integer programming techniques , 1980 .