3 April 2008 The canonical minimised Adder graph representation
Author Affiliations +
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.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Uwe Meyer-Bäse, Uwe Meyer-Bäse, Oscar Gustafsson, Oscar Gustafsson, Andrew Dempster, 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); doi: 10.1117/12.776928; https://doi.org/10.1117/12.776928

Back to Top