Design of Linear Phase FIR Filters in Subexpression Space Using Mixed Integer Linear Programming

In this paper, a novel optimization technique is proposed to optimize filter coefficients of linear phase finite-impulse response (FIR) filter to share common subexpressions within and among coefficients. Existing approaches of common subexpression elimination optimize digital filters in two stages: first, an FIR filter is designed in a discrete space such as finite wordlength space or signed power-of-two (SPT) space to meet a given specification; in the second stage, an optimization algorithm is applied on the discrete coefficients to find and eliminate the common subexpressions. Such a two-stage optimization technique suffers from the problem that the search space in the second stage is limited by the finite wordlength or SPT coefficients obtained in the first stage optimization. The new proposed algorithm overcomes this problem by optimizing the filter coefficients directly in subexpression space for a given specification. Numerical examples of benchmark filters show that the required number of adders obtained using the proposed algorithm is much less than those obtained using two-stage optimization approaches.

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

[2]  Yong Ching Lim,et al.  Signed power-of-two term allocation scheme for the design of digital filters , 1999 .

[3]  Kaushik Roy,et al.  CSDC: a new complexity reduction technique for multiplierless implementation of digital FIR filters , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[4]  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..

[5]  David Bull,et al.  Primitive operator digital filters , 1991 .

[6]  Chip-Hong Chang,et al.  Design of Low-Complexity FIR Filters Based on Signed-Powers-of-Two Coefficients With Reusable Common Subexpressions , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Chiang-Ju Chien,et al.  A novel common-subexpression-elimination method for synthesizing fixed-point FIR filters , 2004, IEEE Trans. Circuits Syst. I Regul. Pap..

[8]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[9]  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).

[10]  In-Cheol Park,et al.  Digital filter synthesis based on an algorithm to generate all minimal signed digit representations , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Andrew G. Dempster,et al.  Multiplierless FIR filter design algorithms , 2005, IEEE Signal Processing Letters.

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

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

[14]  L. Wanhammar,et al.  Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm , 2002 .

[15]  Yong Ching Lim,et al.  Design of discrete-coefficient FIR filters on loosely connected parallel machines , 2002, IEEE Trans. Signal Process..

[16]  Chip-Hong Chang,et al.  Contention resolution algorithm for common subexpression elimination in digital filter design , 2005, IEEE Trans. Circuits Syst. II Express Briefs.

[17]  Yong Ching Lim,et al.  Roundoff Noise Analysis of Signals Represented Using Signed Power-of-Two Terms , 2007, IEEE Transactions on Signal Processing.

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

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

[20]  Lars Wanhammar,et al.  ILP modelling of the common subexpression sharing problem , 2002, 9th International Conference on Electronics, Circuits and Systems.

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

[22]  Markus Püschel,et al.  Multiplierless multiple constant multiplication , 2007, TALG.