Two-Step Optimization Approach for the Design of Multiplierless Linear-Phase FIR Filters

Deterministic tree search algorithms for the design of multiplierless linear phase finite impulse response filters are generally time consuming. Many researches therefore focus on how to restrict the number of discrete values assigned to each coefficient during a tree search. In this paper, a two-step tree search algorithm is proposed. In the first step, a polynomial-time tree search algorithm where each coefficient is fixed to a single one discrete value is introduced. Since the synthesis of large coefficients is dominant in the hardware cost over small coefficients, in the second step optimization, the small coefficients obtained in the first step is kept unaltered and the large coefficients are further divided into several groups and the coefficients are optimized group by group alternatingly. Such a two-step search strategy maximally utilizes the limited computational resources and can achieve lower hardware cost design in a shorter design time, compared with existing algorithms.

[1]  In-Cheol Park,et al.  FIR Filter Synthesis Based on Interleaved Processing of Coefficient Generation and Multiplier-Block Synthesis , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

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

[4]  Ling Cen.  A hybrid genetic algorithm for the design of FIR filters with SPoT coefficients , 2007, Signal Process..

[5]  Wu-Sheng Lu.  Design of FIR filters with discrete coefficients: a semidefinite programming relaxation approach , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[6]  Levent Aksoy,et al.  Design of low-power multiple constant multiplications using low-complexity minimum depth operations , 2011, GLSVLSI '11.

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

[8]  Yong Lian,et al.  A polynomial-time algorithm for designing FIR filters with power-of-two coefficients , 2002, IEEE Trans. Signal Process..

[9]  Qiang Zhang,et al.  A Novel Hybrid Monotonic Local Search Algorithm for FIR Filter Coefficients Optimization , 2012, IEEE Transactions on Circuits and Systems I: Regular Papers.

[10]  Miodrag Potkonjak,et al.  Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Wu-Sheng Lu.  Design of FIR filters with discrete coefficients via sphere relaxation , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[12]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[13]  Chia-Yu Yao,et al.  Designing Hardware-Efficient Fixed-Point FIR Filters in an Expanding Subexpression Space , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

[14]  Yong Ching Lim,et al.  Design of Linear Phase FIR Filters in Subexpression Space Using Mixed Integer Linear Programming , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

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

[17]  Ya Jun Yu,et al.  A polynomial-time algorithm for the design of multiplierless linear-phase FIR filters with low hardware cost , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[18]  Yong Ching Lim,et al.  Optimization of Linear Phase FIR Filters in Dynamically Expanding Subexpression Space , 2010, Circuits Syst. Signal Process..

[19]  Michele Marchesi,et al.  Applications of simulated annealing for the design of special digital filters , 1992, IEEE Trans. Signal Process..

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

[21]  Arda Yurdakul,et al.  An Algorithm for the Design of Low-Power Hardware-Efficient FIR Filters , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[22]  Andrew G. Dempster,et al.  Designing multiplier blocks with low logic depth , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

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

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

[25]  Ya Jun Yu,et al.  Single-Stage and Cascade Design of High Order Multiplierless Linear Phase FIR Filters Using Genetic Algorithm , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[26]  Wu-Sheng Lu,et al.  Design of FIR digital filters with discrete coefficients via convex relaxation , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[27]  Dong Shi,et al.  Design of Linear Phase FIR Filters With High Probability of Achieving Minimum Number of Adders , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.