Feed a system a single spike. Try each System option, amplifier, echo and averager, and watch the short trace that comes back.
One measurement is enough
Feed a system a single spike, and record what comes out. That trace is h[n], the impulse response.
Describe this picture
One plot of samples: a system’s reply to a single spike at , its impulse response . Three “System” buttons choose “Amplifier”, “Echo” or “Averager”.
One measurement is enough
Tap a bridge once with a hammer and it shudders, then settles back down: one short reply to one short knock. Here’s the surprising part. Record that one reply carefully, and you’ve captured everything the bridge will ever do to any load that shakes it later.
That works because of two plain rules from the last page. Scale or add the inputs you feed a system, and the output scales or adds the same way: that’s what makes it linear. Shift an input later in time, and the output shifts by exactly the same amount, without changing shape: that’s what makes it time-invariant. A system with both properties gets a short name, LTI.
The signal-decomposition page showed that any signal can be written as a sum of scaled, shifted spikes, , where is a spike worth at and everywhere else. Put that together with the two LTI rules above: once you know an LTI system’s reply to a single spike , called its impulse response and written , you already know its reply to every shifted, scaled spike. And since any input is nothing but a sum of those, you know its reply to any input at all.
Go back to the three systems at the top of the page. Each of those short traces is, by the last page’s two rules, the entire system: nothing else about its inner rule is needed to predict any other output.
Building the output from copies of h
Play a short three-note tune into an echoing space, and each note starts its own decaying echo the moment it sounds. By the time the third note rings out, all three echoes are overlapping in the air. That overlap is exactly what this instrument builds, one note at a time.
Each input spike, the instant it “arrives,” launches its own copy of , scaled by that spike’s height and shifted to start at that spike’s instant. The whole output is nothing but those launched copies, added together sample by sample.
Drag Place next spike forward one step at a time, and read Spike just placed for the copy it just launched.
Building the output from copies of h
Each input spike launches its own scaled, shifted copy of h[n]. Step through to place them one at a time.
Fixed h[n] = 1.00, 0.50, 0.25 (n = 0, 1, 2). Input spikes: x[0] = 2, x[1] = 1.
Describe this picture
Plots of samples: the input spikes, the copies of they launch, each drawn faint, and the running total , drawn solid. The “Place next spike” slider places the spikes one at a time, and the readout “Spike just placed” describes the copy it launched.
Once both spikes are placed, that total matches exactly what feeding the whole input through the system at once would give, built without ever running the system again.
Measuring h in practice
Clap once in a small room and the slap of sound off close walls dies out almost at once. Clap the same way inside a church and the sound keeps rolling back at you for seconds, off walls and pillars far apart. Since is nothing but a system’s reply to one spike, you can measure it on a real system the same way: feed it something spike-like, a clap, a hammer tap, and record what comes back.
Switch Room size between small and large on the same clap, and watch Rings for about.
Measuring h in practice
Clap in a room and record the decay that comes back: that recording is the room's impulse response.
Describe this picture
One plot of the recorded decay after a clap, , with two “Room size” buttons, “Small room” and “Large room”. The readout “Rings for about” gives how many samples it rings before dying below a fixed share of the clap.
Notice Rings for about climbs a lot for the large room: the shape and length of alone already tells you something physical about the room that produced it.
The step response, and its link to h
Ease off a car’s accelerator and the speed falls away smoothly. Floor it instead and hold it there, a sudden change that stays, and the speed climbs and settles into a new cruising value: that settling trace is a step response.
Formally, a system’s step response is what it gives back when fed a unit step instead of a spike: the same “switch” from the signal-decomposition page, written , worth before and from on. Since is the running sum of , and the system is LTI, is exactly the running sum of , the same running-sum relationship from the amplitude-operations page, now applied to a whole system’s response. Running that the other way, taking ‘s first difference, hands back exactly.
Switch View between Impulse response h[n] and Step response s[n].
The step response, and its link to h
A step response is what a system gives back for a unit step. It's exactly the running sum of h[n].
Describe this picture
Two plots of samples, the impulse response and the step response , the running sum of . The “View” buttons highlight one and dim the other.
Notice running-summing the trace reproduces the trace exactly, sample for sample, and first-differencing hands back again.
Worked example
Take for (else 0), and an input with , (else 0), so .
Launching the copies. The spike at launches at . The spike at launches at .
Adding them. , , , , so , exactly what the instrument above builds.
The step response. Running-summing the same gives , , . Its first difference, , gives back , exactly again.
Where you’ll meet this
Audio engineers measure a concert hall’s impulse response once, with a clap or a starter pistol, then reuse it to make any recording sound as if it were played inside that hall, by the same shift-scale-and-add trick as the instrument above. Structural engineers tap a bridge or a building and read how long its impulse response keeps vibrating afterward. Both reuse one measurement for every input they’ll ever care about.
The maths behind it · linear combinations
Writing writes the output as a linear combination of shifted copies of one vector , with the input samples as coefficients: the same “linear combination of basis vectors” idea from the signal-decomposition page.
The next page gives this shifted-and-added sum its own name and its own notation: convolution.
Reference card
| Quantity | Formula | Notes |
|---|---|---|
| Impulse response | system’s output when | a complete description of an LTI system |
| Output from shifted copies | formalised and named “convolution” next | |
| Step response | running sum of | |
| from | first difference of the step response |