liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Improved multiple constant multiplication using minimum spanning trees
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-3470-3911
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.
2004 (English)In: Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004,  Volume 1 / [ed] Michael B. Matthews, IEEE , 2004, 63-66 p.Conference paper, Published paper (Other academic)
Abstract [en]

Recently, a novel technique for the multiple constant multiplication (MCM) problem using minimum spanning trees (MSTs) has been proposed. The approach works by finding simple differences between the coefficients to realize and then applying the same method to the differences (which is an MCM problem as well). Each iteration is divided into two steps. First, finding a minimum spanning tree in the graph describing the differences between the coefficients. Second, as each edge in the graph may correspond to more than one difference, one difference is selected for each edge in the MST. Generally, both these stages have multiple solutions. The aim of this work is to more closely study how the MST and the differences should be selected to give better total results. It is also discussed how the two stages in each iteration may be joined into one problem.

Place, publisher, year, edition, pages
IEEE , 2004. 63-66 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-23601DOI: 10.1109/ACSSC.2004.1399088Local ID: 3091ISBN: 0-7803-8622-1 (print)OAI: oai:DiVA.org:liu-23601DiVA: diva2:243916
Conference
The Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 7-10 November, Pacific Grove, California, USA
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2015-03-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Gustafsson, OscarOhlsson, HenrikWanhammar, Lars

Search in DiVA

By author/editor
Gustafsson, OscarOhlsson, HenrikWanhammar, Lars
By organisation
Computer EngineeringThe Institute of TechnologyElectronics System
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 359 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf