Share Email Print
cover

Proceedings Paper

The canonical minimised Adder graph representation
Author(s): Uwe Meyer-Bäse; Oscar Gustafsson; Andrew Dempster
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 3 April 2008
PDF: 12 pages
Proc. SPIE 6979, Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks VI, 69790P (3 April 2008); doi: 10.1117/12.776928
Show Author Affiliations
Uwe Meyer-Bäse, Florida State Univ. (United States)
Oscar Gustafsson, Linköping Univ. (Sweden)
Andrew Dempster, Univ. of New South Wales (Australia)


Published in SPIE Proceedings Vol. 6979:
Independent Component Analyses, Wavelets, Unsupervised Nano-Biomimetic Sensors, and Neural Networks VI
Harold H. Szu; F. Jack Agee, Editor(s)

© SPIE. Terms of Use
Back to Top