The canonical minimised Adder graph representation

Uwe Meyer-Bäse; Oscar Gustafsson; Andrew Dempster

doi:10.1117/12.776928

3 April 2008 The canonical minimised Adder graph representation

Uwe Meyer-Bäse, Oscar Gustafsson, Andrew Dempster

Proceedings Volume 6979, Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks VI; 69790P (2008) https://doi.org/10.1117/12.776928
Event: SPIE Defense and Security Symposium, 2008, Orlando, Florida, United States

Abstract

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.

Citation Download Citation

Uwe Meyer-Bäse, Oscar Gustafsson, and Andrew Dempster "The canonical minimised Adder graph representation", Proc. SPIE 6979, Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks VI, 69790P (3 April 2008); https://doi.org/10.1117/12.776928

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available