Exact and Approximate Algorithms for the Filter Design Optimization Problem

The filter design optimization (FDO) problem is defined as finding a set of filter coefficients that yields a filter design with minimum complexity, satisfying the filter constraints. It has received a tremendous interest due to the widespread application of filters. Assuming that the coefficient multiplications in the filter design are realized under a shift-adds architecture, the complexity is generally defined in terms of the total number of adders and subtractors. In this paper, we present an exact FDO algorithm that can guarantee the minimum design complexity under the minimum quantization value, but can only be applied to filters with a small number of coefficients. We also introduce an approximate algorithm that can handle filters with a large number of coefficients using less computational resources than the exact FDO algorithm and find better solutions than existing FDO heuristics. We describe how these algorithms can be modified to handle a delay constraint in the shift-adds designs of the multiplier blocks and to target different filter constraints and filter forms. Experimental results show the effectiveness of the proposed algorithms with respect to prominent FDO algorithms and explore the impact of design parameters, such as the filter length, quantization value, and filter form, on the complexity and performance of filter designs.

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

[2]  Levent Aksoy,et al.  Search algorithms for the multiple constant multiplications problem: Exact and approximate , 2010, Microprocess. Microsystems.

[3]  H. T. Nguyen,et al.  Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[4]  K. Steiglitz,et al.  Some complexity issues in digital signal processing , 1984 .

[5]  L. Rabiner.  Linear program design of finite impulse response (FIR) digital filters , 1972 .

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

[7]  Low error bit width reduction for structural adders of FIR filters , 2011, 2011 20th European Conference on Circuit Theory and Design (ECCTD).

[8]  Keh-Shew Lu,et al.  DIGITAL FILTER DESIGN , 1973 .

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

[10]  Oscar Gustafsson,et al.  Lower Bounds for Constant Multiplication Problems , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[12]  Levent Aksoy,et al.  ECHO: A novel method for the multiplierless design of constant array vector multiplication , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[13]  L. Rabiner,et al.  A computer program for designing optimum FIR linear phase digital filters , 1973 .

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

[15]  Levent Aksoy,et al.  Finding the optimal tradeoff between area and delay in multiple constant multiplications , 2011, Microprocess. Microsystems.

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

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

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

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

[20]  Kenji Suyama,et al.  Design of CSD coefficient FIR filters based on branch and bound method , 2010, 2010 10th International Symposium on Communications and Information Technologies.

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

[22]  Levent Aksoy,et al.  A Tutorial on Multiplierless Design of FIR Filters: Algorithms and Architectures , 2014, Circuits Syst. Signal Process..

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

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

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

[26]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

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

[28]  In-Cheol Park,et al.  FIR filter synthesis algorithms for minimizing the delay and the number of adders , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

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

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

[31]  Lars Wanhammar.  DSP integrated circuits , 1999 .

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

[33]  Milos D. Ercegovac,et al.  Digital Arithmetic , 2003, Wiley Encyclopedia of Computer Science and Engineering.

[34]  In-Cheol Park,et al.  Digital filter synthesis based on minimal signed digit representation , 2001, DAC '01.

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

[36]  Levent Aksoy,et al.  Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[37]  Mathias Faust,et al.  Pipelined adder graph optimization for high speed multiple constant multiplication , 2012, 2012 IEEE International Symposium on Circuits and Systems.

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

[39]  T NguyenHuy,et al.  Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis , 2000 .

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

[41]  Levent Aksoy,et al.  SIREN: a depth-first search algorithm for the filter design optimization problem , 2013, GLSVLSI '13.

[42]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.