File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A common subexpression sharing approach for multiplierless synthesis of multiple constant multiplications

TitleA common subexpression sharing approach for multiplierless synthesis of multiple constant multiplications
Authors
KeywordsCommon subexpression elimination
Multiplierless Alters
Multiple constant multiplication
Minimal signed digit
Issue Date2007
Citation
Lecture Notes in Engineering and Computer Science, 2007, v. 2, p. 1636-1639 How to Cite?
AbstractIn the context of multiple constant multiplication (MCM) filter design, we propose a search space that combines the shifted sum/difference of coefficients as well as minimal signed digit (MSD) representation. The search space further reduces the number of adders/subtractors in the synthesis of MCM from MSD representation. A novel common subexpression elimination (CSE) algorithm is adapted to the proposed search space. Our synthesized multiplierless filters are benchmarked against representative examples and found to achieve hardware reduction in most cases.
Persistent Identifierhttp://hdl.handle.net/10722/198890
ISSN

 

DC FieldValueLanguage
dc.contributor.authorHo, Yuen Hong Alvin-
dc.contributor.authorLei, Chi-Un-
dc.contributor.authorWong, Ngai-
dc.date.accessioned2014-07-17T03:52:27Z-
dc.date.available2014-07-17T03:52:27Z-
dc.date.issued2007-
dc.identifier.citationLecture Notes in Engineering and Computer Science, 2007, v. 2, p. 1636-1639-
dc.identifier.issn2078-0958-
dc.identifier.urihttp://hdl.handle.net/10722/198890-
dc.description.abstractIn the context of multiple constant multiplication (MCM) filter design, we propose a search space that combines the shifted sum/difference of coefficients as well as minimal signed digit (MSD) representation. The search space further reduces the number of adders/subtractors in the synthesis of MCM from MSD representation. A novel common subexpression elimination (CSE) algorithm is adapted to the proposed search space. Our synthesized multiplierless filters are benchmarked against representative examples and found to achieve hardware reduction in most cases.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Engineering and Computer Science-
dc.subjectCommon subexpression elimination-
dc.subjectMultiplierless Alters-
dc.subjectMultiple constant multiplication-
dc.subjectMinimal signed digit-
dc.titleA common subexpression sharing approach for multiplierless synthesis of multiple constant multiplications-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-84888366438-
dc.identifier.volume2-
dc.identifier.spage1636-
dc.identifier.epage1639-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats