On “A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters”

A thorough analysis of the paper above revealed several controversial arguments about the superiority of binary representation over canonical signed digits (CSD) for common subexpression elimination (CSE). It was improper to model the number of logic operators (LO) required after CSE as a linear sum of independently weighted numbers of nonzero bits, common subexpressions and unpaired bits. The logic depth (LD) penalty of binary CSE had been deemphasized by the errors in the reported LD. This comment corrects the LD of contention resolution algorithm, and points out some contradictions with reference to the latest experimentation of binary, CSD and minimal signed digit number representations for CSE. Upon correcting the error in the reported filter lengths for different stopband attenuations of digital advanced mobile phone system specification, the LO and LD data of the CSE algorithms compared in the above paper are recalculated using the corrected filter coefficient sets.

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

[2]  Lawrence R. Rabiner,et al.  The predictability of certain optimum finite-impulse-response digital filters , 1973 .

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

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

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

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

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

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

[9]  Chip-Hong Chang,et al.  Information Theoretic Approach to Complexity Reduction of FIR Filter Design , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[11]  Paulo F. Flores,et al.  An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[12]  Chip-Hong Chang,et al.  Contention Resolution—A New Approach to Versatile Subexpressions Sharing in Multiple Constant Multiplications , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[13]  A. Prasad Vinod,et al.  Low Power Realization and Synthesis of Higher-Order FIR Filters Using an Improved Common Subexpression Elimination Method , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[14]  Levent Aksoy,et al.  Effect of Number Representation on the Achievable Minimum Number of Operations in Multiple Constant Multiplications , 2007, 2007 IEEE Workshop on Signal Processing Systems.

[15]  Chip-Hong Chang,et al.  Contention resolution algorithm for common subexpression elimination in digital filter design , 2005, IEEE Trans. Circuits Syst. II Express Briefs.

[16]  A. Prasad Vinod,et al.  A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.