By Topic

A New Binary Common Subexpression Elimination Method for Implementing Low Complexity FIR Filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Smitha, K.G. ; Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore ; Vinod, A.P.

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.

Published in:

Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on

Date of Conference:

27-30 May 2007