Low Power Realization and Synthesis of Higher-Order FIR Filters Using an Improved Common Subexpression Elimination Method

Authors:
K.G. Smitha;A.P. Vinod
Affiliations:
-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 10
Cited 1

Efficient substitution of multiple constant multiplications by shifts and additions using iterative pairwise matching

DAC '94 Proceedings of the 31st annual Design Automation Conference
Synthesis of multiplier-less FIR filters with minimum number of additions

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Digital signal processing (3rd ed.): principles, algorithms, and applications

Digital signal processing (3rd ed.): principles, algorithms, and applications
Digital filter synthesis based on minimal signed digit representation

Proceedings of the 38th annual Design Automation Conference
Multiplierless multiple constant multiplication

ACM Transactions on Algorithms (TALG)
Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A new algorithm for elimination of common subexpressions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the implementation of efficient channel filters for wideband receivers by optimizing common subexpression elimination methods

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A New Common Subexpression Elimination Algorithm for Realizing Low-Complexity Higher Order Digital Filters

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Software radio issues in cellular base stations

IEEE Journal on Selected Areas in Communications

On "A new common subexpression elimination algorithm for realizing low-complexity higher order digital filters"

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of Finite Impulse Response (FIR) filters is mainly dominated by the number of adders (subtractors) used to implement the coefficient multipliers. It is well known that Common Subexpression Elimination (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 representation-based CSE (BCSE-4) method which employs 4-bit Common Subexpressions (CSs) for implementing higher order low-power FIR filters. The proposed BCSE-4 offers better reduction of adders by eliminating the redundant 4-bit CSs that exist in the binary representation of filter coefficients. The reduction of adders is achieved with a small increase in critical path length of filter coefficient multipliers. Design examples show that our BCSE-4 gives an average power consumption reduction of 5.2% and 6.1% over the best known CSE method (BSE, NR-SCSE) respectively, when synthesized with TSMC-0.18 μm technology. We show that our BCSE-4 offers an overall adder reduction of 6.5% compared to BSE without any increase in critical path length of filter coefficient multipliers.