Contention Resolution—A New Approach to Versatile Subexpressions Sharing in Multiple Constant Multiplications

Multiple constant multiplications (MCM) have been a core operation in many digital signal processing applications. In this paper, an efficient generalized contention resolution algorithm (CRA) is proposed to eliminate three broad categories of reusable common subexpressions in MCM. The idea is to revert a precedential decision of suboptimal common subexpressions by a localized cost function evaluation when there is a conflict between two competitive subexpressions. The proposed derivatives of the basic CRA are versatile in that they are capable of satisfying search for both intra- and intercoefficient subexpressions, in any legitimate composition of horizontal, vertical and oblique subexpressions. As the algorithms expand the common subexpressions to higher-weight only when there is cost saving, the logic depth can be controlled by constraining the weights of the subexpressions. The variants of CRA follow an important tenet of good heuristic that significant improvement in the solution quality is attained with increased problem size but the computational time remains well bounded. Experimental results with both benchmark filters and randomly generated coefficient sets are analyzed and compared with a number of well known common subexpression elimination methods to demonstrate the effectiveness and efficiency of our proposed approach.

[1]  A. P. Vinod,et al.  FIR filter implementation by efficient sharing of horizontal and vertical common subexpressions , 2003 .

[2]  James E. Gunn,et al.  A low-power DSP core-based software radio architecture , 1999, IEEE J. Sel. Areas Commun..

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

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

[5]  A. Prasad Vinod,et al.  On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  H. Samueli.  The design of multiplierless digital data transmission filters with powers-of-two coefficients , 1990, SBT/IEEE International Symposium on Telecommunications.

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

[8]  Youngbeom Jang,et al.  Low-power CSD linear phase FIR filter structure using vertical common sub-expression , 2002 .

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

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

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

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

[13]  Andrew G. Dempster,et al.  Efficient interpolators and filter banks using multiplier blocks , 2000, IEEE Trans. Signal Process..

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

[15]  R. M. Hewlitt,et al.  Canonical signed digit representation for FIR digital filters , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[16]  H. Samueli,et al.  Design techniques for silicon compiler implementations of high-speed FIR digital filters , 1996 .

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

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

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

[20]  Hyeong-Ju Kang,et al.  Digital filter synthesis based on minimal signed digit representation , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[21]  Ravinder David Koilpillai,et al.  Software radio issues in cellular base stations , 1999, IEEE J. Sel. Areas Commun..

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

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

[24]  Shyh-Jye Jou,et al.  Low-power multiplierless FIR filter synthesizer based on CSD code , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

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

[26]  Arda Yurdakul,et al.  Multiplierless Realization of Linear DSP Transforms by Using Common Two-Term Expressions , 1999, J. VLSI Signal Process..

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

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