I/sup 2/CRA: contention resolution algorithm for intra- and inter-coefficient common subexpression elimination

Effective common subexpression extraction has become an eminent means to eliminate redundant computations in multiple constant multiplication problems. Prevailing common subexpression elimination (CSE) algorithms use horizontal common subexpressions predominantly due to the symmetry of linear phase FIR filters. This paper presents a new contention resolution algorithm (CRA), called the I/sup 2/CRA that exploits both the intra- and inter-coefficient redundancy to reduce the logic depth and logic complexity further. Unlike the statistical based CSE, I/sup 2/CRA allows a selected common subexpressions to be freed in case of conflicts. By endowing the basic CRA with the prowess to handle common subexpressions in both dimensions in a comprehensive manner, the essentiality of vertical and oblique common subexpressions has been manifested.

[1]  Chip-Hong Chang,et al.  A new contention resolution algorithm for the design of minimal logic depth multiplierless filters , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

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

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

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

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

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

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

[8]  Chip-Hong Chang,et al.  Efficient algorithms for common subexpression elimination in digital filter design , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

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