6.5.14 · D3Advanced & Emerging Architectures

Worked examples — Neuromorphic computing

2,371 words11 min readBack to topic

This deep dive drills the Neuromorphic computing maths until no input surprises you. We take the two engines from the parent — the Leaky Integrate-and-Fire (LIF) neuron and Spike-Timing-Dependent Plasticity (STDP) — and hit every case class they can produce.

Before we start, one reminder of the core tools we lean on (all derived in the parent note):

Here every symbol means: = leak resistance (ohms), = membrane capacitance (farads), = input current (amps), = membrane voltage, = firing threshold, = how fast the membrane charges/forgets, = the times two connected neurons spiked, = maximum learning strength, = how quickly timing stops mattering. If any of these feels shaky, re-read the parent's RC derivation first.


The scenario matrix

Every problem this topic throws at you lands in exactly one of these cells. The examples below are labelled with the cell they cover.

# Case class What makes it special Example
C1 Above threshold Neuron fires; finite Ex 1
C2 Below threshold Log argument negative → never fires Ex 2
C3 Exactly at threshold Degenerate: reaches only at Ex 3
C4 Limiting: huge input as ; rate grows without bound (only refractory period caps it) Ex 4
C5 STDP potentiation Pre before post → strengthen Ex 5
C6 STDP depression Pre after post → weaken Ex 5
C7 STDP degenerate Simultaneous spikes → boundary Ex 6
C8 Real-world word problem Choose to hit a target rate Ex 7
C9 Exam twist Threshold current + rate just above it Ex 8
C10 Sanity / energy Why silence = low power (sparsity) Ex 9

We use one fixed "textbook neuron" wherever possible so numbers stay comparable:

Figure — Neuromorphic computing

Look at the figure: the three coloured curves are the same neuron fed three different currents. The orange curve (strong input) crosses the dashed threshold line; the teal one (medium) just reaches it; the plum one (weak) flattens below the line forever. Those three shapes ARE cells C1, C3, C2. Every example is a point on one of these curves.


C1 — Above threshold: it fires


C2 — Below threshold: it never fires


C3 — Exactly at threshold: the degenerate boundary


C4 — Limiting case: huge input


C5 & C6 — STDP: strengthen vs weaken

Figure — Neuromorphic computing

The figure plots against . Right of zero (orange) = strengthen, decaying as timing loosens; left of zero (teal) = weaken. The dot at is Ex 5a; the dot at is Ex 5b — note the left dip is deeper because .


C7 — STDP degenerate: simultaneous spikes


C8 — Real-world word problem


C9 — Exam twist: threshold current and the soft turn-on


C10 — Sanity / energy check


Recall Self-test — one per matrix cell

Does a neuron with ever fire in finite time? ::: No — ; the boundary is on the silent side (see C3). What single quantity do you always compute first in an LIF problem, and why? ::: vs — if the neuron never fires and the formula's log goes negative/undefined (C2). For , how does time-to-spike scale with ? ::: , i.e. ; the rate grows without bound, only a refractory period caps it (C4). Pre at 5 ms, post at 8 ms: strengthen or weaken? ::: → potentiation, strengthen (C5). What happens in STDP when ? ::: Jump discontinuity between and ; convention-defined, usually (C7). To double the firing rate you must (increase/decrease) ? ::: Increase — higher shortens (C8/C9).


See also: Neuromorphic computing (parent), Spiking Neural Networks (SNN), Hebbian learning, Memristors and ReRAM, RC circuits, Von Neumann architecture.