Open AccessAn Improved Non‐CSD 2‐Bit Recursive Common Subexpression Elimination Method to Implement FIR Filter
Author(s) -
Kamal Hassan,
Lee Joohyun,
Koo Bontae
Publication year - 2011
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.11.0110.0642
Subject(s) - finite impulse response , adder , multiplier (economics) , arithmetic , algorithm , mathematics , multiplication (music) , filter (signal processing) , reduction (mathematics) , block (permutation group theory) , filter design , computer science , latency (audio) , telecommunications , combinatorics , geometry , economics , computer vision , macroeconomics
The number of adders and critical paths in a multiplier block of a multiple constant multiplication based implementation of a finite impulse response (FIR) filter can be minimized through common subexpression elimination (CSE) techniques. A two‐bit common subexpression (CS) can be located recursively in a non‐canonic sign digit (CSD) representation of the filter coefficients. An efficient algorithm is presented in this paper to improve the elimination of a CS from the multiplier block of an FIR filter so that it can be realized with fewer adders and low logical depth as compared to the existing CSE methods in the literature. Vinod and others claimed the highest reduction in the number of logical operators (LOs) without increasing the logic depth (LD) requirement. Using the design examples given by Vinod and others, we compare the average reduction in LOs and LDs achieved by our algorithm. Our algorithm shows average LO improvements of 30.8%, 5.5%, and 22.5% with a comparative LD requirement over that of Vinod and others for three design examples. Improvement increases as the filter order increases, and for the highest filter order and lowest coefficient width, the LO improvements are 70.3%, 75.3%, and 72.2% for the three design examples.