A new binary common subexpression elimination method for implementing low complexity FIR filters

K. G. Smitha; A. P. Vinod

doi:10.1109/iscas.2007.378854

A new binary common subexpression elimination method for implementing low complexity FIR filters

K. G. Smitha^*, A. P. Vinod

^*Corresponding author for this work

Research output: Contribution to journal › Conference article published in journal › peer-review

8 Citations (Scopus)

Abstract

The complexity of Finite Impulse Response (FIR) Alters is 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 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.

Original language	English
Article number	4253141
Pages (from-to)	2327-2330
Number of pages	4
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
DOIs	https://doi.org/10.1109/iscas.2007.378854
Publication status	Published - 2007
Externally published	Yes
Event	2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007 - New Orleans, LA, United States Duration: 27 May 2007 → 30 May 2007

Access to Document

10.1109/iscas.2007.378854

Cite this

@article{430aa6877f8e4a1e8ab867455ce36ac4,

title = "A new binary common subexpression elimination method for implementing low complexity FIR filters",

abstract = "The complexity of Finite Impulse Response (FIR) Alters is 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 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.",

author = "Smitha, \{K. G.\} and Vinod, \{A. P.\}",

year = "2007",

doi = "10.1109/iscas.2007.378854",

language = "English",

pages = "2327--2330",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007 ; Conference date: 27-05-2007 Through 30-05-2007",

}

TY - JOUR

T1 - A new binary common subexpression elimination method for implementing low complexity FIR filters

AU - Smitha, K. G.

AU - Vinod, A. P.

PY - 2007

Y1 - 2007

N2 - The complexity of Finite Impulse Response (FIR) Alters is 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 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.

AB - The complexity of Finite Impulse Response (FIR) Alters is 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 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.

UR - https://www.scopus.com/pages/publications/34548856825

U2 - 10.1109/iscas.2007.378854

DO - 10.1109/iscas.2007.378854

M3 - Conference article published in journal

AN - SCOPUS:34548856825

SN - 0271-4310

SP - 2327

EP - 2330

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

M1 - 4253141

T2 - 2007 IEEE International Symposium on Circuits and Systems, ISCAS 2007

Y2 - 27 May 2007 through 30 May 2007

ER -

A new binary common subexpression elimination method for implementing low complexity FIR filters

Abstract

Access to Document

Other files and links

Fingerprint

Cite this