File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ASPDAC.2008.4483924
- Scopus: eid_2-s2.0-49549100209
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Global optimization of common subexpressions for multiplierless synthesis of multiple constant multiplications
Title | Global optimization of common subexpressions for multiplierless synthesis of multiple constant multiplications |
---|---|
Authors | |
Issue Date | 2008 |
Citation | Proceedings Of The Asia And South Pacific Design Automation Conference, Asp-Dac, 2008, p. 119-124 How to Cite? |
Abstract | In the context of multiple constant multiplication (MCM) design, we propose a novel common subexpression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixed-integer linear programming (MILP) problem. A time delay constraint is included for synthesis. We also propose coefficient decompositions that combine all minimal signed digit (MSD) representations and the shifted sum (difference) of coefficients. In the examples we demonstrate, the proposed solution space further reduces the number of adders/subtractors in the MCM synthesis. ©2008 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/98879 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ho, YHA | en_HK |
dc.contributor.author | Lei, CU | en_HK |
dc.contributor.author | Kwan, HK | en_HK |
dc.contributor.author | Wong, N | en_HK |
dc.date.accessioned | 2010-09-25T18:06:07Z | - |
dc.date.available | 2010-09-25T18:06:07Z | - |
dc.date.issued | 2008 | en_HK |
dc.identifier.citation | Proceedings Of The Asia And South Pacific Design Automation Conference, Asp-Dac, 2008, p. 119-124 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/98879 | - |
dc.description.abstract | In the context of multiple constant multiplication (MCM) design, we propose a novel common subexpression elimination (CSE) algorithm that models the optimal synthesis of coefficients into a 0-1 mixed-integer linear programming (MILP) problem. A time delay constraint is included for synthesis. We also propose coefficient decompositions that combine all minimal signed digit (MSD) representations and the shifted sum (difference) of coefficients. In the examples we demonstrate, the proposed solution space further reduces the number of adders/subtractors in the MCM synthesis. ©2008 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.relation.ispartof | Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC | en_HK |
dc.title | Global optimization of common subexpressions for multiplierless synthesis of multiple constant multiplications | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Wong, N:nwong@eee.hku.hk | en_HK |
dc.identifier.authority | Wong, N=rp00190 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ASPDAC.2008.4483924 | en_HK |
dc.identifier.scopus | eid_2-s2.0-49549100209 | en_HK |
dc.identifier.hkuros | 145034 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-49549100209&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 119 | en_HK |
dc.identifier.epage | 124 | en_HK |
dc.identifier.scopusauthorid | Ho, YHA=24558677900 | en_HK |
dc.identifier.scopusauthorid | Lei, CU=18134021100 | en_HK |
dc.identifier.scopusauthorid | Kwan, HK=21934115800 | en_HK |
dc.identifier.scopusauthorid | Wong, N=35235551600 | en_HK |