Bit-Level Multiplierless FIR Filter Optimization Incorporating Sparse Filter Technique

Multiplierless FIR filter optimization has been extensively studied in the past decades to minimize the number of adders. A more accurate measurement of the implementation complexity is the number of full adders counted at bit-level. However, the high computational complexity of the optimization at bit-level hinders the technique from practical applications. In this paper, the sparse filter technique is exploited and makes the search space at bit-level significantly reduced. Thus, the bit-level optimization of multiplierless FIR filters for the first time becomes possible. When the sparse filter technique is employed for the multiplierless filter design, the sparsity of the filter is properly controlled so that the feasibility of the bit-level optimization in discrete space is maintained. Thereafter, in the reduced search space, a tree search algorithm is formulated at bit-level, and techniques to estimate the bit level hardware cost and to accelerate the search are presented. Design examples show that the proposed bit-level optimization method generates designs with lower hardware cost and power consumption than that of the best word-level optimization methods, while the design time is still at an acceptable level. The average power savings to 3 recent published techniques are 13.6%, 8.0% and 26.1%, respectively.

[1]  Linda S. DeBrunner,et al.  Design of multiplierless FIR filters with an adder depth versus filter order trade-off , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[2]  Yu Pan,et al.  Bit-Level Optimization of Adder-Trees for Multiple Constant Multiplications for Efficient FIR Filter Implementation , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  Thomas A. Baran,et al.  Linear Programming Algorithms for Sparse Filter Design , 2010, IEEE Transactions on Signal Processing.

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

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

[6]  O. Gustafsson,et al.  A novel approach to multiple constant multiplication using minimum spanning trees , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..

[7]  Mathias Faust,et al.  Minimal Logic Depth adder tree optimization for Multiple Constant Multiplication , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

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

[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]  A. Dempster,et al.  Use of minimum-adder multiplier blocks in FIR digital filters , 1995 .

[11]  Levent Aksoy,et al.  Optimization of Area in Digital FIR Filters using Gate-Level Metrics , 2007, 2007 44th ACM/IEEE Design Automation Conference.

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

[13]  T. Saramaki,et al.  Multiplication-Free Polynomial-Based FIR Filters with an Adjustable Fractional Delay , 2006 .

[14]  S. Mitra,et al.  Interpolated finite impulse response filters , 1984 .

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

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

[17]  Yong Hoon Lee,et al.  Design of sparse FIR filters based on branch-and-bound algorithm , 1997, Proceedings of 40th Midwest Symposium on Circuits and Systems. Dedicated to the Memory of Professor Mac Van Valkenburg.

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

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

[20]  Hon Keung Kwan,et al.  Peak-Error-Constrained Sparse FIR Filter Design Using Iterative SOCP , 2012, IEEE Transactions on Signal Processing.

[21]  Andrew G. Dempster,et al.  Power analysis of multiplier blocks , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

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

[23]  Lars Wanhammar,et al.  Minimum adder depth multiple constant multiplication algorithm for low power FIR filters , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

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

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

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

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

[28]  Yong Hoon Lee,et al.  Design of nonuniformly spaced linear-phase FIR filters using mixed integer linear programming , 1996, IEEE Trans. Signal Process..

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

[30]  Sanjit K. Mitra,et al.  Design of computationally efficient interpolated fir filters , 1988 .

[31]  Yoram Bresler,et al.  Recursive image registration with application to motion estimation , 1987, IEEE Trans. Acoust. Speech Signal Process..

[32]  Yong Ching Lim,et al.  Frequency-response masking approach for the synthesis of sharp linear phase digital filters , 1986 .

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

[34]  Andrew G. Dempster,et al.  Transition analysis on FPGA for multiplier-block based FIR filter structures , 2000, ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445).

[35]  O. Gustafsson,et al.  Improved multiple constant multiplication using a minimum spanning tree , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[36]  Ya Jun Yu,et al.  Sparse FIR filter design based on Genetic Algorithm , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

[37]  Yong Lian,et al.  The optimum design of one- and two-dimensional FIR filters using the frequency response masking technique , 1993 .

[38]  Oscar Gustafsson,et al.  A Difference Based Adder Graph Heuristic for Multiple Constant Multiplication Problems , 2007, 2007 IEEE International Symposium on Circuits and Systems.

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

[40]  P. Flores,et al.  An Exact Breadth-First Search Algorithm for the Multiple Constant Multiplications Problem , 2008, 2008 NORCHIP.

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

[42]  Takao Hinamoto,et al.  Digital filters with sparse coefficients , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[43]  Lars Wanhammar,et al.  Bit-Level Optimization of Shift-and-Add Based FIR Filters , 2007, 2007 14th IEEE International Conference on Electronics, Circuits and Systems.

[44]  Dong Shi,et al.  Design of Discrete-Valued Linear Phase FIR Filters in Cascade Form , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

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