Decoding spatiotemporal spike sequences via the finite state automata dynamics of spiking neural networks

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Temporally complex stimuli are encoded into spatiotemporal spike sequences of neurons in many sensory areas. Here, we describe how downstream neurons with dendritic bistable plateau potentials can be connected to decode such spike sequences. Driven by feedforward inputs from the sensory neurons and controlled by feedforward inhibition and lateral excitation, the neurons transit between UP and DOWN states of the membrane potentials. The neurons spike only in the UP states. A decoding neuron spikes at the end of an input to signal the recognition of specific spike sequences. The transition dynamics is equivalent to that of a finite state automaton. A connection rule for the networks guarantees that any finite state automaton can be mapped into the transition dynamics, demonstrating the equivalence in computational power between the networks and finite state automata. The decoding mechanism is capable of recognizing an arbitrary number of spatiotemporal spike sequences, and is insensitive to the variations of the spike timings in the sequences.

Original languageEnglish (US)
Article number015010
JournalNew Journal of Physics
Volume10
DOIs
StatePublished - Jan 31 2008

Fingerprint

spiking
decoding
spikes
neurons
transit
stimuli
equivalence
plateaus
time measurement
membranes
excitation

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Cite this

@article{a438a931f6cb47e9940b34206b9283f4,
title = "Decoding spatiotemporal spike sequences via the finite state automata dynamics of spiking neural networks",
abstract = "Temporally complex stimuli are encoded into spatiotemporal spike sequences of neurons in many sensory areas. Here, we describe how downstream neurons with dendritic bistable plateau potentials can be connected to decode such spike sequences. Driven by feedforward inputs from the sensory neurons and controlled by feedforward inhibition and lateral excitation, the neurons transit between UP and DOWN states of the membrane potentials. The neurons spike only in the UP states. A decoding neuron spikes at the end of an input to signal the recognition of specific spike sequences. The transition dynamics is equivalent to that of a finite state automaton. A connection rule for the networks guarantees that any finite state automaton can be mapped into the transition dynamics, demonstrating the equivalence in computational power between the networks and finite state automata. The decoding mechanism is capable of recognizing an arbitrary number of spatiotemporal spike sequences, and is insensitive to the variations of the spike timings in the sequences.",
author = "Jin, {Dezhe Z.}",
year = "2008",
month = "1",
day = "31",
doi = "10.1088/1367-2630/10/1/015010",
language = "English (US)",
volume = "10",
journal = "New Journal of Physics",
issn = "1367-2630",
publisher = "IOP Publishing Ltd.",

}

TY - JOUR

T1 - Decoding spatiotemporal spike sequences via the finite state automata dynamics of spiking neural networks

AU - Jin, Dezhe Z.

PY - 2008/1/31

Y1 - 2008/1/31

N2 - Temporally complex stimuli are encoded into spatiotemporal spike sequences of neurons in many sensory areas. Here, we describe how downstream neurons with dendritic bistable plateau potentials can be connected to decode such spike sequences. Driven by feedforward inputs from the sensory neurons and controlled by feedforward inhibition and lateral excitation, the neurons transit between UP and DOWN states of the membrane potentials. The neurons spike only in the UP states. A decoding neuron spikes at the end of an input to signal the recognition of specific spike sequences. The transition dynamics is equivalent to that of a finite state automaton. A connection rule for the networks guarantees that any finite state automaton can be mapped into the transition dynamics, demonstrating the equivalence in computational power between the networks and finite state automata. The decoding mechanism is capable of recognizing an arbitrary number of spatiotemporal spike sequences, and is insensitive to the variations of the spike timings in the sequences.

AB - Temporally complex stimuli are encoded into spatiotemporal spike sequences of neurons in many sensory areas. Here, we describe how downstream neurons with dendritic bistable plateau potentials can be connected to decode such spike sequences. Driven by feedforward inputs from the sensory neurons and controlled by feedforward inhibition and lateral excitation, the neurons transit between UP and DOWN states of the membrane potentials. The neurons spike only in the UP states. A decoding neuron spikes at the end of an input to signal the recognition of specific spike sequences. The transition dynamics is equivalent to that of a finite state automaton. A connection rule for the networks guarantees that any finite state automaton can be mapped into the transition dynamics, demonstrating the equivalence in computational power between the networks and finite state automata. The decoding mechanism is capable of recognizing an arbitrary number of spatiotemporal spike sequences, and is insensitive to the variations of the spike timings in the sequences.

UR - http://www.scopus.com/inward/record.url?scp=45749136792&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45749136792&partnerID=8YFLogxK

U2 - 10.1088/1367-2630/10/1/015010

DO - 10.1088/1367-2630/10/1/015010

M3 - Article

AN - SCOPUS:45749136792

VL - 10

JO - New Journal of Physics

JF - New Journal of Physics

SN - 1367-2630

M1 - 015010

ER -