Noise bandwidth — the series
-
The bandwidth noise sees
A single pole passes π/2 times as much noise power as a brick wall at its own corner frequency, so a noise voltage computed with the −3 dB point is twenty-one per cent low. Measured by integrating the solved response rather than taken from the table it usually comes from, the ratio is 1.5706 and π/2 is 1.5708. A five-pole Chebyshev's is 0.964 — less than one.
-
The ratio that does not walk to one
A single pole passes π/2 times as much noise as a brick wall at its corner, and every account of it says the ratio falls towards one as the skirt steepens. Over thirty-two realised filters only Butterworth does that. Bessel is least at order five, 1.0385, and rises again; Chebyshev alternates with parity and the two branches separate only above 0.1968 decibels of ripple; and an even-order elliptic has no noise bandwidth at all, its integral returning 380 or 38,005 depending on where it was stopped.
-
The filter an average is
A mean taken over a window is a filter, and the area under its squared response is exactly one over twice the window — 25 hertz of noise bandwidth for twenty milliseconds, passing half its power at 22.15. Built to the same noise, a one-pole averager passes half its power at 15.92 hertz and takes 2.33 times as long to settle to one per cent, and two means in cascade pass half at 23.92 and take 1.25 times as long. Between its nulls a mean rejects the mains no better than the one-pole does, and one per cent off a null it rejects it by forty decibels however many cycles the window holds.
-
The bandwidth a bin is not
A density read off a transform is divided by a bandwidth, and the bandwidth belongs to the window rather than to the bin spacing — exactly three halves of a bin for a Hann window, so a density divided by one bin is 1.761 decibels high in power. Measured three ways that share only the weights. And the received sequence of windows fails at its second entry: Hamming's first sidelobe is 11.2 decibels below Hann's and it costs less bandwidth as well, with Hann collecting its debt at the fourth sidelobe and every one after it.
-
The window the square-root law has
Averaging N readings divides the noise power by N only if the readings are independent, and samples of a filtered noise are independent only over a band. Measured on the exact sampled autocorrelation, the rule that a reading's noise is the density over twice the window is right at one front-end bandwidth and wrong on both sides — a factor of three wide at six hundred samples, asking the sample rate to exceed the front end's noise bandwidth by about ten rather than by two. Above it the folded noise arrives at full amplitude; below it the front end has removed noise the rule is still charging for.
-
The order of the null, not the number of them
A mean rejects the mains exactly and rejects it one per cent off frequency by forty decibels, whatever the window length. Two means in cascade of the same total length settle in the same time, cost a third more noise bandwidth and hold that forty decibels over ten times the band — the factor being ten raised to minus the depth in decibels over forty, because a first-order null rises linearly through a target and a second-order one quadratically. Splitting the two lengths to straddle the frequency buys a further factor of exactly root two, for no noise at all, and puts the design two parts in ten thousand from a cliff.