File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal common sub-expression elimination algorithm of multiple constant multiplications with a logic depth constraint

TitleOptimal common sub-expression elimination algorithm of multiple constant multiplications with a logic depth constraint
Authors
KeywordsCommon sub-expression sharing
Mixed-integer linear programming
Multiple constant multiplications
Issue Date2008
PublisherOxford University Press. The Journal's web site is located at http://ietfec.oxfordjournals.org/
Citation
Ieice Transactions On Fundamentals Of Electronics, Communications And Computer Sciences, 2008, v. E91-A n. 12, p. 3568-3575 How to Cite?
AbstractIn the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixed-integer linear programming (MILP) problem with a user-defined generic logic depth constraint. We also propose an efficient solution space, which combines all minimal signed digit (MSD) representations and the shifted sum (difference) of coefficients. In the examples we demonstrate, the combination of the proposed algorithm and solution space gives a better solution comparing to existing algorithms. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.
Persistent Identifierhttp://hdl.handle.net/10722/58778
ISSN
2012 Impact Factor: 0.238
2015 SCImago Journal Rankings: 0.215
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorHo, YHAen_HK
dc.contributor.authorLei, CUen_HK
dc.contributor.authorKwan, HKen_HK
dc.contributor.authorWong, Nen_HK
dc.date.accessioned2010-05-31T03:36:45Z-
dc.date.available2010-05-31T03:36:45Z-
dc.date.issued2008en_HK
dc.identifier.citationIeice Transactions On Fundamentals Of Electronics, Communications And Computer Sciences, 2008, v. E91-A n. 12, p. 3568-3575en_HK
dc.identifier.issn0916-8508en_HK
dc.identifier.urihttp://hdl.handle.net/10722/58778-
dc.description.abstractIn the context of multiple constant multiplication (MCM) design, we propose a novel common sub-expression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixed-integer linear programming (MILP) problem with a user-defined generic logic depth constraint. We also propose an efficient solution space, which combines all minimal signed digit (MSD) representations and the shifted sum (difference) of coefficients. In the examples we demonstrate, the combination of the proposed algorithm and solution space gives a better solution comparing to existing algorithms. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.en_HK
dc.languageengen_HK
dc.publisherOxford University Press. The Journal's web site is located at http://ietfec.oxfordjournals.org/en_HK
dc.relation.ispartofIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciencesen_HK
dc.subjectCommon sub-expression sharingen_HK
dc.subjectMixed-integer linear programmingen_HK
dc.subjectMultiple constant multiplicationsen_HK
dc.titleOptimal common sub-expression elimination algorithm of multiple constant multiplications with a logic depth constrainten_HK
dc.typeArticleen_HK
dc.identifier.emailWong, N:nwong@eee.hku.hken_HK
dc.identifier.authorityWong, N=rp00190en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1093/ietfec/e91-a.12.3568en_HK
dc.identifier.scopuseid_2-s2.0-77951285501en_HK
dc.identifier.hkuros155080en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77951285501&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volumeE91-Aen_HK
dc.identifier.issue12en_HK
dc.identifier.spage3568en_HK
dc.identifier.epage3575en_HK
dc.identifier.isiWOS:000262164800021-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridHo, YHA=24558677900en_HK
dc.identifier.scopusauthoridLei, CU=18134021100en_HK
dc.identifier.scopusauthoridKwan, HK=21934115800en_HK
dc.identifier.scopusauthoridWong, N=35235551600en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats