Title :
A New Binary Common Subexpression Elimination Method for Implementing Low Complexity FIR Filters
Author :
Smitha, K.G. ; Vinod, A.P.
Author_Institution :
Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore
Abstract :
The complexity of finite impulse response (FIR) filters is dominated by the number of adders (subtractors) used to implement the coefficient multipliers. It is well known that common subexpression flimination (CSE) method based on canonic signed digit (CSD) representation considerably reduces the number of adders in coefficient multipliers. Recently, a binary based CSE (BSE) technique was proposed, which produced better reduction of adders compared to the CSD based CSE. In this paper, we propose a new 4-bit Binary based CSE (BCSE) method which employs 4-bit common subexpressions (CSs). Design examples show an average adder reduction of 31.2 % over the conventional CSD based CSE and 15% reduction over BSE.
Keywords :
FIR filters; adders; multiplying circuits; 4 bit; adders; binary based CSE method; binary common subexpression elimination method; canonic signed digit; coefficient multipliers; common subexpression flimination; common subexpressions; finite impulse response filters; subtractors; Cascading style sheets; Filtering; Finite impulse response filter; Hardware; Logic; Matched filters; Mobile communication; Pulse shaping methods;
Conference_Titel :
Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on
Conference_Location :
New Orleans, LA
Print_ISBN :
1-4244-0920-9
Electronic_ISBN :
1-4244-0921-7
DOI :
10.1109/ISCAS.2007.378854
