Algorithms
besself designs analog Bessel filters, which are characterized by
an almost constant group delay across the entire passband, thus preserving the wave
shape of filtered signals in the passband.
Lowpass Bessel filters have a monotonically decreasing magnitude response, as do
lowpass Butterworth filters. Compared to the Butterworth, Chebyshev, and elliptic
filters, the Bessel filter has the slowest rolloff and requires the highest order to
meet an attenuation specification.
For high-order filters, the state-space form is the most numerically accurate,
followed by the zero-pole-gain form. The transfer function coefficient form is the least
accurate; numerical problems can arise for filter orders as low as 15.
besself uses a four-step algorithm:
Find lowpass analog prototype poles, zeros, and gain using the besselap function.
Convert the poles, zeros, and gain into state-space form.
If required, use a state-space transformation to convert the lowpass filter
into a bandpass, highpass, or bandstop filter with the desired frequency
constraints.
Convert the state-space filter back to transfer function or zero-pole-gain
form, as required.