2016 IEEE International Symposium on Circuits and Systems (ISCAS) 2016
DOI: 10.1109/iscas.2016.7538992
|View full text |Cite
|
Sign up to set email alerts
|

Spiking analog VLSI neuron assemblies as constraint satisfaction problem solvers

Abstract: Solving constraint satisfaction problems (CSPs) is a notoriously expensive computational task. Recently, it has been proposed that efficient stochastic solvers can be obtained through appropriately configured spiking neural networks performing Markov Chain Monte Carlo (MCMC) sampling. The possibility to run such models on massively parallel, low-power neuromorphic hardware holds great promise; however, previously proposed networks are based on probabilistically spiking neurons, and thus rely on random number g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(12 citation statements)
references
References 11 publications
(19 reference statements)
0
12
0
Order By: Relevance
“…For a neuromorphic CSP solver to be viable, the SNN must not only visit energetically minimum states but also detect when one is visited. Previous neuromorphic hardware implementations [89]- [96] required a von Neumann processor to continuously read out the entire high-dimensional network state S to evaluate the cost function and identify solutions. This leads to an impractical off-chip communication bottleneck that only worsens with increasing problem size.…”
Section: (E) Decomposition Of the Time To Solution T Into The Number Of Time Steps To Solution T (Left) And Mean Time Per Timestep τ (Rigmentioning
confidence: 99%
“…For a neuromorphic CSP solver to be viable, the SNN must not only visit energetically minimum states but also detect when one is visited. Previous neuromorphic hardware implementations [89]- [96] required a von Neumann processor to continuously read out the entire high-dimensional network state S to evaluate the cost function and identify solutions. This leads to an impractical off-chip communication bottleneck that only worsens with increasing problem size.…”
Section: (E) Decomposition Of the Time To Solution T Into The Number Of Time Steps To Solution T (Left) And Mean Time Per Timestep τ (Rigmentioning
confidence: 99%
“…Very recent design ideas for spike-based neuromorphic hardware that is able to solve constraint satisfaction problems can be found in [19] and [20].…”
Section: Solving Constraint Satisfaction Problemsmentioning
confidence: 99%
“…Each layer corresponds to a possible number in the puzzle, e.g., ''1'' or ''2'' for the 2 × 2 Sudoku. The neurons can thus be rearranged in an N × N × N matrix [23], where the entry corresponding to ''1'' indicates a firing neuron and the entry corresponding to ''0'' indicates a silent neuron. Fig.…”
Section: Hardware Solution Of a Sudoku Puzzlementioning
confidence: 99%