Techniques for avoiding sign-extension in multiple constant multiplication

In this work we consider three different techniques for avoiding sign-extension in constant multiplication based on shifts, additions, and subtraction. Especially, we consider the multiple constant multiplication (MCM) problem arising in transposed direct form FIR filters. The main advantage of avoiding sign-extension is the reduced load of the sign-bits. Furthermore, the complexity is slightly reduced as full adders are replaced by half adders or full adders with one constant one input. The proposed techniques can be applied independent of which algorithm was used to solve the MCM problem.

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

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

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

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

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

[6]  O. Gustafsson,et al.  Towards optimal multiple constant multiplication: A hypergraph approach , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[7]  In-Cheol Park,et al.  FIR filter synthesis algorithms for minimizing the delay and the number of adders , 2001 .

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

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

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

[11]  Mathias Faust,et al.  Optimization of structural adders in fixed coefficient transposed direct form FIR filters , 2009, 2009 IEEE International Symposium on Circuits and Systems.

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

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

[14]  O. Gustafsson,et al.  Low-complexity constant coefficient matrix multiplication using a minimum spanning tree approach , 2004, Proceedings of the 6th Nordic Signal Processing Symposium, 2004. NORSIG 2004..

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

[16]  Kaushik Roy,et al.  A graph theoretic approach for synthesizing very low-complexityhigh-speed digital filters , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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