Design of highspeed multiplierless filters using a nonrecursive signed common subexpressio.pdfVIP

196 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL. 49, NO. 3, MARCH 2002 Design of High-Speed Multiplierless Filters Using a Nonrecursive Signed Common Subexpression Algorithm Marcos Martínez-Peiró, Eduardo I. Boemo, and Lars Wanhammar, Member, IEEE Abstract—In this work, a new algorithm called nonrecur- sive signed common subexpression elimination (NR-SCSE) is discussed, and several applications in the area of multiplierless finite-impulse response (FIR) filters are developed. While the recursive utilization of a common subexpression generates a high logic depth into the digital structure, the NR-SCSE algorithm allows the designer to overcome this problem by using each subexpression once. The paper presents a complete description Fig. 1. Implementation of the coefficienty using the CSE method. of the algorithm, and a comparison with two other well-known options: the graph synthesis, and the classical common subexpres- sion elimination technique. Main results show that the NR-SCSE implementations of several benchmark circuits offer the best relation between occupied area and logic depth respect to the previous values published in the technical literature. Index Terms—Common subexpression elimination, finite-im- pulse response (FIR) filtering, multiplierless algorithm. I. INTRODUCTION Fig. 2. CSE with a pipeline implementation of two coefficients. HE multiplication of a variable (data input) by a set of Tconstants (finite-impulse response (FIR) filtering, DCT, FFT, etc.) is a central o