SearcharxivSearch

arXiv subjects

Wolfgang Fink

Publications and source records attributed to Wolfgang Fink.

3 recordsLinked to original sources

Pareto-Optimization Framework for Automated Network-on-Chip Design

With the advent of multi-core processors, network-on-chip design has been key in addressing network performances, such as bandwidth, power consumption, and communication delays when dealing with on-chip communication between the increasing number of processor cores. As the numbers of cores increase, network design becomes more complex. Therefore, there is a critical need in soliciting computer aid in determining network configurations that afford optimal performance given resources and design constraints. We propose a Pareto-optimization framework that explores the space of possible network configurations to determine optimal network latencies, power consumption, and the corresponding link allocations. For a given number of routers, average network latency and power consumption as example performance objectives can be displayed in form of Pareto-optimal fronts, thus not only offering a design tool, but also enabling trade-off studies.

cs.ET

Operational Design Considerations for Retinal Prostheses

Three critical improvements for present day and future retinal vision implants are proposed and discussed: (1) A time profile for the stimulation current that leads predominantly to transverse stimulation of nerve cells; (2) auxiliary electric currents for electric field shaping with a time profile chosen such that these currents have small probability to cause stimulation; and (3) a local area scanning procedure that results in high pixel density for image/percept formation (except for losses at the boundary of an electrode array).

q-bio.NC

Finite size scaling in neural networks

We demonstrate that the fraction of pattern sets that can be stored in single- and hidden-layer perceptrons exhibits finite size scaling. This feature allows to estimate the critical storage capacity α_c from simulations of relatively small systems. We illustrate this approach by determining α_c, together with the finite size scaling exponent ν, for storing Gaussian patterns in committee and parity machines with binary couplings and up to K=5 hidden units.

cond-mat.dis-nn