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

Direct link
A canonical minimised adder graph representation
Florida State University.
Linköping University, The Institute of Technology. Linköping University, Department of Electrical Engineering, Electronics System.ORCID iD: 0000-0003-3470-3911
University of New South Wales.
2008 (English)In: SPIE,2008, SPIE , 2008, 69790P- p.Conference paper (Refereed)
Abstract [en]

In this paper we introduce a canonical minimised adder graph (CMAG) representation that can easily be generated with a computer. We show that this representation can be used to efficiently develop code generation for MAG graphs. Several code optimizations methods are developed in the computation of the non-output fundamental sum (NOFS) computation, which allows the computation of all graphs up to cost-5 be accomplished in a reasonable timeframe. 

Place, publisher, year, edition, pages
SPIE , 2008. 69790P- p.
, Proceedings of SPIE, the International Society for Optical Engineering, ISSN 0277-786X
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-44130DOI: 10.1117/12.776928ISI: 000257982900022Local ID: 75760ISBN: 9780819471703ISBN: 0819471704OAI: diva2:264991
Conference on Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks VI
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2015-03-11

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Gustafsson, Oscar
By organisation
The Institute of TechnologyElectronics System
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 248 hits
ReferencesLink to record
Permanent link

Direct link