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
Obtaining Minimum Depth Sum of Products from Multiple Constant Multiplication
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-7074-3676
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-3470-3911
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-5739-3544
2018 (English)In: PROCEEDINGS OF THE 2018 IEEE INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING SYSTEMS (SIPS), IEEE, Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 134-139Conference paper, Published paper (Refereed)
Abstract [sv]

In this work, an approach for transposing solutions to the multiple constant multiplication (MCM) problem to obtain a sum of product (SOP) computation with minimum depth is proposed. The reason for doing this is that solving the SOP problem directly is highly computationally intensive when adder graph algorithms are used. Compared to using subexpression sharing algorithms, which has a lower computational complexity, directly for the SOP problem, it is shown that the proposed approach, as expected, results in lower complexity for the SOP. It is also shown that there is no obvious way to construct the MCM solution in such a way that the SOP solution has the minimum theoretical depth. However, the proposed approach guarantees minimum depth subject to the MCM solution given as input.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2018. p. 134-139
Series
IEEE Workshop on Signal Processing Systems, ISSN 1520-6130
Keywords [en]
multiple constant multiplication (MCM), shift-and-add, Sum of Product (SOP), minimum depth expansion algorithm, and Vertex reduced SOP adder Graph (VSG).
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-152653DOI: 10.1109/SiPS.2018.8598365ISI: 000465106800023ISBN: 978-1-5386-6318-9 (print)OAI: oai:DiVA.org:liu-152653DiVA, id: diva2:1262172
Conference
IEEE Workshop on Signal Processing Systems, Cape Town, South Africa, 21-24 October, 2018
Available from: 2018-11-09 Created: 2018-11-09 Last updated: 2019-06-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Gustafsson, OscarGarrido, Mario

Search in DiVA

By author/editor
Mohammadi Sarband, NargesGustafsson, OscarGarrido, Mario
By organisation
Computer EngineeringFaculty of Science & Engineering
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 145 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