By Topic

Graph Theoretical Representation of Grid-based ANN Architectures for VLSI Implementations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
S. C. Stilkerich ; EADS Corporate Research Center, Lab Germany, Munich/Ottobrunn, D-85521, Germany (phone: +49(0) 89.607-27452; fax: +49(0) 89.607-25157; email: stephan.stilkerich@eads.net)

The System-on-Chip design of purely digital architectures, which are based on massively parallel Markov random field (MRF) processing principles is so far an unstructured, time consuming, fault-prone and complex task. Up to now a toolkit is not available to systematically support the VLSI design task in a single coherent environment and along a seamless design flow for various digital semiconductor-technologies. In this contribution we report on a completely technology-independent and graph-theoretical approach for the VLSI design of massively parallel MRF processing devices. The paper is finalized by selected results, which show generated graphs, synthesis results and prototypical implementations in FPGA technologies. All together these results demonstrate the ability of the proposed graph-theoretical approach and manifest the industrial relevance of the developed tool-kit.

Published in:

2006 IEEE International Conference on Evolutionary Computation

Date of Conference:

0-0 0