File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
  • Find via Find It@HKUL
Supplementary

Article: 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 sharing
Multiple constant multiplications
Genetic algorithm
Issue Date2007
PublisherInternational Association of Engineers. The Journal's web site is located at http://www.engineeringletters.com/
Citation
Engineering Letters, 2007, v. 15 n. 1, p. article no. EL_15_1_23, 149-156 How to Cite?
AbstractIn the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpression-elimination (CSE) algorithm that models synthesis of coefficients into an estimated cost function. Although the proposed algorithm generally does not guarantee an optimum solution, it is capable of finding the minimum/minima of the function in practically sized problems. In our design examples that have known optimal solutions, syntheses of coefficients using the proposed method match the optimal results in a defined search space. We also discover the relationhsip and propose an improvement search space for optimization that combine all minimal-signed-digit (MSD) representations as well as the shifted sum (difference) of coefficients to explore the hidden relationship. In some cases, the proposed feasible solution space further reduces the number of adders/subtractors in the synthesis of MCM from all MSD representations.
Persistent Identifierhttp://hdl.handle.net/10722/73561
ISSN
2015 SCImago Journal Rankings: 0.241

 

DC FieldValueLanguage
dc.contributor.authorHo, YHA-
dc.contributor.authorLei, CU-
dc.contributor.authorWong, N-
dc.date.accessioned2010-09-06T06:52:32Z-
dc.date.available2010-09-06T06:52:32Z-
dc.date.issued2007-
dc.identifier.citationEngineering Letters, 2007, v. 15 n. 1, p. article no. EL_15_1_23, 149-156-
dc.identifier.issn1816-093X-
dc.identifier.urihttp://hdl.handle.net/10722/73561-
dc.description.abstractIn the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpression-elimination (CSE) algorithm that models synthesis of coefficients into an estimated cost function. Although the proposed algorithm generally does not guarantee an optimum solution, it is capable of finding the minimum/minima of the function in practically sized problems. In our design examples that have known optimal solutions, syntheses of coefficients using the proposed method match the optimal results in a defined search space. We also discover the relationhsip and propose an improvement search space for optimization that combine all minimal-signed-digit (MSD) representations as well as the shifted sum (difference) of coefficients to explore the hidden relationship. In some cases, the proposed feasible solution space further reduces the number of adders/subtractors in the synthesis of MCM from all MSD representations.-
dc.languageeng-
dc.publisherInternational Association of Engineers. The Journal's web site is located at http://www.engineeringletters.com/-
dc.relation.ispartofEngineering Letters-
dc.subjectCommon subexpression sharing-
dc.subjectMultiple constant multiplications-
dc.subjectGenetic algorithm-
dc.titleA common subexpression sharing approach for multiplierless synthesis of multiple constant multiplications-
dc.typeArticle-
dc.identifier.emailHo, YHA: alvinho@graduate.hku.hk-
dc.identifier.emailWong, N: nwong@eee.hku.hk-
dc.identifier.authorityWong, N=rp00190-
dc.identifier.hkuros134966-
dc.identifier.volume15-
dc.identifier.issue1-
dc.identifier.spagearticle no. EL_15_1_23, 149-
dc.identifier.epage156-
dc.publisher.placeHong Kong-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats