Bessel filter

In electronics and signal processing, a Bessel filter is a type of analog linear filter with a maximally flat group delay (i.e., maximally linear phase response), which preserves the wave shape of filtered signals in the passband. Bessel filters are often used in audio crossover systems.

The filter's name is a reference to German mathematician Friedrich Bessel (1784–1846), who developed the mathematical theory on which the filter is based. The filters are also called Bessel–Thomson filters in recognition of W. E. Thomson, who worked out how to apply Bessel functions to filter design in 1949.

The Bessel filter is very similar to the Gaussian filter, and tends towards the same shape as filter order increases. While the time-domain step response of the Gaussian filter has zero overshoot, the Bessel filter has a small amount of overshoot, but still much less than other common frequency-domain filters, such as Butterworth filters. It has been noted that the impulse response of Bessel–Thomson filters tends towards a Gaussian as the order of the filter is increased.

Compared to finite-order approximations of the Gaussian filter, the Bessel filter has better shaping factor, flatter phase delay, and flatter group delay than a Gaussian of the same order, although the Gaussian has lower time delay and zero overshoot.

The transfer function

A Bessel low-pass filter is characterized by its transfer function:

:$H(s) = \frac\,$

where $\theta_n(s)$ is a reverse Bessel polynomial from which the filter gets its name and $\omega_0$ is a frequency chosen to give the desired cut-off frequency. The filter has a low-frequency group delay of $1 / \omega_0$. Since $\theta_n (0)$ is indeterminate by the definition of reverse Bessel polynomials, but is a removable singularity, it is defined that $\theta_n (0) = \lim_ \theta_n (x)$.

Bessel polynomials

The transfer function of the Bessel filter is a rational function whose denominator is a reverse Bessel polynomial, such as the following:

:$n=1: \quad s+1$
:$n=2: \quad s^2+3s+3$
:$n=3: \quad s^3+6s^2+15s+15$
:$n=4: \quad s^4+10s^3+45s^2+105s+105$
:$n=5: \quad s^5+15s^4+105s^3+420s^2+945s+945$

The reverse Bessel polynomials are given by:

:$\theta_n(s)=\sum_^n a_ks^k,$

where

:$a_k=\frac \quad k=0,1,\ldots,n.$

Setting the cutoff attenuation

There is no standard set attenuation value for Bessel filters. However, −3.0103 dB is a common choice. Some applications may use a higher or lower attenuation such as −1 dB or −20 dB. Setting the cut-off attenuation frequency involves first finding the frequency that achieves the desired attenuation, which will be referred to as $\omega_c$, and then scaling the $H(s)$ polynomials to the inverse of that frequency. To scale the polynomials, simply append $\omega_c$ to the $s$ term in each coefficient, as shown in the 3 pole Bessel filter example below.

$\begin H(s) &= \frac\\ H(s)'&=H(s)_=\frac\\ \end$

$\omega_c$ may be found with Newton's method, or with root finding.

Finding attenuation frequency with Newton's method

Newton's method requires a known magnitude value and derivative magnitude value for the for $, H(j\omega_c ),$. However, it is easier to operate on $, H(j\omega_c)H(-j\omega_c),$ and use the square of the desired cutoff gain, and is just as accurate, so the square terms will be used.

To obtain $\omega_c$, follow the steps below.

# If $H(s)H(-s)$ is not already available, multiply $H(s)$ by $H(-s)$ to obtain $H(s)H(-s)$.
# negate all terms of $s^n$ when $(n+2)$ is divisible by $4$. That would be $s^2$, $s^6$, $s^$, and so on. The modified function will be called $H_2(s)H_2(-s)$, and this modification will allow the use of real numbers instead of complex numbers when evaluating the polynomial and its derivative. the real $\omega_a$can now be used in place of the complex $j\omega_a$
# Convert the desired attenuation in dB, $A_$, to a squared arithmetic gain value, $B^2_$, by using $B^2_ = 10^$. For example, 3.010 dB converts to 0.5, 1 dB converts to 0.79432823 and so on.
# Calculate the modified $, H_2(s)H_2(-s),$ in Newton's method using the real value, $\omega_a$. Always take the absolute value.
# Calculate the derivative the modified $H_2(\omega_a)H_2(-\omega_a)$ with respect to the real value, $\omega_a$. DO NOT take the absolute value of the derivative.

When steps 1) through 4) are complete, the expression involving Newton's method may be written as:

\omega_a = \omega_a - ( - B^2)/(d[H_2(\omega_a)H_2(-\omega_a)d\omega_a)

using a real value for $\omega_a$with no complex arithmetic needed. The movement of $\omega_a$ should be limited to prevent it from going negative early in the iterations for increased reliability. When complete, $\omega_a$ can used for the $\omega_c$ that can be used to scale the original $H(s)$ transfer function denominator. The attenuation of the modified $G(s)$ will then be virtually the exact desired value at 1 rad/sec. If performed properly, only a handful of iterations are needed to set the attenuation through a wide range of desired attenuation values for both small and very large order filters.

Finding attenuation frequency from the roots

Since $, H(j\omega_a ),$ does not contain any phase information, directly factoring the transfer function will not produce usable results. However, the transfer function may be modified by multiplying it with $H(-s)$ to eliminate all odd powers of $H(j\omega a)$, which in turn forces $H(j\omega a)$ to be real at all frequencies, and then finding the frequency that result on the square of the desired attention.

# If $H(s)H(-s)$ is not already available, multiply $H(s)$ by $H(-s)$ to obtain $H(s)H(-s)$.
# Convert the desired attenuation in dB, $A_$, to a squared arithmetic gain value, $B^2_$, by using $B^2_ = 10^$. For example, 3.010 dB converts to 0.5, 1 dB converts to 0.79432823 and so on.
# Find $P(S) = H_(S)H_(-S) - B^2_H_(S)H_(-S)$
# Find the roots of P(S) using a Root-finding algorithms, root finding algorithm.
# Of the set of roots from above, select the positive imaginary root for all order filters, and positive real root for even order filters.
## Cutoff attenuations that are above the pass band ripple or below the stop band ripple will come back with multiple roots, so the correct root will have to be selected.

Simple cut-off frequency example with root finding

A 20-dB cut-off frequency attenuation example using the 3-pole Bessel example below is set as follows.

$\begin &H(s)=\frac \text \\ &B^2_ = 10^ = 0.01 \text\\ &\\ &\textH(s)' \text, H(s)', = -20\text\omega=1\text \\ &H(s)H(-s)=\frac \\ &P(s) = 225-B^2_(-s^6+6s^4-45^2s+225)=0.01s^6 - 0.06s^4+0.45s^2 + 222.75 \text\\ &R = j5.0771344 \text\\ &\text \\ &\\ &\omega_ = \omega_c = 5.0771344\text \\ &H(s)' = H(s)_ =\frac \\ &=\frac \\ &\\ &\text \\ &, H(j)', =\bigg, \frac\bigg, = 0.1 = -20\text \end$

Example

The transfer function for a third-order (three-pole) Bessel low-pass filter with $\omega_0 = 1$ is

:$H(s)=\frac,$

where the numerator has been chosen to give unity gain at zero frequency ($s = 0$).The roots of the denominator polynomial, the filter's poles, include a real pole at $s=-2.3222$, and a complex-conjugate pair of poles at $s = -1.8389 \pm j1.7544$, plotted above.

The gain is then

:$G(\omega) = , H(j\omega), = \frac. \,$

The −3-dB point, where $, H(j\omega), = \frac\sqrt, \,$ occurs at $\omega = 1.756$. This is conventionally called the cut-off frequency.

The phase is

:$\phi(\omega)=-\arg(H(j\omega))= \arctan\left(\frac\right). \,$

The group delay is

:$D(\omega)=-\frac = \frac. \,$

The Taylor series expansion of the group delay is

:$D(\omega) = 1-\frac+\frac+\cdots.$

Note that the two terms in $\omega^2$ and $\omega^4$ are zero, resulting in a very flat group delay at $\omega=0$. This is the greatest number of terms that can be set to zero, since there are a total of four coefficients in the third-order Bessel polynomial, requiring four equations in order to be defined. One equation specifies that the gain be unity at $\omega=0$ and a second specifies that the gain be zero at $\omega=\infty$, leaving two equations to specify two terms in the series expansion to be zero. This is a general property of the group delay for a Bessel filter of order $n$: the first terms in the series expansion of the group delay will be zero, thus maximizing the flatness of the group delay at .

Digital

Although the bilinear transform is used to convert continuous-time (analog) filters to discrete-time (digital) infinite impulse response (IIR) filters with comparable frequency response, IIR filters obtained by the bilinear transformation do not have constant group delay. Since the important characteristic of a Bessel filter is its maximally-flat group delay, the bilinear transform is inappropriate for converting an analog Bessel filter into a digital form.

The digital equivalent is the Thiran filter, also an all-pole low-pass filter with maximally-flat group delay, which can also be transformed into an allpass filter, to implement fractional delays.

See also

* Bessel function
* Butterworth filter
* Chebyshev filter
* Comb filter
* Elliptic filter
* Group delay and phase delay

References

{{Reflist, refs=

{{cite web
, title=Bessel Filter
, url=http://www-k.ext.ti.com/SRVS/Data/ti/KnowledgeBases/analog/document/faqs/bes.htm
, date=2013
, access-date=2022-05-14
, url-status=dead
, archive-url=https://web.archive.org/web/20130124033657/http://www-k.ext.ti.com/SRVS/Data/ti/KnowledgeBases/analog/document/faqs/bes.htm
, archive-date=2013-01-24

{{cite journal
, last=Thomson
, first=W. E.
, title= Delay networks having maximally flat frequency characteristics
, journal= Proceedings of the IEE - Part III: Radio and Communication Engineering
, date=November 1949
, volume=96
, issue=44
, pages=487–490
, url=https://www.researchgate.net/profile/Josef_Puncocha/post/Do_you_want_to_know_the_basic_papers_about_approximations_of_filters_See_attachment/attachment/59d622916cda7b8083a1cc5f/AS%3A280454482677766%401443876967288/download/thomson.pdf
, doi=10.1049/pi-3.1949.0101

{{cite web
, url=http://www.robots.ox.ac.uk/~sjrob/Teaching/SP/l3.pdf
, title=Transient Response and Transforms: 3.1 Bessel-Thomson filters
, last=Roberts
, first=Stephen
, year=2001

{{cite web
, url=http://www.dsprelated.com/showmessage/130958/1.php
, title=comp.dsp {{! IIR Gaussian Transition filters
, website=www.dsprelated.com
, access-date=2022-05-14
, quote=An analog Bessel filter is an approximation to a Gaussian filter, and the approximation improves as the filter order increases.

{{cite web
, title=Gaussian Filters
, website=www.nuhertz.com
, url=http://www.nuhertz.com/response/iir-and-analog-filters-basic-types/gaussian-filters
, url-status=dead
, archive-url=https://web.archive.org/web/20200111143140/http://www.nuhertz.com/response/iir-and-analog-filters-basic-types/gaussian-filters
, archive-date=2020-01-11
, access-date=2022-05-14

{{cite web
, url=http://www.etc.tuiasi.ro/cin/Downloads/Filters/Filters.htm
, title=How to choose a filter? (Butterworth, Chebyshev, Inverse Chebyshev, Bessel–Thomson) , website=www.etc.tuiasi.ro
, access-date=2022-05-14

{{cite web
, url=http://www.kecktaylor.com/
, title=Free Analog Filter Program
, website=www.kecktaylor.com
, access-date=2022-05-14
, quote=the Bessel filter has a small overshoot and the Gaussian filter has no overshoot.

{{cite book
, title=Design and Analysis of Analog Filters: A Signal Processing Perspective
, last=Paarmann
, first=L. D.
, date=2001
, publisher=Springer Science & Business Media
, isbn=9780792373735
, language=en
, url=https://books.google.com/books?id=l7oC-LJwyegC
, quote=the Bessel filter has slightly better Shaping Factor, flatter phase delay, and flatter group delay than that of a Gaussian filter of equal order. However, the Gaussian filter has less time delay, as noted by the unit impulse response peaks occurring sooner than they do for Bessel filters of equal order.

{{cite journal
, last=Thiran
, first=J.-P.
, date=1971
, title=Recursive digital filters with maximally flat group delay
, journal=IEEE Transactions on Circuit Theory
, volume=18
, issue=6
, pages=659–664
, doi=10.1109/TCT.1971.1083363
, issn=0018-9324

{{cite book
, title=The Digital Signal Processing Handbook
, last=Madisetti
, first=Vijay
, date=1997
, publisher=CRC Press
, isbn=9780849385728
, page=11-32
, language=en
, chapter=Section 11.3.2.2 Classical IIR Filter Types
, url=https://books.google.com/books?id=Zhc36gyobk0C

{{cite web , url=https://ccrma.stanford.edu/~jos/pasp/Thiran_Allpass_Interpolators.html
, title=Thiran Allpass Interpolators
, last=Smith III
, first=Julius O.
, date=2015-05-22
, publisher=W3K Publishing
, access-date=2022-05-14

{{cite thesis
, last=Välimäki
, first=Vesa
, date=1995
, title=Discrete-time modeling of acoustic tubes using fractional delay filters , url=http://users.spa.aalto.fi/vpv/publications/vesan_vaitos/ch3_pt3_allpass.pdf
, language=en
, publisher=Helsinki University of Technology

{{cite book
, title=Electronic filter simulation & design
, last1=Bianchi
, first1=Giovanni
, last2=Sorrentino
, first2=Roberto
, publisher=McGraw–Hill Professional
, year=2007
, isbn=978-0-07-149467-0
, pages=31–43
, url=https://books.google.com/books?id=5S3LCIxnYCcC&dq=Bessel+filter+polynomial&pg=PT53

{{cite journal
, last=Zhang
, first=Xi
, date=2008-07-01
, title=Design of maximally flat IIR filters with flat group delay responses
, url=https://www.sciencedirect.com/science/article/pii/S0165168408000212
, journal=Signal Processing
, volume=88
, issue=7
, pages=1792–1800
, doi=10.1016/j.sigpro.2008.01.016
, issn=0165-1684

External links

Bessel and Linear Phase Filters
— Nuhertz
Bessel Filter Constants
— C.R. Bond
Bessel Filters Polynomials, Poles and Circuit Elements
— C.R. Bond
Java source code to compute Bessel filter poles

Linear filters
Network synthesis filters
Electronic design